Non-malleable time-lock puzzles and applications
From MaRDI portal
Publication:2697901
DOI10.1007/978-3-030-90456-2_15OpenAlexW3213225843MaRDI QIDQ2697901
Cody Freitag, Ilan Komargodski, Naomi Sirkin, Rafael Pass
Publication date: 13 April 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-90456-2_15
Related Items (4)
CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime ⋮ Practical statistically-sound proofs of exponentiation in any group ⋮ TIDE: a novel approach to constructing timed-release encryption ⋮ Completeness theorems for adaptively secure broadcast
Cites Work
- Cryptography in the multi-string model
- Random oracles and non-uniformity
- Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
- Verifiable delay functions
- Four-round concurrent non-malleable commitments from one-way functions
- Round optimal concurrent non-malleability from polynomial hardness
- The algebraic group model and its applications
- Secure integration of asymmetric and symmetric encryption schemes
- 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
- Non-malleable codes for bounded parallel-time tampering
- Homomorphic time-lock puzzles and applications
- Non-interactive non-malleability from quantum supremacy
- Concurrent Non-Malleable Commitments (and More) in 3 Rounds
- Generating safe primes
- Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge
- Concurrent Nonmalleable Commitments
- Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions
- New and improved constructions of non-malleable cryptographic protocols
- Concurrent Non-Malleable Zero Knowledge Proofs
- Adaptive One-Way Functions and Applications
- Random Oracles and Auxiliary Input
- Simple verifiable delay functions
- Non-malleability amplification
- Textbook non-malleable commitments
- Constant round non-malleable protocols using one way functions
- Constant-round non-malleable commitments from any one-way function
- Concurrent Non-malleable Commitments from Any One-Way Function
- Efficient verifiable delay functions
This page was built for publication: Non-malleable time-lock puzzles and applications
