Time-lock puzzles in the random oracle model

DOI10.1007/978-3-642-22792-9_3MaRDI QIDQ5199183zbMATH OpenOpenAlexFDO

Authors Mohammad Mahmoody, Tal Moran, Salil 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

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

Recommendations

• Time-lock puzzles from randomized encodings
• Homomorphic time-lock puzzles and applications
• On the security of time-lock puzzles and timed commitments
• Non-malleable time-lock puzzles and applications
• Publicly verifiable proofs of sequential work

Cited in

(34)

• How to build time-lock encryption
• Generic-group delay functions require hidden-order groups
• Generic compiler for publicly verifiable covert multi-party computation
• 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
• On the security of time-lock puzzles and timed commitments
• Multi-instance publicly verifiable time-lock puzzle and its applications
• Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract)
• Homomorphic time-lock puzzles and applications
• Merkle's key agreement protocol is optimal: an \(O(n^2)\) attack on any key agreement from random oracles
• Non-malleable time-lock puzzles and applications
• Turn-based communication channels
• Time-lock puzzles from randomized encodings
• Effort-release public-key encryption from cryptographic puzzles
• Indistinguishable proofs of work or knowledge
• Publicly verifiable proofs of sequential work
• Towards a security model for computational puzzle schemes
• Information transfer through time-lock puzzles by creating a selfunpacked ``dropper- file
• 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
• Towards practical homomorphic time-lock puzzles: applicability and verifiability
• Completeness theorems for adaptively secure broadcast
• Communication lower bounds of key-agreement protocols via density increment arguments
• On the (im)possibility of time-lock puzzles in the quantum random oracle model
• Time-lock puzzles with efficient batch solving
• Time-lock puzzles from lattices
• Can verifiable delay functions be based on random oracles?
• Breaking verifiable delay functions in the random oracle model
• How to construct public timeline for RSA-formed time-lock cryptography
• Watermarkable and zero-knowledge verifiable delay functions from any proof of exponentiation
• Black-box uselessness: composing separations in cryptography
• Separating verifiable delay functions and time-lock puzzles
• Security definitions on time-lock puzzles

This page was built for publication: Time-lock puzzles in the random oracle model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199183)