From 1013bb04a30c552ec7ff5e3fe97074b0531a024d Mon Sep 17 00:00:00 2001 From: V3n3RiX Date: Mon, 14 Aug 2023 00:11:33 +0100 Subject: gentoo auto-resync : 14:08:2023 - 00:11:33 --- sci-mathematics/proverif/metadata.xml | 33 +++++++++++++++++++++++++++++++++ 1 file changed, 33 insertions(+) create mode 100644 sci-mathematics/proverif/metadata.xml (limited to 'sci-mathematics/proverif/metadata.xml') diff --git a/sci-mathematics/proverif/metadata.xml b/sci-mathematics/proverif/metadata.xml new file mode 100644 index 000000000000..e388e8201c2b --- /dev/null +++ b/sci-mathematics/proverif/metadata.xml @@ -0,0 +1,33 @@ + + + + + + ml@gentoo.org + ML + + + sci-mathematics@gentoo.org + Gentoo Mathematics Project + + + 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. + + + https://gitlab.inria.fr/bblanche/proverif/-/issues/ + + -- cgit v1.2.3