Symbolic Proofs for Lattice-Based Cryptography

Joshua Gancher
Joshua Gancher
Charlie Jacomme
Charlie Jacomme

IACR Cryptology ePrint Archive, Volume 2018, 2018, Pages 538-555.

Cited by: 5|Bibtex|Views16|Links
EI

Abstract:

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 in the computational model. However, existing methods for proving security of cryptographic constructions in the computational model often ...More

Code:

Data:

Your rating :
0

 

Tags
Comments