TARDIS: a foundation of time-lock puzzles in UC
From MaRDI portal
Publication:2056801
DOI10.1007/978-3-030-77883-5_15zbMATH Open1479.94124OpenAlexW3168667840MaRDI QIDQ2056801FDOQ2056801
Authors: Carsten Baum, Bernardo David, Rafael Dowsley, Jesper Buus Nielsen, Sabine Oechsner 
Publication date: 8 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-77883-5_15
Recommendations
Cites Work
- GNUC: a new universal composability framework
- A new approach to practical active-secure two-party computation
- Title not available (Why is that?)
- Theory of Cryptography
- Title not available (Why is that?)
- Title not available (Why is that?)
- Concurrent general composition of secure protocols in the timing model
- Universally Composable Security with Global Setup
- Random oracles with(out) programmability
- Standard security does not imply security against selective-opening
- Low cost constant round MPC combining BMR and oblivious transfer
- Time-lock puzzles from randomized encodings
- Concurrent zero-knowledge with timing, revisited
- Non-interactive and reusable non-malleable commitment schemes
- Zero knowledge in the random oracle model, revisited
- How to use bitcoin to design fair protocols
- Verifiable delay functions
- Simple verifiable delay functions
- Efficient verifiable delay functions
- Universally composable synchronous computation
- Modeling Bitcoin contracts by timed automata
- Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
- Constructive cryptography -- a new paradigm for security definitions and proofs
- The wonderful world of global random oracles
- Fair and robust multi-party computation using a global transaction ledger
- Secure multi-party computation with identifiable abort
- 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
- Efficient secure multiparty computation with identifiable abort
Cited In (15)
- Astrolabous: a universally composable time-lock encryption scheme
- Simplex consensus: a simple and fast consensus protocol
- Non-malleable codes for bounded parallel-time tampering
- Algebraic adversaries in the universal composability framework
- Completeness theorems for adaptively secure broadcast
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
- Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- Universally Composable Simultaneous Broadcast against a Dishonest Majority and Applications
- Asymptotically optimal message dissemination with applications to blockchains
- Simple, fast, efficient, and tightly-secure non-malleable non-interactive timed commitments
- Formalizing delayed adaptive corruptions and the security of flooding networks
- CaSCaDE: (time-based) Cryptography from Space Communications DElay
- Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
- Non-malleable time-lock puzzles and applications
This page was built for publication: TARDIS: a foundation of time-lock puzzles in UC
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056801)
