Charlie Jacomme
Charlie Jacomme
Home
Open Positions
Teaching
Non Academic Materials
Contact
Light
Dark
Automatic
Symbolic Proofs for Lattice-Based Cryptography
Gilles Barthe
,
Xiong Fan
,
Joshua Gancher
,
Benjamin Grégoire
,
Charlie Jacomme
,
Elaine Shi
October 2018
PDF
Cite
URL
Type
Conference paper
Publication
Proceedings of the 25th ACM Conference on Computer and Communications Security (CCS'18)
Related
Symbolic methods in computational cryptography proofs
Universal Equivalence and Majority of Probabilistic Programs over Finite Fields
Universal equivalence and majority on probabilistic programs over finite fields
Formal verification of the PQXDH Post-Quantum key agreement protocol for end-to-end secure messaging
Post-quantum sound CryptoVerif and verification of hybrid TLS and SSH key-exchanges
Cite
×