Completeness theorems for adaptively secure broadcast
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1256784 (Why is no real title available?)
- scientific article; zbMATH DE number 708802 (Why is no real title available?)
- 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 1842484 (Why is no real title available?)
- A lower bound for adaptively-secure collective coin-flipping protocols
- A lower bound for the time to assure interactive consistency
- A simpler variant of universally composable security for standard multiparty computation
- Adaptive versus non-adaptive security of multi-party protocols
- Adaptively secure MPC with sublinear communication complexity
- Adaptively secure broadcast
- Adaptively secure broadcast, revisited
- Adaptively secure coin-flipping, revisited
- Adaptively secure computation with partial erasures
- Adaptively secure multi-party computation with dishonest majority
- Algorand: a secure and efficient distributed ledger
- Analysis of the Blockchain Protocol in Asynchronous Networks
- Astrolabous: a universally composable time-lock encryption scheme
- Asynchronous Byzantine agreement with subquadratic communication
- Authenticated Algorithms for Byzantine Agreement
- Bitcoin as a transaction ledger: a composable treatment
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
- Communication Complexity of Byzantine Agreement, Revisited
- Easy impossibility proofs for distributed consensus problems
- Efficient verifiable delay functions
- Estimating gaps in martingales and applications to coin-tossing: constructions and hardness
- Expected constant round Byzantine broadcast under dishonest majority
- Fair and robust multi-party computation using a global transaction ledger
- Feasibility and infeasibility of adaptively secure fully homomorphic encryption
- Formalizing delayed adaptive corruptions and the security of flooding networks
- Foundations of Cryptography
- Fully polynomial Byzantine agreement in t + 1 rounds
- Generically speeding-up repeated squaring is equivalent to factoring: sharp thresholds for all generic-ring delay functions
- Gossiping for communication-efficient broadcast
- Homomorphic time-lock puzzles and applications
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Must the communication graph of MPC protocols be an expander?
- Non-malleable time-lock puzzles and applications
- On the security of time-lock puzzles and timed commitments
- PoW-based distributed cryptography with no trusted setup
- Probabilistic Termination and Composability of Cryptographic Protocols
- Reaching Agreement in the Presence of Faults
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era
- Round-efficient Byzantine broadcast under strongly adaptive and majority corruptions
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols
- Secure multi-party computation without agreement
- Security and composition of multiparty cryptographic protocols
- Simple verifiable delay functions
- SoK: a consensus taxonomy in the blockchain era
- Sublinear-round Byzantine agreement under corrupt majority
- Synchronous Byzantine agreement with expected \(O(1)\) rounds, expected \(O(n^2)\) communication, and optimal resilience
- Synchronous consensus with optimal asynchronous fallback guarantees
- Synchronous constructive cryptography
- TARDIS: a foundation of time-lock puzzles in UC
- The Bitcoin Backbone Protocol: Analysis and Applications
- The Byzantine Generals Problem
- The price of low communication in secure multi-party computation
- The wonderful world of global random oracles
- Theory of Cryptography
- Time-lock puzzles from randomized encodings
- Time-lock puzzles in the random oracle model
- Transparent batchable time-lock puzzles and applications to Byzantine consensus
- Two-round and non-interactive concurrent non-malleable commitments from time-lock puzzles
- Unconditional Byzantine agreement for any number of faulty processors (extended abstract)
- Universal composition with global subroutines: capturing global setup within plain UC
- Universally composable security
- Universally composable synchronous computation
- Universally composable two-party and multi-party secure computation
- Verifiable delay functions
Cited in
(4)- General adversary structures in Byzantine agreement and multi-party computation with active and omission corruption
- Communication lower bounds for cryptographic broadcast protocols
- An unstoppable ideal functionality for signatures and a modular analysis of the Dolev-Strong broadcast
- Transparent batchable time-lock puzzles and applications to Byzantine consensus
This page was built for publication: Completeness theorems for adaptively secure broadcast
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6186585)
