First Page | Document Content | |
---|---|---|
Date: 2018-02-16 15:03:09Cryptography Computational hardness assumptions Decisional DiffieHellman assumption Computational DiffieHellman assumption Decision Linear assumption DiffieHellman problem Learning with errors Weight Provable security IP XDH assumption Ideal lattice cryptography | Semantic Security Invariance under Variant Computational Assumptions Eftychios Theodorakis? and John C. Mitchell?? Abstract. A game-based cryptographic proof is a relation that establishes equivalence between probabilistAdd to Reading ListSource URL: eftychis.orgDownload Document from Source WebsiteFile Size: 634,17 KBShare Document on Facebook |
An improved compression technique for signatures based on learning with errors Shi Bai and Steven D. Galbraith Department of Mathematics, University of Auckland, New Zealand.DocID: 1xTLZ - View Document | |
Practical post-quantum key exchange from the Learning with Errors ProblemDocID: 1vdCU - View Document | |
Quantum computers and factoring Learning with errors Cryptography from LWE From linear algebra to post-quantum cryptographyDocID: 1uiVi - View Document | |
FrodoKEM Learning With Errors Key Encapsulation Algorithm Specifications And Supporting Documentation November 30,DocID: 1tCj6 - View Document | |
Interpolating Predicate and Functional Encryption from Learning With Errors Shweta Agrawal ∗DocID: 1taPr - View Document |