International Association for Cryptologic Research

International Association
for Cryptologic Research

IACR Local Search

Possible queries include homomorphic author:david.
Found 8000 results
Efficient verifiable delay functions
Eprint
https://eprint.iacr.org/2018/623
Benjamin Wesolowski
We construct a verifiable delay function (VDF). A VDF is a function whose evaluation requires running a given number of sequential steps, yet the result can be efficiently verified. They have applications in decentralised...
last revised 5 Feb 2019
Efficient Verifiable Delay Functions
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=29391
Benjamin Wesolowski
Eurocrypt 2019
We construct a verifiable delay function (VDF). A VDF is a function whose evaluation requires running a given number of sequential steps, yet the result can be efficiently verified. They have applications in decentralised...
A Survey of Two Verifiable Delay Functions
Eprint
https://eprint.iacr.org/2018/712
Dan Boneh Benedikt B\"unz Ben Fisch
A verifiable delay function (VDF) is an important tool used for adding delay in decentralized applications. This short note briefly surveys and compares two recent beautiful Verifiable Delay Functions (VDFs), one due to...
last revised 27 Aug 2018
Benjamin Wesolowski
Author
https://iacr.org/cryptodb/data/author.php?authorkey=9288
Verifiable Delay Functions from Supersingular Isogenies and Pairings
Eprint
https://eprint.iacr.org/2019/166
Luca De Feo Simon Masson Christophe Petit Antonio Sanso
We present two new Verifiable Delay Functions (VDF) based on assumptions from elliptic curve cryptography. We discuss both the advantages and some drawbacks of our constructions, we study their security and we demonstrate...
last revised 20 Feb 2019
Verifiable Delay Functions
Eprint
https://eprint.iacr.org/2018/601
Dan Boneh Joseph Bonneau Benedikt Bünz Ben Fisch
We study the problem of building a verifiable delay function (VDF). A VDF requires a specified number of sequential steps to evaluate, yet produces a unique output that can be efficiently and publicly verified. VDFs have many...
last revised 26 Jun 2019
Verifiable Delay Functions
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=28858
Dan Boneh Joseph Bonneau Benedikt Bünz Ben Fisch
Crypto 2018
We study the problem of building a verifiable delay function (VDF). A $$\text {VDF}$$VDFrequires a specified number of sequential steps to evaluate, yet produces a unique output that can be efficiently and publicly verified....
A note on isogeny-based hybrid verifiable delay functions
Eprint
https://eprint.iacr.org/2019/205
Barak Shani
Using the idea behind the recently proposed isogeny- and paring-based verifiable delay function (VDF) by De Feo, Masson, Petit and Sanso, we construct an isogeny-based VDF without the use of pairings. Our scheme is a hybrid of...
received 22 Feb 2019
Simple Verifiable Delay Functions
Eprint
https://eprint.iacr.org/2018/627
Krzysztof Pietrzak
We construct a verifable delay function (VDF) by showing how the Rivest-Shamir-Wagner time-lock puzzle can be made publicly verifiable. Concretely, we give a statistically sound public-coin protocol to prove that a tuple...
last revised 30 Apr 2019
Non-interactive Cryptographic Timestamping based on Verifiable Delay Functions
Eprint
https://eprint.iacr.org/2019/197
Esteban Landerreche Marc Stevens Christian Schaffner
We present the first treatment of non-interactive publicly-verifiable timestamping schemes in the Universal Composability framework. Similar to a simple construction by Mahmoody et al., we use non-parallelizable computational...
last revised 27 Feb 2019
Tight Verifiable Delay Functions
Eprint
https://eprint.iacr.org/2019/659
Nico Döttling Sanjam Garg Giulio Malavolta Prashant Nalini Vasudevan
A Verifiable Delay Function (VDF) is a function that takes at least $T$ sequential steps to evaluate and produces a unique output that can be verified efficiently, in time essentially independent of $T$. In this work we study...
received 4 Jun 2019
Continuous Verifiable Delay Functions
Eprint
https://eprint.iacr.org/2019/619
Naomi Ephraim Cody Freitag Ilan Komargodski Rafael Pass
We introduce the notion of a $\textit{continuous verifiable delay function}$ (cVDF): a function $g$ which is (a) iteratively sequential---meaning that evaluating the iteration $g^{(t)}$ of $g$ (on a random input) takes time...
last revised 3 Jun 2019
A Note on the (Im)possibility of Verifiable Delay Functions in the Random Oracle Model
Eprint
https://eprint.iacr.org/2019/663
Mohammad Mahmoody Caleb Smith David J. Wu
Boneh, Bonneau, Bünz, and Fisch (CRYPTO 2018) recently introduced the notion of a verifiable delay function (VDF). VDFs are functions that take a long sequential time $T$ to compute, but whose outputs $y \get \mathrm{Eval}(x)$...
last revised 5 Jun 2019
Fault Tolerant Implementations of Delay-based Physically Unclonable Functions on FPGA
Eprint
https://eprint.iacr.org/2016/441
Durga Prasad Sahoo Sikhar Patranabis Debdeep Mukhopadhyay Rajat Subhra Chakraborty
Recent literature has demonstrated that the security of Physically Unclonable Function (PUF) circuits might be adversely affected by the introduction of faults. In this paper, we propose novel and efficient architectures for a...
received 3 May 2016
Efficient Construction of (Distributed) Verifiable Random Functions
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=3314
Yevgeniy Dodis
Pkc 2003
Efficient Non-Interactive Verifiable Outsourced Computation for Arbitrary Functions
Eprint
https://eprint.iacr.org/2014/439
Chunming Tang Yuenai Chen
Non-interactive verifiable outsourced computation enables a computationally weak client to outsource the computation of a function $f$ on input $x$ to a more powerful but untrusted server, who will return the result of the...
received 7 Jun 2014
Efficient Construction of (Distributed) Verifiable Random Functions
Eprint
https://eprint.iacr.org/2002/133
Yevgeniy Dodis
We give the first simple and efficient construction of {\em verifiable random functions} (VRFs). VRFs, introduced by Micali et al. [MRV99], combine the properties of regular pseudorandom functions (PRFs) [GGM86] (i.e.,...
last revised 16 Oct 2002
Short Stickelberger Class Relations and Application to Ideal-SVP
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=27991
Ronald Cramer Léo Ducas Benjamin Wesolowski
Eurocrypt 2017
An Efficient Method for Random Delay Generation in Embedded Software
Iacrpub
https://iacr.org/cryptodb/data/paper.php?pubkey=18604
Jean-Sébastien Coron Ilya Kizhvatov
Ches 2009
A Comparative Analysis of Delay Based PUF Implementations on FPGA
Eprint
https://eprint.iacr.org/2009/629
Sergey Morozov Abhranil Maiti Patrick Schaumont
Physical Unclonable Functions promise cheap, efficient, and secure identification and authentication of devices. In FPGA devices, PUFs may be instantiated directly from FPGA fabric components in order to exploit the...
received 19 Dec 2009
Next ►