Probabilistic Termination and Composability of Cryptographic Protocols
From MaRDI portal
Publication:2829949
DOI10.1007/978-3-662-53015-3_9zbMath1406.94040OpenAlexW2482085991MaRDI QIDQ2829949
Ran Cohen, Juan A. Garay, Vassilis Zikas, Sandro Coretti
Publication date: 9 November 2016
Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-53015-3_9
Related Items
On the round complexity of randomized Byzantine agreement, Proof-of-reputation blockchain with Nakamoto fallback, Optimal extension protocols for Byzantine broadcast and agreement, Round-optimal Byzantine agreement, CryptHOL: game-based proofs in higher-order logic, Completeness theorems for adaptively secure broadcast, Communication complexity of Byzantine agreement, revisited, Round-preserving parallel composition of probabilistic-termination cryptographic protocols, Topology-hiding computation for networks with unknown delays, Sublinear-round Byzantine agreement under corrupt majority, Probabilistic Termination and Composability of Cryptographic Protocols, Probabilistic termination and composability of cryptographic protocols
Cites Work
- Unnamed Item
- A full proof of the BGW protocol for perfectly secure multiparty computation
- The best of both worlds: Guaranteeing termination in fast randomized Byzantine agreement protocols
- A lower bound for the time to assure interactive consistency
- Security and composition of multiparty cryptographic protocols
- Secure multi-party computation without agreement
- Probabilistic Termination and Composability of Cryptographic Protocols
- Efficient Three-Party Computation from Cut-and-Choose
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Multiparty Computation from Somewhat Homomorphic Encryption
- Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
- Information-theoretically secure protocols and security under composition
- Adaptive versus Static Security in the UC Model
- Authenticated Algorithms for Byzantine Agreement
- A Simpler Variant of Universally Composable Security for Standard Multiparty Computation
- Constant-Round MPC with Fairness and Guarantee of Output Delivery
- Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
- Early stopping in Byzantine agreement
- Adaptively Secure Broadcast
- Universally composable two-party and multi-party secure computation
- On the composition of authenticated byzantine agreement
- Founding Cryptography on Oblivious Transfer – Efficiently
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Universally Composable Synchronous Computation
- Sequential composition of protocols without simultaneous termination
- Round-Efficient Secure Computation in Point-to-Point Networks
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Theory of Cryptography
- Two Round Multiparty Computation via Multi-key FHE
- Two-Round Secure MPC from Indistinguishability Obfuscation
- On Expected Constant-Round Protocols for Byzantine Agreement
