A Verifiable Random Function with Short Proofs and Keys
Authors:
Top Cited Papers
- 1 January 2005
- book chapter
- Published by Springer Nature
- p. 416-431
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Efficient Selective-ID Secure Identity-Based Encryption Without Random Oracles2004
- Short Signatures Without Random Oracles2004
- Handcuffing Big Brother: an Abuse-Resilient Transaction Escrow SchemeLecture Notes in Computer Science, 2004
- Verifiable random functions2003
- Efficient Construction of (Distributed) Verifiable Random Functions2002
- Supersingular Curves in Cryptography2001
- Identity-Based Encryption from the Weil Pairing2001
- An implementation of the general number field sieve2001
- A hard-core predicate for all one-way functions1989
- Non-cryptographic fault-tolerant computing in constant number of rounds of interaction1989