Pseudorandom Functions and Lattices
- 1 January 2012
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- Vol. 2011, 719-737
- https://doi.org/10.1007/978-3-642-29011-4_42
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- (Leveled) fully homomorphic encryption without bootstrappingPublished by Association for Computing Machinery (ACM) ,2012
- Efficient Fully Homomorphic Encryption from (Standard) LWEPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2011
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent MessagesLecture Notes in Computer Science, 2011
- New Algorithms for Learning in Presence of ErrorsLecture Notes in Computer Science, 2011
- Algebraic pseudorandom functions with improved efficiency from the augmented cascadePublished by Association for Computing Machinery (ACM) ,2010
- Efficient Lattice (H)IBE in the Standard ModelLecture Notes in Computer Science, 2010
- Bonsai Trees, or How to Delegate a Lattice BasisLecture Notes in Computer Science, 2010
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBELecture Notes in Computer Science, 2010
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning ProblemsLecture Notes in Computer Science, 2009
- Noise-tolerant learning, the parity problem, and the statistical query modelJournal of the ACM, 2003