Verifiable delay functions
From MaRDI portal
Publication:1673422
DOI10.1007/978-3-319-96884-1_25zbMath1444.94046OpenAlexW2884026699MaRDI QIDQ1673422
Ben Fisch, Benedikt Bünz, Joseph Bonneau, Dan Boneh
Publication date: 12 September 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-96884-1_25
Related Items
Game-theoretic fairness meets multi-party protocols: the case of leader election, Time- and space-efficient arguments from groups of unknown order, LOVE a pairing, SoK: communication across distributed ledgers, PoSAT: proof-of-work availability and unpredictability, without the work, Multi-instance publicly verifiable time-lock puzzle and its applications, A complete characterization of game-theoretically fair, multi-party coin toss, An incremental PoSW for general weight distributions, Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting), 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, Certifying giant nonprimes, Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract), Ofelimos: combinatorial optimization via proof-of-useful-work. A provably secure blockchain protocol, Practical statistically-sound proofs of exponentiation in any group, TIDE: a novel approach to constructing timed-release encryption, NIZK from SNARGs, 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, On elapsed time consensus protocols, Time-release cryptography from minimal circuit assumptions, Building blocks of sharding blockchain systems: concepts, approaches, and open problems, Nova: recursive zero-knowledge arguments from folding schemes, PPAD is as hard as LWE and iterated squaring, Towards practical homomorphic time-lock puzzles: applicability and verifiability, Applications of timed-release encryption with implicit authentication, Completeness theorems for adaptively secure broadcast, Secure multiparty computation from threshold encryption based on class groups, Lattice-based timed cryptography, Unnamed Item, ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing, On the impossibility of purely algebraic signatures, Simple and efficient batch verification techniques for verifiable delay functions, Non-malleable time-lock puzzles and applications, Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era, Efficient verifiable delay functions, 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, Abuse resistant law enforcement access systems, Simple verifiable delay functions, Incompressible encodings, Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions, Fiat-Shamir for repeated squaring with applications to PPAD-hardness and VDFs, A note on Low Order assumptions in RSA groups
