TARDIS: a foundation of time-lock puzzles in UC
From MaRDI portal
Publication:2056801
Recommendations
Cites work
- A new approach to practical active-secure two-party computation
- Concurrent general composition of secure protocols in the timing model
- Concurrent zero-knowledge with timing, revisited
- Constructive cryptography -- a new paradigm for security definitions and proofs
- Efficient constant-round MPC with identifiable abort and public verifiability
- Efficient secure multiparty computation with identifiable abort
- Efficient UC commitment extension with homomorphism for free (and applications)
- Efficient verifiable delay functions
- Fair and robust multi-party computation using a global transaction ledger
- Generic-group delay functions require hidden-order groups
- GNUC: a new universal composability framework
- How to use bitcoin to design fair protocols
- scientific article; zbMATH DE number 1942416 (Why is no real title available?)
- scientific article; zbMATH DE number 1759782 (Why is no real title available?)
- scientific article; zbMATH DE number 1775426 (Why is no real title available?)
- Insured MPC: efficient secure computation with financial penalties
- Low cost constant round MPC combining BMR and oblivious transfer
- Modeling Bitcoin contracts by timed automata
- Non-interactive and reusable non-malleable commitment schemes
- On the security of time-lock puzzles and timed commitments
- Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
- Random oracles with(out) programmability
- Secure multi-party computation with identifiable abort
- Simple verifiable delay functions
- Standard security does not imply security against selective-opening
- The wonderful world of global random oracles
- Theory of Cryptography
- Time-lock puzzles from randomized encodings
- Universally Composable Security with Global Setup
- Universally composable synchronous computation
- Verifiable delay functions
- Zero knowledge in the random oracle model, revisited
Cited in
(22)- Non-malleable codes for bounded parallel-time tampering
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
- Non-malleable time-lock puzzles and applications
- 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
- Partially-Fair Computation from Timed-Release Encryption and Oblivious Transfer
- Simplex consensus: a simple and fast consensus protocol
- Asymptotically optimal message dissemination with applications to blockchains
- CaSCaDE: (time-based) Cryptography from Space Communications DElay
- Peeking into the future: MPC resilient to super-rushing adversaries
- Proofs of sequential communication delays from physical assumptions and their applications
- Black-box timed commitments from time-lock puzzles
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- Information-theoretic network-agnostic MPC with polynomial communication
- Perfectly secure network-agnostic MPC comes for free
- Separating verifiable delay functions and time-lock puzzles
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)
