One Shot Verifiable Encryption from Lattices

Explore a groundbreaking paper on verifiable encryption from lattices presented at Eurocrypt 2017. Delve into the innovative work of Vadim Lyubashevsky and Gregory Neven as they introduce a one-shot approach. Begin with an introduction and examples before diving into polynomial rings and the construction of zero-knowledge proofs for discrete log relations. Examine the implications of extraction and practical applications, with proofs as small as 20KB. Investigate main open problems in verifiable encryption and the Ring-LWE encryption scheme. Learn about approximate proofs, proofs of plaintext knowledge, and the authors' solution outline. Conclude by understanding techniques to limit the number of random oracle queries by adversaries in this 25-minute exploration of cutting-edge cryptographic research.