On the security of time-lock puzzles and timed commitments
From MaRDI portal
Publication:2119088
DOI10.1007/978-3-030-64381-2_14zbMath1485.94098OpenAlexW3117640534MaRDI QIDQ2119088
Julian Loss, Jiayu Xu, Jonathan N. Katz
Publication date: 23 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-64381-2_14
Related Items (16)
Non-malleable codes for bounded parallel-time tampering ⋮ Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract) ⋮ 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 ⋮ Transparent batchable time-lock puzzles and applications to Byzantine consensus ⋮ Practical statistically-sound proofs of exponentiation in any group ⋮ On time-lock cryptographic assumptions in abelian hidden-order groups ⋮ Astrolabous: a universally composable time-lock encryption scheme ⋮ Algebraic adversaries in the universal composability framework ⋮ To label, or not to label (in generic groups) ⋮ An analysis of the algebraic group model ⋮ Completeness theorems for adaptively secure broadcast ⋮ Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions ⋮ Non-malleable time-lock puzzles and applications ⋮ TARDIS: a foundation of time-lock puzzles in UC ⋮ Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
This page was built for publication: On the security of time-lock puzzles and timed commitments
