Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,276,779 papers from all fields of science
Search
Sign In
Create Free Account
Verifiable random function
In cryptography, the concept of a verifiable random function was introduced by Micali, Rabin, and Vadhan. It is a pseudo-random function that…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
2 relations
Cryptography
Key (cryptography)
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Crowd Verifiable Zero-Knowledge and End-to-end Verifiable Multiparty Computation
Foteini Baldimtsi
,
A. Kiayias
,
T. Zacharias
,
Bingsheng Zhang
IACR Cryptology ePrint Archive
2020
Corpus ID: 220270308
Auditing a secure multiparty computation (MPC) protocol entails the validation of the protocol transcript by a third party that…
Expand
2018
2018
Post-quantum verifiable random functions from ring signatures
Endre Abraham
IACR Cryptology ePrint Archive
2018
Corpus ID: 57760593
One of the greatest challenges on exchanging seemingly random nonces or data either on a trusted or untrusted channel is the…
Expand
2018
2018
Verifiable random functions with Boolean function constraints
Qianwen Wang
,
Rongquan Feng
,
Yan Zhu
Science China Information Sciences
2018
Corpus ID: 37576433
At first, we prove the conditional provability of our CVRF-BF scheme in terms of the following theorem. Theorem 1. CVRF BF scheme…
Expand
2018
2018
Automated Verification of Accountability in Security Protocols
R. Künnemann
,
Ilkan Esiyok
,
M. Backes
IEEE Computer Security Foundations Symposium
2018
Corpus ID: 44065082
Accountability is a recent paradigm in security protocol design which aims to eliminate traditional trust assumptions on parties…
Expand
Highly Cited
2017
Highly Cited
2017
Asymptotically Compact Adaptively Secure Lattice IBEs and Verifiable Random Functions via Generalized Partitioning Techniques
Shota Yamada
Annual International Cryptology Conference
2017
Corpus ID: 8862606
In this paper, we focus on the constructions of adaptively secure identity-based encryption (IBE) from lattices and verifiable…
Expand
2017
2017
Noninteractive Verifiable Outsourcing Algorithm for Bilinear Pairing with Improved Checkability
Yanli Ren
,
Min Dong
,
Zhihua Niu
,
Xiaoni Du
Secur. Commun. Networks
2017
Corpus ID: 46805549
It is well known that the computation of bilinear pairing is the most expensive operation in pairing-based cryptography. In this…
Expand
2015
2015
Simple uniform exponential stability conditions for a system of linear delay differential equations
L. Berezansky
,
J. Diblík
,
Z. Svoboda
,
Z. Šmarda
Applied Mathematics and Computation
2015
Corpus ID: 2074580
2008
2008
Improved Conditional E-Payments
Marina Blanton
International Conference on Applied Cryptography…
2008
Corpus ID: 10927414
Conditional e-cash or conditional e-payments have been introduced by Shi et al. as the means for enabling electronic payments to…
Expand
2008
2008
Security proof for verifiable random function
Wu Liang
2008
Corpus ID: 124617133
Verifiable random function is used to design the protocol of information security recently.VRF is based on RSA hard problem or…
Expand
2007
2007
Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability
Yi Deng
,
D. Lin
International Conference on the Theory and…
2007
Corpus ID: 280798
We introduce a notion of instance-dependent verifiable random functions(InstD-VRFs for short). Informally, an InstD-VRF is, in…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE