Constructing Verifiable Random Functions with Large Input Spaces
- 1 January 2010
- conference paper
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 26 references indexed in Scilit:
- Verifiable Random Functions from Identity-Based Key EncapsulationPublished by Springer Science and Business Media LLC ,2009
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE SchemePublished by Springer Science and Business Media LLC ,2009
- Weak Verifiable Random FunctionsLecture Notes in Computer Science, 2009
- Simulatable VRFs with Applications to Multi-theorem NIZKPublished by Springer Science and Business Media LLC ,2007
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private KeysLecture Notes in Computer Science, 2005
- Hierarchical Identity Based Encryption with Constant Size CiphertextLecture Notes in Computer Science, 2005
- Compact E-CashLecture Notes in Computer Science, 2005
- Identity-Based Encryption from the Weil PairingLecture Notes in Computer Science, 2001
- Fast batch verification for modular exponentiation and digital signaturesPublished by Springer Science and Business Media LLC ,1998
- Noninteractive Zero-KnowledgeSIAM Journal on Computing, 1991