Revision 78e8f6ebf47bf6068da5d4a124e0cc909a12d494 authored by Pierre-Yves Strub on 26 November 2019, 13:30:43 UTC, committed by Pierre-Yves Strub on 26 November 2019, 13:31:58 UTC
- formalisation of the discrete logarithm assumption - formalisation of generic commitment schemes - formal verification of the Pedersen commitment scheme - formalisation of generic Sigma protocols - Sigma Protocol example: the Schnorr proof of knowledge Co-authored-by: Roberto Metere <r.metere2@ncl.ac.uk>
1 parent add72dc
default.nix
with import <nixpkgs> {};
stdenv.mkDerivation {
name = "easycrypt-1.0";
src = ./.;
buildInputs = [ ]
++ (with ocamlPackages; [ ocaml findlib ocamlbuild batteries menhir merlin zarith inifiles why3 yojson])
;
}
![swh spinner](/static/img/swh-spinner.gif)
Computing file changes ...