A Verifiable Random Function with Short Proofs and Keys

By Yevgeniy Dodis, Aleksandr Yampolskiy. International Conference on Theory and Practice of Public Key Cryptography, 2005

483 citations recorded by the source corpus.

Subfields: Artificial Intelligence, Information Systems

View Paper: https://www.semanticscholar.org/paper/f1c1875ca16d74ac2b6bc23470af702b435507b6

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Artificial Intelligence

In Information Systems

Citations in the corpus

Short Signatures Without Random Oracles and the SDH Assumption in Bilinear Groups (2008, methodology): “We mention that a weaker version of the SDH assumption was previously used by Mitsunari, Sakai, and Kasahara [35] to construct a traitor tracing system (see also [47]), by Boneh and Boyen [8] to construct an identity-based encryption system, and by Dodis and Yampolskiy [19] to construct a verifiable”
Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption (2008, background): “Dodis and Yampolskiy [25] showed the generic hardness of -DBDHI and their result implies the generic computational infeasibility of -wDBDHI.”
Floating Car Data from Smartphones : What Google and Waze Know About You and How Hackers Can Control Traffic (2013, background): “According to Dodi and Yampolskiy fg,s is a pseudo-random function [9] and defined as:”
Compact E-Cash (2005, methodology): “2 Others [4, 31] have used a stronger bilinear version of the y-DDHI assumption, where, given the same input in 〈g〉y+1 it is hard to distinguish e(g, g) from a random R in 〈e(g, g)〉.”
Efficient Batched Oblivious PRF with Applications to Private Set Intersection (2016, methodology): “The protocol of [13] obliviously evaluates a variant of the Dodis-Yampolskiy PRF [4] and hence requires exponentiations (as well as other algebraic encryption components to facilitate the OPRF protocol).”
Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection (2009, methodology): “Argument Sketch: Assuming decisional q-DHI holds in group G of order a safe RSA modulus n, the argument why fk(x) in G is a PRF follows from the argument of Theorem 1 in [13] and the fact that under the assumption of hardness of safe RSA moduli, efficient algorithms can encounter elements v s.”
CONIKS: Bringing Key Transparency to End Users (2015, background): “[15] to achieve 256-bit signatures and VRFs of 512 bits (including the result and a 256-bit proof).”
Ouroboros Praos: An Adaptively-Secure, Semi-synchronous Proof-of-Stake Blockchain (2018, background): “[10]), an adversary that maliciously generates keys can easily and significantly skew the output distribution.”
Verifiable Delegation of Computation over Large Datasets (2011, methodology): “Prior solutions either rely on non-constant size assumptions (such as variants of the Strong Diffie-Hellman assumption [23,15]), require expensive generation of primes for each operation (in the worst case), or require expensive “re-shuffling” procedures to be performed once in a while on the data.”
How to win the clonewars: efficient periodic n-times anonymous authentication (2006, background): “Let G =hgi be a group of prime order q2 (2 k). Let a be a random element of Z q. Dodis and Yampolskiy [ 33 ] showed that fDY g,a (x) = g1/(a+x) is a”
Hierarchical Identity Based Encryption with Constant Size Ciphertext (2005, methodology): “We show that the ‘-BDHE is a natural extension of the Bilinear Die-Hellman Inversion problem, which was previously used in various constructions [1, 12 ,19].”
Constant-Size Dynamic k-TAA (2006, methodology): “To restrict the user from authenticating himself for more than k times, pseudo-random function(PRF) due to Dodis and Yampolskiy [12] is used as follow.”
Efficient Protocols for Set Membership and Range Proofs (2008, methodology): “This scheme is similar to the Dodis and Yampolskiy verifiable random function [12].”
Ouroboros Genesis: Composable Proof-of-Stake Blockchains with Dynamic Availability (2018, methodology): “For this reason, we implement the slot-leader election as follows: Each partyUp checks whether or not it is a slot leader, by locally evaluating a verifiable random function (VRF, [17], modeled by FVRF) using the secret key associated with its stake, and providing as inputs to the VRF both the slot ”
Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys (2005, unknown): “Occasionally we drop the t and and refer to the (decision) ‘-BDHE in G. We note that the ‘-BDHE assumption is a natural extension of the bilinear-DHI assumption previously used in [BB04, DY05 ].”
Improving privacy and security in multi-authority attribute-based encryption (2009, methodology): “For our key issuing protocol, we will use a modi.ed version of the of the Dodis-Yampolskiy PRF [7], suggested in [9], which relies on the intractability of the k-DDHI problem in group G1 of a pairing.”