sci-mathematics/proverif (gentoo)

Search

Package Information

Description:
ProVerif is an automatic cryptographic protocol verifier, in the formal model (so called Dolev-Yao model). This protocol verifier is based on a representation of the protocol by Horn clauses. Its main features are: 1) It can handle many different cryptographic primitives, including shared- and public-key cryptography (encryption and signatures), hash functions, and Diffie-Hellman key agreements, specified both as rewrite rules or as equations. 2) It can handle an unbounded number of sessions of the protocol (even in parallel) and an unbounded message space. This result has been obtained thanks to some well-chosen approximations. This means that the verifier can give false attacks, but if it claims that the protocol satisfies some property, then the property is actually satisfied. The considered resolution algorithm terminates on a large class of protocols (the so-called "tagged" protocols). When the tool cannot prove a property, it tries to reconstruct an attack, that is, an execution trace of the protocol that falsifies the desired property.
Homepage:
https://bblanche.gitlabpages.inria.fr/proverif/ https://gitlab.inria.fr/bblanche/proverif/

Versions

Version EAPI Keywords Slot
9999 8 ~amd64 ~x86 0
2.05 8 ~amd64 ~x86 0
2.04-r1 8 ~amd64 ~x86 0

Metadata

Description

Maintainers

Upstream

Raw Metadata XML
<pkgmetadata>
	<maintainer type="project">
		<email>ml@gentoo.org</email>
		<name>ML</name>
	</maintainer>
	<maintainer type="project">
		<email>sci-mathematics@gentoo.org</email>
		<name>Gentoo Mathematics Project</name>
	</maintainer>
	<longdescription>
    ProVerif is an automatic cryptographic protocol verifier, in the formal
    model (so called Dolev-Yao model). This protocol verifier is based on a
    representation of the protocol by Horn clauses. Its main features are: 1)
    It can handle many different cryptographic primitives, including shared-
    and public-key cryptography (encryption and signatures), hash functions,
    and Diffie-Hellman key agreements, specified both as rewrite rules or as
    equations. 2) It can handle an unbounded number of sessions of the protocol
    (even in parallel) and an unbounded message space. This result has been
    obtained thanks to some well-chosen approximations. This means that the
    verifier can give false attacks, but if it claims that the protocol
    satisfies some property, then the property is actually satisfied. The
    considered resolution algorithm terminates on a large class of protocols
    (the so-called "tagged" protocols). When the tool cannot prove a property,
    it tries to reconstruct an attack, that is, an execution trace of the
    protocol that falsifies the desired property.
  </longdescription>
	<upstream>
		<bugs-to>https://gitlab.inria.fr/bblanche/proverif/-/issues/</bugs-to>
	</upstream>
</pkgmetadata>

Lint Warnings

USE Flags

Flag Description 9999 2.05 2.04-r1
emacs Add support for GNU Emacs

Files

Manifest

Type File Size Versions
DIST proverif2.05.tar.gz 980879 bytes 2.05
Unmatched Entries
Type File Size
DIST proverif-v2.04.tar.bz2 61001112 bytes