Asymptotically Compact Adaptively Secure Lattice IBEs and Verifiable Random Functions via Generalized Partitioning Techniques
Author:
- 2 August 2017
- book chapter
- Published by Springer Nature
- p. 161-193
Abstract
No abstract availableKeywords
This publication has 52 references indexed in Scilit:
- Verifiable Random Functions: Relations to Identity-Based Key Encapsulation and New ConstructionsJournal of Cryptology, 2013
- Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces2013
- Programmable Hash Functions in the Multilinear Setting2013
- A Verifiable Random Function with Short Proofs and Keys2005
- Secure Identity Based Encryption Without Random Oracles2004
- Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles2004
- On expander codesIEEE Transactions on Information Theory, 2001
- Expander codesIEEE Transactions on Information Theory, 1996
- Bounded-width polynomial-size branching programs recognize exactly those languages in NC1Journal of Computer and System Sciences, 1989
- Log Depth Circuits for Division and Related ProblemsSIAM Journal on Computing, 1986