Time-Lock Puzzles from Randomized Encodings
From MaRDI portal
Publication:2800583
DOI10.1145/2840728.2840745zbMath1334.94062OpenAlexW2294814269MaRDI QIDQ2800583
Nir Bitansky, Omer Paneth, Abhishek Jain, Brent Waters, Shafi Goldwasser, Vinod Vaikuntanathan
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
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Randomized algorithms (68W20)
Related Items (32)
Non-malleable codes for bounded parallel-time tampering ⋮ Security definitions on time-lock puzzles ⋮ Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ Secure Obfuscation in a Weak Multilinear Map Model ⋮ Compactness vs Collusion Resistance in Functional Encryption ⋮ Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract) ⋮ Proofs of Work from worst-case assumptions ⋮ 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 ⋮ Indistinguishable Proofs of Work or Knowledge ⋮ Practical statistically-sound proofs of exponentiation in any group ⋮ TIDE: a novel approach to constructing timed-release encryption ⋮ Memory-hard puzzles in the standard model with applications to memory-hard functions and resource-bounded locally decodable codes ⋮ Non-interactive universal arguments ⋮ Astrolabous: a universally composable time-lock encryption scheme ⋮ Time-release cryptography from minimal circuit assumptions ⋮ Completeness theorems for adaptively secure broadcast ⋮ Lattice-based timed cryptography ⋮ Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles ⋮ Robust Transforming Combiners from Indistinguishability Obfuscation to Functional Encryption ⋮ Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps ⋮ On Removing Graded Encodings from Functional Encryption ⋮ Indistinguishability Obfuscation: From Approximate to Exact ⋮ Continuous verifiable delay functions ⋮ 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 ⋮ Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions ⋮ Patchable Indistinguishability Obfuscation: $$i\mathcal {O}$$ for Evolving Software
This page was built for publication: Time-Lock Puzzles from Randomized Encodings
