Efficient verifiable delay functions
From MaRDI portal
Publication:5919373
DOI10.1007/978-3-030-17659-4_13OpenAlexW2885172320MaRDI QIDQ5919373
Publication date: 4 February 2020
Published in: Advances in Cryptology – EUROCRYPT 2019 (Search for Journal in Brave)
Full work available at URL: https://ir.cwi.nl/pub/28683
Related Items (39)
Non-malleable codes for bounded parallel-time tampering ⋮ Time- and space-efficient arguments from groups of unknown order ⋮ Multi-instance publicly verifiable time-lock puzzle and its applications ⋮ An incremental PoSW for general weight distributions ⋮ CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime ⋮ Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments ⋮ \textsf{Dew}: a transparent constant-sized polynomial commitment scheme ⋮ Parallelizable delegation from LWE ⋮ Inner product functional commitments with constant-size public parameters and openings ⋮ SNACKs: leveraging proofs of sequential work for blockchain light clients ⋮ Short-lived zero-knowledge proofs and signatures ⋮ On time-lock cryptographic assumptions in abelian hidden-order groups ⋮ Astrolabous: a universally composable time-lock encryption scheme ⋮ Snarky ceremonies ⋮ Time-release cryptography from minimal circuit assumptions ⋮ Nova: recursive zero-knowledge arguments from folding schemes ⋮ Towards practical homomorphic time-lock puzzles: applicability and verifiability ⋮ The special case of cyclotomic fields in quantum algorithms for unit groups ⋮ Applications of timed-release encryption with implicit authentication ⋮ Completeness theorems for adaptively secure broadcast ⋮ Secure multiparty computation from threshold encryption based on class groups ⋮ On the impossibility of purely algebraic signatures ⋮ Simple and efficient batch verification techniques for verifiable delay functions ⋮ Non-malleable time-lock puzzles and applications ⋮ Minting mechanism for proof of stake blockchains ⋮ Multiparty generation of an RSA modulus ⋮ Transparent SNARKs from DARK compilers ⋮ SPARKs: succinct parallelizable arguments of knowledge ⋮ Continuous verifiable delay functions ⋮ Generic-group delay functions require hidden-order groups ⋮ Bandwidth-efficient threshold EC-DSA ⋮ Delay encryption ⋮ Generic compiler for publicly verifiable covert multi-party computation ⋮ TARDIS: a foundation of time-lock puzzles in UC ⋮ Multiparty generation of an RSA modulus ⋮ Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions ⋮ Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics ⋮ Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs ⋮ A note on Low Order assumptions in RSA groups
This page was built for publication: Efficient verifiable delay functions
