## Section: New Results

### Symbolic Proofs for Lattice-Based Cryptography

Participants : Benjamin GrĂ©goire, Gilles Barthe [IMDEA] , Xiong Fan [Cornell] , Joshua Gancher [Cornell] , Charlie Jacomme [LSV] , Elaine Shi [Cornell] .

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 require significant expertise and interaction, or are fairly limited in scope and expressivity. In this work we introduce a symbolic approach for proving security of cryptographic constructions based on the Learning With Errors assumption. This work is described in [15].