TARDIS: a foundation of time-lock puzzles in UC
From MaRDI portal
Publication:2056801
DOI10.1007/978-3-030-77883-5_15zbMath1479.94124OpenAlexW3168667840MaRDI QIDQ2056801
Sabine Oechsner, Bernardo David, Carsten Baum, Jesper Buus Nielsen, Rafael Dowsley
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77883-5_15
Related Items (11)
Non-malleable codes for bounded parallel-time tampering ⋮ Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols ⋮ 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 ⋮ Formalizing delayed adaptive corruptions and the security of flooding networks ⋮ Astrolabous: a universally composable time-lock encryption scheme ⋮ Algebraic adversaries in the universal composability framework ⋮ Completeness theorems for adaptively secure broadcast ⋮ Universally Composable Simultaneous Broadcast against a Dishonest Majority and Applications ⋮ Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions ⋮ Non-malleable time-lock puzzles and applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The wonderful world of global random oracles
- Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
- Verifiable delay functions
- Generic-group delay functions require hidden-order groups
- Efficient constant-round MPC with identifiable abort and public verifiability
- On the security of time-lock puzzles and timed commitments
- Efficient UC commitment extension with homomorphism for free (and applications)
- Insured MPC: efficient secure computation with financial penalties
- GNUC: a new universal composability framework
- Time-Lock Puzzles from Randomized Encodings
- Secure Multi-Party Computation with Identifiable Abort
- How to Use Bitcoin to Design Fair Protocols
- Standard Security Does Not Imply Security against Selective-Opening
- Constructive Cryptography – A New Paradigm for Security Definitions and Proofs
- A New Approach to Practical Active-Secure Two-Party Computation
- Random Oracles with(out) Programmability
- Efficient Secure Multiparty Computation with Identifiable Abort
- Concurrent zero-knowledge with timing, revisited
- Non-interactive and reusable non-malleable commitment schemes
- Concurrent general composition of secure protocols in the timing model
- Universally Composable Security with Global Setup
- Zero Knowledge in the Random Oracle Model, Revisited
- Universally Composable Synchronous Computation
- Simple verifiable delay functions
- Modeling Bitcoin Contracts by Timed Automata
- Fair and Robust Multi-party Computation Using a Global Transaction Ledger
- Theory of Cryptography
- Efficient verifiable delay functions
- Low cost constant round MPC combining BMR and oblivious transfer
This page was built for publication: TARDIS: a foundation of time-lock puzzles in UC
