Public-Key Cryptography from Different Assumptions Benny Applebaum∗ Boaz Barak† Avi Wigderson‡

First Page		Document Content
Date: 2011-10-10 23:51:30 Electronic commerce Computational hardness assumptions Hidden Field Equations Pseudorandom generator RSA XTR Learning with errors Clique problem One-way function Cryptography Finite fields Public-key cryptography		Public-Key Cryptography from Different Assumptions Benny Applebaum∗ Boaz Barak† Avi Wigderson‡ Add to Reading List Source URL: www.boazbarak.org Download Document from Source Website File Size: 497,73 KB Share 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 Problem DocID: 1vdCU - View Document
	Quantum computers and factoring Learning with errors Cryptography from LWE From linear algebra to post-quantum cryptography DocID: 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