Continuous verifiable delay functions
type: Item
instance of: scholarly article
title: Continuous verifiable delay functions
zbMATH Open document ID: 1479.94164
DOI: 10.1007/978-3-030-45727-3_5
author: Naomi Ephraim
author: Cody Freitag
author: Ilan Komargodski
author: Rafael Pass
publication date: 2021-12-01T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7436943
zbMATH Keywords: randomness beacon
zbMATH Keywords: public randomness beacon
MaRDI profile type: Publication
full work available at URL: 978-3-030-45727-3 5
OpenAlex ID: W2953744829
cites work: Time/Space Trade-Offs for Reversible Computation
cites work: Time-lock puzzles from randomized encodings
cites work: Verifiable delay functions
cites work: Q4536805
cites work: Settling the complexity of computing two-player Nash equilibria
cites work: Finding a Nash equilibrium is no easier than breaking Fiat-Shamir
cites work: Simple proofs of sequential work
cites work: The Complexity of Computing a Nash Equilibrium
cites work: Incremental proofs of sequential work
cites work: Q4318690
cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems
cites work: Revisiting the Cryptographic Hardness of Finding a Nash Equilibrium
cites work: Q4038698
cites work: Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds
cites work: Obfustopia built on secret-key functional encryption
cites work: From Minicrypt to Obfustopia via Private-Key Functional Encryption
cites work: Trustworthy public randomness with sloth, unicorn, and trx
cites work: Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles
cites work: Algebraic methods for interactive proof systems
cites work: Publicly verifiable proofs of sequential work
cites work: On total functions, existence theorems and computational complexity
cites work: On the complexity of the parity argument and other inefficient proofs of existence
cites work: Simple verifiable delay functions
cites work: Transaction protection by beacons
cites work: Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
cites work: Efficient verifiable delay functions
cites work: The Magic of ELFs
description: scientific article; zbMATH DE number 7436943