Time-lock puzzles from randomized encodings
DOI10.1145/2840728.2840745zbMATH Open1334.94062OpenAlexW2294814269MaRDI QIDQ2800583FDOQ2800583
Authors: Nir Bitansky, Abhishek Jain, Omer Paneth, Vinod Vaikuntanathan, Brent Waters, Shafi Goldwasser 
Publication date: 15 April 2016
Published in: Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1721.1/112999
Recommendations
Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Cryptography (94A60)
Cited In (43)
- Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
- On Removing Graded Encodings from Functional Encryption
- Security definitions on time-lock puzzles
- Non-interactive universal arguments
- Indistinguishable proofs of work or knowledge
- Astrolabous: a universally composable time-lock encryption scheme
- Time-release cryptography from minimal circuit assumptions
- (Verifiable) delay functions from Lucas sequences
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- Time-lock puzzles in the random oracle model
- How to build time-lock encryption
- Non-malleable codes for bounded parallel-time tampering
- Compactness vs collusion resistance in functional encryption
- Patchable indistinguishability obfuscation: \(i\mathcal {O}\) for evolving software
- Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
- Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
- Homomorphic time-lock puzzles and applications
- Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract)
- Completeness theorems for adaptively secure broadcast
- Continuous verifiable delay functions
- Lattice-based timed cryptography
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
- Transparent batchable time-lock puzzles and applications to Byzantine consensus
- Practical statistically-sound proofs of exponentiation in any group
- Generic-group delay functions require hidden-order groups
- Delay encryption
- Generic compiler for publicly verifiable covert multi-party computation
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
- TARDIS: a foundation of time-lock puzzles in UC
- Secure Obfuscation in a Weak Multilinear Map Model
- Proofs of Work from worst-case assumptions
- On the security of time-lock puzzles and timed commitments
- Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments
- On sequential functions and fine-grained cryptography
- Time-lock puzzles from lattices
- Quantum depth in the random oracle model
- CaSCaDE: (time-based) Cryptography from Space Communications DElay
- TIDE: a novel approach to constructing timed-release encryption
- Publicly verifiable proofs of sequential work
- Indistinguishability obfuscation: from approximate to exact
- Non-malleable time-lock puzzles and applications
- Robust transforming combiners from indistinguishability obfuscation to functional encryption
This page was built for publication: Time-lock puzzles from randomized encodings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2800583)
