Verifiable Random Functions from Non-interactive Witness-Indistinguishable Proofs
Author:
- Nir BitanskyNBNir Bitansky
- 5 November 2017
- book chapter
- Published by Springer Nature
- p. 567-594
Abstract
No abstract availableThis publication has 42 references indexed in Scilit:
- Enhancements of Trapdoor PermutationsJournal of Cryptology, 2012
- New Techniques for Noninteractive Zero-KnowledgeJournal of the ACM, 2012
- Number-theoretic constructions of efficient pseudo-random functionsJournal of the ACM, 2004
- Breaking generalized Diffie–Hellman modulo a composite is no easier than factoringInformation Processing Letters, 1999
- Synthesizers and Their Application to the Parallel Construction of Pseudo-Random FunctionsJournal of Computer and System Sciences, 1999
- Multiple NonInteractive Zero Knowledge Proofs Under General AssumptionsSIAM Journal on Computing, 1999
- Certifying Permutations: Noninteractive Zero-Knowledge Based on Any Trapdoor PermutationJournal of Cryptology, 1996
- Noninteractive Zero-KnowledgeSIAM Journal on Computing, 1991
- How to construct random functionsJournal of the ACM, 1986
- Universal classes of hash functionsJournal of Computer and System Sciences, 1979