CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
From MaRDI portal
Publication:6070771
DOI10.1007/978-3-031-31368-4_16zbMath1527.94019OpenAlexW3210159314MaRDI QIDQ6070771
Jesper Buus Nielsen, Sabine Oechsner, Ravi Kishore, Rafael Dowsley, Bernardo David, Carsten Baum
Publication date: 24 November 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-31368-4_16
Related Items (1)
Cites Work
- Unnamed Item
- Partial fairness in secure two-party computation
- Ouroboros Praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain
- Verifiable delay functions
- Bitcoin as a transaction ledger: a composable treatment
- Ouroboros: a provably secure proof-of-stake blockchain protocol
- Continuous verifiable delay functions
- TARDIS: a foundation of time-lock puzzles in UC
- Efficient constant-round MPC with identifiable abort and public verifiability
- On the security of time-lock puzzles and timed commitments
- Verifiable delay functions from supersingular isogenies and pairings
- Insured MPC: efficient secure computation with financial penalties
- ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing
- Non-malleable time-lock puzzles and applications
- Time-Lock Puzzles from Randomized Encodings
- Secure Multi-Party Computation with Identifiable Abort
- How to Use Bitcoin to Design Fair Protocols
- Information-theoretically secure protocols and security under composition
- Semi-homomorphic Encryption and Multiparty Computation
- Efficient Secure Multiparty Computation with Identifiable Abort
- Early stopping in Byzantine agreement
- Universally Composable Security with Global Setup
- The Distributed Firing Squad Problem
- Universally Composable Synchronous Computation
- Simple verifiable delay functions
- Sequential composition of protocols without simultaneous termination
- 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: CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
