Hunting and Gathering – Verifiable Random Functions from Standard Assumptions with Short Proofs
Author:
- 6 April 2019
- book chapter
- Published by Springer Nature
- p. 408-437
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs2017
- Verifiable Random Functions: Relations to Identity-Based Key Encapsulation and New ConstructionsJournal of Cryptology, 2013
- From Selective to Full Security: Semi-generic Transformations in the Standard ModelLecture Notes in Computer Science, 2012
- Algebraic pseudorandom functions with improved efficiency from the augmented cascade2010
- Bonsai Trees, or How to Delegate a Lattice Basis2010
- Verifiable Random Functions from Identity-Based Key Encapsulation2009
- Compact E-Cash and Simulatable VRFs Revisited2009
- Practical Compact E-Cash2007
- Secure Identity Based Encryption Without Random Oracles2004
- Efficient Construction of (Distributed) Verifiable Random Functions2002