Completeness theorems for adaptively secure broadcast
From MaRDI portal
Publication:6186585
DOI10.1007/978-3-031-38557-5_1OpenAlexW4385654063MaRDI QIDQ6186585
Vassilis Zikas, Ran Cohen, Juan A. Garay
Publication date: 2 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38557-5_1
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Distributed systems (68M14)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Must the communication graph of MPC protocols be an expander?
- SoK: a consensus taxonomy in the blockchain era
- Easy impossibility proofs for distributed consensus problems
- A lower bound for the time to assure interactive consistency
- The wonderful world of global random oracles
- Verifiable delay functions
- Bitcoin as a transaction ledger: a composable treatment
- The price of low communication in secure multi-party computation
- Adaptive versus non-adaptive security of multi-party protocols
- Security and composition of multiparty cryptographic protocols
- Sublinear-round Byzantine agreement under corrupt majority
- Asynchronous Byzantine agreement with subquadratic communication
- Expected constant round Byzantine broadcast under dishonest majority
- Round-efficient Byzantine broadcast under strongly adaptive and majority corruptions
- 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
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era
- Synchronous constructive cryptography
- Universal composition with global subroutines: capturing global setup within plain UC
- On the security of time-lock puzzles and timed commitments
- Synchronous consensus with optimal asynchronous fallback guarantees
- Estimating gaps in martingales and applications to coin-tossing: constructions and hardness
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Homomorphic time-lock puzzles and applications
- Algorand: a secure and efficient distributed ledger
- Secure multi-party computation without agreement
- Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience
- Non-malleable time-lock puzzles and applications
- Adaptively Secure Computation with Partial Erasures
- Time-Lock Puzzles from Randomized Encodings
- Probabilistic Termination and Composability of Cryptographic Protocols
- Adaptively Secure Multi-Party Computation with Dishonest Majority
- Adaptively secure broadcast, revisited
- The Bitcoin Backbone Protocol: Analysis and Applications
- Authenticated Algorithms for Byzantine Agreement
- Adaptively Secure Coin-Flipping, Revisited
- A Simpler Variant of Universally Composable Security for Standard Multiparty Computation
- PoW-Based Distributed Cryptography with No Trusted Setup
- Adaptively Secure Broadcast
- Universally composable two-party and multi-party secure computation
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- Foundations of Cryptography
- Universally Composable Synchronous Computation
- Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption
- Universally Composable Security
- Simple verifiable delay functions
- A Lower Bound for Adaptively-Secure Collective Coin-Flipping Protocols
- Unconditional Byzantine agreement for any number of faulty processors
- Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols
- Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles
- Communication Complexity of Byzantine Agreement, Revisited
- Time-Lock Puzzles in the Random Oracle Model
- Fully polynomial Byzantine agreement in t + 1 rounds
- Analysis of the Blockchain Protocol in Asynchronous Networks
- Fair and Robust Multi-party Computation Using a Global Transaction Ledger
- Theory of Cryptography
- Efficient verifiable delay functions
- Adaptively secure MPC with sublinear communication complexity
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
- Transparent batchable time-lock puzzles and applications to Byzantine consensus
- Formalizing delayed adaptive corruptions and the security of flooding networks
- Gossiping for communication-efficient broadcast
- Astrolabous: a universally composable time-lock encryption scheme
