Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
An implementation of the general number field sieve
CRYPTO '93 Proceedings of the 13th annual international cryptology conference on Advances in cryptology
Diffie-Hellman key distribution extended to group communication
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
CT-RSA '02 Proceedings of the The Cryptographer's Track at the RSA Conference on Topics in Cryptology
Soundness in the Public-Key Model
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Unique Signatures and Verifiable Random Functions from the DH-DDH Separation
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Supersingular Curves in Cryptography
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Efficient Construction of (Distributed) Verifiable Random Functions
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Number-theoretic constructions of efficient pseudo-random functions
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Lower bounds for discrete logarithms and related problems
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Improved proxy re-encryption schemes with applications to secure distributed storage
ACM Transactions on Information and System Security (TISSEC)
Enhancing privacy of federated identity management protocols: anonymous credentials in WS-security
Proceedings of the 5th ACM workshop on Privacy in electronic society
How to win the clonewars: efficient periodic n-times anonymous authentication
Proceedings of the 13th ACM conference on Computer and communications security
Feistel Networks Made Public, and Applications
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Simulatable Adaptive Oblivious Transfer
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
Improvement of Efficiency in (Unconditional) Anonymous Transferable E-Cash
Financial Cryptography and Data Security
Efficient Protocols for Set Membership and Range Proofs
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Weak Verifiable Random Functions
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Controlling Access to an Oblivious Database Using Stateful Anonymous Credentials
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Verifiable Random Functions from Identity-Based Key Encapsulation
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
Compact E-Cash and Simulatable VRFs Revisited
Pairing '09 Proceedings of the 3rd International Conference Palo Alto on Pairing-Based Cryptography
Practical electronic lotteries with offline TTP
Computer Communications
Improving privacy and security in multi-authority attribute-based encryption
Proceedings of the 16th ACM conference on Computer and communications security
Oblivious transfer with access control
Proceedings of the 16th ACM conference on Computer and communications security
Anonymous Conditional Proxy Re-encryption without Random Oracle
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Simulatable VRFs with applications to multi-theorem NIZK
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
IWSEC'07 Proceedings of the Security 2nd international conference on Advances in information and computer security
Improved conditional e-payments
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
Anonymity in transferable e-cash
ACNS'08 Proceedings of the 6th international conference on Applied cryptography and network security
A self-certified and Sybil-free framework for secure digital identity domain buildup
WISTP'08 Proceedings of the 2nd IFIP WG 11.2 international conference on Information security theory and practices: smart devices, convergence and next generation networks
Unidirectional chosen-ciphertext secure proxy re-encryption
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Provably secure integrated on/off-line electronic cash for flexible and efficient payment
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Pseudorandom functions and permutations provably secure against related-key attacks
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
On the use of financial data as a random beacon
EVT/WOTE'10 Proceedings of the 2010 international conference on Electronic voting technology/workshop on trustworthy elections
Additive combinatorics and discrete logarithm based range protocols
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Proof-of-knowledge of representation of committed value and its applications
ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
ProvSec'10 Proceedings of the 4th international conference on Provable security
Access controls for oblivious and anonymous systems
ACM Transactions on Information and System Security (TISSEC)
Sub-linear size traceable ring signatures without random oracles
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Oblivious transfer with hidden access control policies
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Practical adaptive oblivious transfer from simple assumptions
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Privacy-preserving data mining: a game-theoretic approach
DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
Verifiable delegation of computation over large datasets
CRYPTO'11 Proceedings of the 31st annual conference on Advances in cryptology
The twin bilinear diffie-Hellman inversion problem and applications
ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
Simulatable adaptive oblivious transfer with statistical receiver's privacy
ProvSec'11 Proceedings of the 5th international conference on Provable security
Unforgeability of re-encryption keys against collusion attack in proxy re-encryption
IWSEC'11 Proceedings of the 6th International conference on Advances in information and computer security
Non-interactive opening for ciphertexts encrypted by shared keys
ICICS'11 Proceedings of the 13th international conference on Information and communications security
On pairing-based cryptosystems
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
Efficient dynamic k-times anonymous authentication
VIETCRYPT'06 Proceedings of the First international conference on Cryptology in Vietnam
Updatable zero-knowledge databases
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
Cryptography based on bilinear maps
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Efficient rational secret sharing in standard communication networks
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
An e-lottery scheme using verifiable random function
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part III
Collusion resistant broadcast encryption with short ciphertexts and private keys
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Hierarchical identity based encryption with constant size ciphertext
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Unlinkable priced oblivious transfer with rechargeable wallets
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
Constructing verifiable random functions with large input spaces
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Privacy-protecting coupon system revisited
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Balancing accountability and privacy using e-cash (extended abstract)
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
k-times anonymous authentication with a constant proving cost
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
Security analysis of the strong diffie-hellman problem
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Practical identity-based encryption without random oracles
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Event-oriented k-times revocable-iff-linked group signatures
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Biometric-Based non-transferable anonymous credentials
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
Threshold and proactive pseudo-random permutations
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Cryptography secure against related-key attacks and tampering
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
Traceable signature with stepping capabilities
Cryptography and Security
TCC'12 Proceedings of the 9th international conference on Theory of Cryptography
Message authentication, revisited
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
DDH-Like assumptions based on extension rings
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Divisible e-cash in the standard model
Pairing'12 Proceedings of the 5th international conference on Pairing-Based Cryptography
Delegatable pseudorandom functions and applications
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Efficient signatures of knowledge and DAA in the standard model
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
| Hi-index | 0.00 |
We give a simple and efficient construction of a verifiable random function (VRF) on bilinear groups. Our construction is direct. In contrast to prior VRF constructions [14,15], it avoids using an inefficient Goldreich-Levin transformation, thereby saving several factors in security. Our proofs of security are based on a decisional bilinear Diffie-Hellman inversion assumption, which seems reasonable given current state of knowledge. For small message spaces, our VRF's proofs and keys have constant size. By utilizing a collision-resistant hash function, our VRF can also be used with arbitrary message spaces. We show that our scheme can be instantiated with an elliptic group of very reasonable size. Furthermore, it can be made distributed and proactive.