Verifiable Delay Functions

Boneh, Dan; Bonneau, Joseph; Bünz, Benedikt; Fisch, Ben

doi:10.1007/978-3-319-96884-1_25

Cited by 310 publications

(273 citation statements)

References 43 publications

Supporting

Mentioning

273

Contrasting

Order By: Relevance

“…For these reasons, hashing nonces is considered by the authors as equal or less secure than the XOR strategy. Delayed evaluation [45]: as discussed previously, a dishonest beacon can alter its nonce in an attempt to influence the other nonces it is combined with, to try and influence the final outcome. Variable delay functions (VDF) are processes designed to strategically slow down calculation of some task, and hence can be used to slow down the process of evaluating the pool of nonces.…”

Section: Sources Of Randomnessmentioning

confidence: 99%

An authentication protocol based on chaos and zero knowledge proof

2020

View full text Add to dashboard Cite

Port Knocking is a method for authenticating clients through a closed stance firewall, and authorising their requested actions, enabling severs to offer services to authenticated clients, without opening ports on the firewall. Advances in port knocking have resulted in an increase of complexity in design, preventing port knocking solutions from realising their potential. This paper proposes a novel port knocking solution, named Crucible, which is a secure method of authentication, with high usability and features of stealth, allowing servers and services to remain hidden and protected. Crucible is a stateless solution, only requiring the client memorise a command, the server's IP and a chosen password. The solution is forwarded as a method for protecting servers against attacks ranging from port scans, to zero-day exploitation. To act as a random oracle for both client and server, cryptographic hashes were generated through chaotic systems.

show abstract

Section: Sources Of Randomnessmentioning

confidence: 99%

An authentication protocol based on chaos and zero knowledge proof

2020

View full text Add to dashboard Cite

show abstract

“…This delay function prevents malicious miners from computing the random output, and it also provides a short proof which is used during the verification of the output along with previously generated public parameters. Boneh et al described the concept of VDF [179] as well as illustrated the idea about how it can be applicable to blockchain. VDF can be efficiently used as a way to add a delay in decentralized applications.…”

Section: Verifiable Delay Function (Vdf)mentioning

confidence: 99%

SoK of Used Cryptography in Blockchain

2019

View full text Add to dashboard Cite

The underlying fundaments of blockchain are cryptography and cryptographic concepts that provide reliable and secure decentralized solutions. Although many recent papers study the use-cases of blockchain in different industrial areas, such as finance, health care, legal relations, IoT, information security, and consensus building systems, only few studies scrutinize the cryptographic concepts used in blockchain. To the best of our knowledge, there is no Systematization of Knowledge (SoK) that gives a complete picture of the existing cryptographic concepts which have been deployed or have the potential to be deployed in blockchain. In this paper, we thoroughly review and systematize all cryptographic concepts which are already used in blockchain. Additionally, we give a list of cryptographic concepts which have not yet been applied but have big potentials to improve the current blockchain solutions. We also include possible instantiations of these cryptographic concepts in the blockchain domain. Last but not least, we explicitly postulate 21 challenging problems that cryptographers interested in blockchain can work on.

show abstract

“…Lerner [37] suggests using "time-asymmetric encodings, " such as a Pohlig-Hellman cipher [42] based on modular exponentiation, to apply a slow transformation to each input file block using a unique identifier as a key. Boneh et al [12] generalize this construction as decodable verifiable delay functions. Intuitively, this yields a sound PIE-re-deriving any block of the encoding is slow-but the encoding time for these constructions scales poorly with file size, resulting in a poor security efficiency ratio (SER)-our efficiency metric defined in Section 6.…”

Section: Previous Approaches To Piesmentioning

confidence: 99%

“…Addressing parallel computation is important given current developments in application-specific integrated circuits (ASICs) [50], which achieve modest improvements in sequential performance and drastically increased parallelism. This security notion has been used before in time-lock puzzles [45], proofs of sequential work (PoSW) [18,38], verifiable delay functions (VDFs) [12], and more.…”

Section: Security Definitionsmentioning

confidence: 99%

“…For example, Lenstra and Wesolowski propose the Sloth permutation [36] based on modular square roots interleaved with a fast PRPs. Boneh et al [12] note that separately applying such a PRP to each small file block is sufficient to construct a PIE without a complicated encoding scheme. A DSaG complements that approach by massively increasing the sequential work needed to encode a file, with only minor overhead in overall work.…”

Section: Rapid Decodingmentioning

confidence: 99%

See 1 more Smart Citation

PIEs

Cecchetti

Fisch

Miers

et al. 2019

Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security

Self Cite

View full text Add to dashboard Cite

We present a new primitive supporting file replication in distributed storage networks (DSNs) called a Public Incompressible Encoding (PIE). PIEs operate in the challenging public DSN setting where files must be encoded and decoded with public randomness-i.e., without encryption-and retention of redundant data must be publicly verifiable. They prevent undetectable data compression, allowing DSNs to use monetary rewards or penalties in incentivizing economically rational servers to properly replicate data. Their definition also precludes critical, demonstrated attacks involving parallelism via ASICs and other custom hardware.Our PIE construction is the first to achieve experimentally validated near-optimal performance-within a factor of 4 of optimal by one metric. It also allows decoding orders of magnitude faster than encoding, unlike other comparable constructions. We achieve this high security and performance using a graph construction called a Dagwood Sandwich Graph (DSaG), built from a novel interleaving of depth-robust graphs and superconcentrators.PIEs' performance makes them appealing for DSNs, such as the proposed Filecoin system and Ethereum data sharding. Conversely, their near-optimality establishes concerning bounds on the practical financial and energy costs of DSNs allowing arbitrary data. CCS CONCEPTS• Security and privacy → Distributed systems security.

show abstract

Verifiable Delay Functions

Cited by 310 publications

References 43 publications

An authentication protocol based on chaos and zero knowledge proof

An authentication protocol based on chaos and zero knowledge proof

SoK of Used Cryptography in Blockchain

PIEs

Contact Info

Product

Resources

About