Filters








22 Hits in 1.1 sec

A tutorial introduction to CryptHOL [article]

Andreas Lochbihler, S. Reza Sefidgar
2018 IACR Cryptology ePrint Archive  
This tutorial demonstrates how cryptographic security notions, constructions, and game-based security proofs can be formalized using the CryptHOL framework.  ...  As a running example, we formalize a variant of the hash-based ElGamal encryption scheme and its IND-CPA security in the random oracle model.  ...  We split the tutorial into a series of recipes for common formalization tasks. In each section, we cover a familiar cryptography concept and show how it is formalized in CryptHOL.  ... 
dblp:journals/iacr/LochbihlerS18 fatcat:p4qvwalwazcwrg37jgg32u5glm

Formalising $$\varSigma $$-Protocols and Commitment Schemes Using CryptHOL

D. Butler, A. Lochbihler, D. Aspinall, A. Gascón
2020 Journal of automated reasoning  
We use CryptHOL (Lochbihler in Archive of formal proofs, 2017) to formalise both primitives and prove secure multiple examples namely; the Schnorr, Chaum-Pedersen and Okamoto $$\varSigma $$ Σ -protocols  ...  We formalise this proof at an abstract level using the modularity available in Isabelle/HOL and CryptHOL. This way, the proofs of the instantiations come for free.  ...  Formalisation Overview CryptHOL has been used for a number of formalisations of cryptography thus far.  ... 
doi:10.1007/s10817-020-09581-w fatcat:plg6seffhvf5xat2e5mwssxamm

Formalising Σ-Protocols and Commitment Schemes using CryptHOL [article]

David Butler, Andreas Lochbihler, David Aspinall, Adrià Gascón
2019 IACR Cryptology ePrint Archive  
We use CryptHOL [31] to formalise both primitives and prove secure multiple examples namely; the Schnorr, Chaum-Pedersen and Okamoto Σ-protocols as well as a construction that allows for compound (AND  ...  We formalise this proof at an abstract level using the modularity available in Isabelle/HOL and CryptHOL. This way, the proofs of the instantiations come for free.  ...  Formalisation overview CryptHOL has been used for a number of formalisations of cryptography thus far.  ... 
dblp:journals/iacr/ButlerLAG19 fatcat:p4nmo7cuuvhifdq5p5hoaorjlu

On the Formalisation of $$\varSigma $$ -Protocols and Commitment Schemes [chapter]

David Butler, David Aspinall, Adrià Gascón
2019 Research Series on the Chinese Dream and China's Development Path  
There is a fundamental relationship between Σ-protocols and commitment schemes whereby the former can be used to construct the latter.  ...  In this work we provide the first formal analysis in a proof assistant of such a relationship and in doing so formalise Σ-protocols and commitment schemes and provide proofs of security for well known  ...  We are grateful to Andreas Lochbihler for providing and continuing to develop CryptHOL and for his kind help given with using it. On the Formalisation of Σ-Protocols and Commitment Schemes  ... 
doi:10.1007/978-3-030-17138-4_8 dblp:conf/post/ButlerAG19 fatcat:razflr2bbnd65amqwt5x3xfqqu

How to Simulate It in Isabelle: Towards Formal Proof for Secure Multi-Party Computation [chapter]

David Butler, David Aspinall, Adrià Gascón
2017 Lecture Notes in Computer Science  
We implement our proofs using the CryptHOL framework inside Isabelle/HOL.  ...  In cryptography, secure Multi-Party Computation (MPC) protocols allow participants to compute a function jointly while keeping their inputs private.  ...  We are deeply grateful to Andreas Lochbihler for providing and continuing to develop CryptHOL and for his kind help given with using it.  ... 
doi:10.1007/978-3-319-66107-0_8 fatcat:llgwa2af4bf6flvihhjfzf5jfa

How to Simulate It in Isabelle: Towards Formal Proof for Secure Multi-Party Computation [article]

David Butler, David Aspinall, Adria Gascon
2018 arXiv   pre-print
We implement our proofs using the CryptHOL framework inside Isabelle/HOL.  ...  In cryptography, secure Multi-Party Computation (MPC) protocols allow participants to compute a function jointly while keeping their inputs private.  ...  We are deeply grateful to Andreas Lochbihler for providing and continuing to develop CryptHOL and for his kind help given with using it.  ... 
arXiv:1805.12482v1 fatcat:xp2dyql3ojeupfw646vj6qqf7i

CryptHOL: Game-based Proofs in Higher-order Logic [article]

David A. Basin, Andreas Lochbihler, S. Reza Sefidgar
2017 IACR Cryptology ePrint Archive  
We evaluate our framework by formalizing different game-based proofs from the literature and comparing the results with existing formal-methods tools.  ...  CryptHOL is based on a new semantic domain with an associated functional programming language for expressing games.  ...  For example, constructive cryptography has been formalized in Isabelle/HOL using CryptHOL [52] .  ... 
dblp:journals/iacr/BasinLS17 fatcat:y5zxivqgnjdn3dlrzekpdkv47q

IPDL: A Probabilistic Dataflow Logic for Cryptography [article]

Xiong Fan, Joshua Gancher, Greg Morrisett, Elaine Shi, Kristina Sojakova
2019 IACR Cryptology ePrint Archive  
We work towards closing this gap through a new methodology for iteratively constructing bisimulations in a manner close to on-paper intuition.  ...  Because of this, there is currently a large gap of formality between proofs of cryptographic protocols on paper and in mechanized theorem provers.  ...  CryptHOL is a formalization of the Constructive Cryptography framework [Mau11] in Isabelle.  ... 
dblp:journals/iacr/FanGMSS19 fatcat:yetgnlzsobhqxj5ckyvf33etbq

IPDL: A Simple Framework for Formally Verifying Distributed Cryptographic Protocols [article]

Greg Morrisett, Elaine Shi, Kristina Sojakova, Xiong Fan, Joshua Gancher
2021 IACR Cryptology ePrint Archive  
We demonstrate the use of IPDL by a number of case studies, including a multi-use, secure message communication protocol, a multi-party coin toss with abort protocol, several oblivious transfer constructions  ...  This design allows us to capture a broad class of protocols encountered in the cryptography literature, including multi-party, reactive, and/or inductively-defined protocols; meanwhile, the logic can track  ...  To enable scalable formal verification for complex cryptography, our goal is to provide an easy-to-use system for encoding and mechanically checking proofs for multi-party protocols.  ... 
dblp:journals/iacr/MorrisettSSFG21 fatcat:2szs3xfirfgzpdmdfck4mhow5a

SSProve: A Foundational Framework for Modular Cryptographic Proofs in Coq [article]

Carmine Abate, Philipp G. Haselwarter, Exequiel Rivas, Antoine Van Muylder, Théo Winterhalter, Catalin Hritcu, Kenji Maillard, Bas Spitters
2021 IACR Cryptology ePrint Archive  
SSProve combines high-level modular proofs about composed protocols, as proposed in SSP, with a probabilistic relational program logic for formalizing the lower-level details, which together enable constructing  ...  While very promising, this methodology was previously not fully formalized and came with little tool support.  ...  CryptHOL [35] has been also used to formalize Constructive Cryptography [38] , another composable framework that inspired SSP, and the example of a one-time pad.  ... 
dblp:journals/iacr/AbateHRMWHMS21 fatcat:l6tiwvirgzhnpnh3lzmfycnjau

Bringing State-Separating Proofs to EasyCrypt - A Security Proof for Cryptobox [article]

François Dupressoir, Konrad Kohbrok, Sabine Oechsner
2021 IACR Cryptology ePrint Archive  
Machine-checked cryptography aims to reinforce confidence in the primitives and protocols that underpin all digital security.  ...  As a side effect, we obtain the first formal security proof for NaCl's instantiation of cryptobox.  ...  [51] for Constructive Cryptography [6] in CryptHOL [11] , and SSProve [32] for SSP in Coq.  ... 
dblp:journals/iacr/DupressoirKO21 fatcat:pnfwvdienbasvnsyyzrrbdo2rm

Computer-aided proofs for multiparty computation with active security [article]

Helene Haagh, Aleksandr Karbyshev, Sabine Oechsner, Bas Spitters, Pierre-Yves Strub
2018 arXiv   pre-print
In the field of cryptography, EasyCrypt is the state of the art proof assistant.  ...  It allows us to conveniently express cryptographic properties.  ...  ACKNOWLEDGEMENTS Gilles Barthe showed us how non-interference can be used in the context of MPC for a passive adversary. Ivan Damgård helped us to understand MPC protocols and their security proofs.  ... 
arXiv:1806.07197v1 fatcat:lyvuiam43vgi7oibcbed2suova

Machine-checked ZKP for NP-relations: Formally Verified Security Proofs and Implementations of MPC-in-the-Head [article]

José Carlos Bacelar Almeida
2021 arXiv   pre-print
Using a recently developed code extraction mechanism for EasyCrypt we synthesize a formally verified implementation of the protocol, which we benchmark to get an indication of the overhead associated with  ...  us to leverage an existing machine-checked secret-sharing-based MPC protocol development.  ...  The t-privacy property is formalized using the same approach used for the zero-knowledge property, the main difference being that the simulator must now construct t views to be fed to a distinguisher.  ... 
arXiv:2104.05516v3 fatcat:uytuhvwdxratpel7fh3etledji

EasyUC: Using EasyCrypt to Mechanize Proofs of Universally Composable Security

Ran Canetti, Alley Stoughton, Mayank Varia
2019 2019 IEEE 32nd Computer Security Foundations Symposium (CSF)  
This allows, for the first time, the mechanization and formal verification of the entire sequence of steps needed for proving simulation-based security in a modular way: • Specifying a protocol and the  ...  desired ideal functionality. • Constructing a simulator and demonstrating its validity, via reduction to hard computational problems. • Invoking the universal composition operation and demonstrating that  ...  It is a pleasure to acknowledge useful discussions with Manuel Barbosa, Gilles Barthe, Joshua Gancher, Assaf Kfoury and Tomislav Petrovic.  ... 
doi:10.1109/csf.2019.00019 dblp:conf/csfw/CanettiSV19 fatcat:ficfekq7rncwzcvyqoragps3v4

Symbolic Proofs for Lattice-Based Cryptography

Gilles Barthe, Xiong Fan, Joshua Gancher, Benjamin Grégoire, Charlie Jacomme, Elaine Shi
2018 Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security - CCS '18  
Such constructions are instances of lattice-based cryptography and are extremely important due to their potential role in post-quantum cryptography.  ...  Symbolic methods have been used extensively for proving security of cryptographic protocols in the Dolev-Yao model, and more recently for proving security of cryptographic primitives and constructions  ...  These constructions constitute a prime target for formal verification, due to their potential applications in post-quantum cryptography and their importance in the ongoing NIST effort to standardize post-quantum  ... 
doi:10.1145/3243734.3243825 dblp:conf/ccs/BartheFGGJS18 fatcat:usfeiudngrdcnisy5nzmoc4nk4
« Previous Showing results 1 — 15 out of 22 results