Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
- 1 January 2015
- book chapter
- Published by Springer Nature
- p. 1-30
Abstract
No abstract availableKeywords
This publication has 23 references indexed in Scilit:
- Constrained Pseudorandom Functions and Their Applications2013
- Key Homomorphic PRFs and Their Applications2013
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller2012
- Bonsai Trees, or How to Delegate a Lattice BasisJournal of Cryptology, 2011
- Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions2011
- Secure Identity Based Encryption Without Random Oracles2004
- Distributed Pseudo-random Functions and KDCs1999
- Cryptographic Primitives Based on Hard Learning Problems1994
- A hierarchy of polynomial time lattice basis reduction algorithmsTheoretical Computer Science, 1987
- How to construct random functionsJournal of the ACM, 1986