搜索结果: 1-9 共查到“密码学 verifiable random functions”相关记录9条 . 查询时间(0.078 秒)
Hunting and Gathering - Verifiable Random Functions from Standard Assumptions with Short Proofs
public-key cryptography verifiable random functions
font style='font-size:12px;'>
2019/1/18
A verifiable random function (VRF) is a pseudorandom function, where outputs can be publicly verified. That is, given an output value together with a proof, one can check that the function was indeed ...
Post-quantum verifiable random functions from ring signatures
ring signatures quantum oracles
font style='font-size:12px;'>
2019/1/2
One of the greatest challenges on exchanging seemingly random nonces or data either on a trusted or untrusted channel is the hardness of verify- ing the correctness of such output. If one of the parti...
Verifiable Random Functions from Non-Interactive Witness-Indistinguishable Proofs
verifiable-random-functions non-interactive-witness-indistinguishable-proofs
font style='font-size:12px;'>
2017/2/20
The above primitives can be instantiated under various standard assumptions, which yields corresponding VRF instantiations, under different assumptions than were known so far. One notable example is a...
A Generic Approach to Constructing and Proving Verifiable Random Functions
VRFs PRFs
font style='font-size:12px;'>
2017/2/20
Verifiable Random Functions (VRFs) as introduced by Micali, Rabin and Vadhan are a special form of Pseudo Random Functions (PRFs) wherein a secret key holder can also prove validity of the function ev...
Asymptotically Compact Adaptively Secure Lattice IBEs and Verifiable Random Functions via Generalized Partitioning Techniques
identity-based encryption verifiable random function adaptive security
font style='font-size:12px;'>
2017/2/20
In this paper, we focus on the constructions of adaptively secure identity-based encryption (IBE) from lattices and verifiable random function (VRF) with large input spaces. Existing constructions of ...
Constrained Verifiable Random Functions
Verifiable random functions constrained pseudorandom functions
font style='font-size:12px;'>
2016/1/8
We extend the notion of verifiable random functions (VRF) to constrained VRFs, which generalize
the concept of constrained pseudorandom functions, put forward by Boneh and Waters
(Asiacrypt’13), and...
Verifiable Random Functions from Weaker Assumptions
Verifiable random functions q-type assumptions
font style='font-size:12px;'>
2016/1/6
The construction of a verifiable random function (VRF) with large input space and full adaptive security from a static, non-interactive complexity assumption, like decisional Diffie-Hellman, has prove...
Verifiable Random Functions from Standard Assumptions
Verifiable random functions standard assumptions decision-linear assumption
font style='font-size:12px;'>
2015/12/21
The question whether there exist verifiable random functions with exponential-sized input
space and full adaptive security based on a non-interactive, constant-size assumption is a longstanding
open...
Uniqueness is a Different Story: Impossibility of Verifiable Random Functions from Trapdoor Permutations
verifiable random functions trapdoor permutations black-box separations
font style='font-size:12px;'>
2010/12/22
Verifiable random functions (VRFs), firstly proposed by Micali, Rabin, and Vadhan (FOCS 99), are pseudorandom functions with the additional property that the owner of the seed $\vsk$ can issue publicl...