Time-Lock Puzzles in the Random Oracle Model

DOI10.1007/978-3-642-22792-9_3zbMath1287.94083OpenAlexW2141870382MaRDI QIDQ5199183

Mohammad Mahmoody, Tal Moran, Salil P. Vadhan

Publication date: 12 August 2011

Published in: Advances in Cryptology – CRYPTO 2011 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-22792-9_3

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (13)

Security definitions on time-lock puzzles ⋮ Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract) ⋮ Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles ⋮ Indistinguishable Proofs of Work or Knowledge ⋮ Practical statistically-sound proofs of exponentiation in any group ⋮ Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes ⋮ Astrolabous: a universally composable time-lock encryption scheme ⋮ Completeness theorems for adaptively secure broadcast ⋮ Turn-based communication channels ⋮ How to build time-lock encryption ⋮ Generic-group delay functions require hidden-order groups ⋮ Generic compiler for publicly verifiable covert multi-party computation ⋮ Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions

This page was built for publication: Time-Lock Puzzles in the Random Oracle Model