Round-preserving parallel composition of probabilistic-termination cryptographic protocols
From MaRDI portal
Publication:2035999
DOI10.1007/s00145-021-09377-0OpenAlexW3133957339WikidataQ114850023 ScholiaQ114850023MaRDI QIDQ2035999
Vassilis Zikas, Sandro Coretti, Juan A. Garay, Ran Cohen
Publication date: 28 June 2021
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7412/
Cryptography (94A60) Distributed systems (68M14) Authentication, digital signatures and secret sharing (94A62)
Related Items
Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party, Must the communication graph of MPC protocols be an expander?
Cites Work
- A lower bound for the time to assure interactive consistency
- Characterization of Secure Multiparty Computation Without Broadcast
- Secure Protocol Transformations
- Probabilistic Termination and Composability of Cryptographic Protocols
- Secure Multi-Party Computation with Identifiable Abort
- The Knowledge Tightness of Parallel Zero-Knowledge
- Fair Computation with Rational Players
- Unconditionally-Secure Robust Secret Sharing with Compact Shares
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Must You Know the Code of f to Securely Compute f?
- Fairness versus Guaranteed Output Delivery in Secure Multiparty Computation
- Efficient player-optimal protocols for strong and differential consensus
- Unconditionally Secure Signature Schemes Revisited
- Authenticated Algorithms for Byzantine Agreement
- Utility Dependence in Correct and Fair Rational Secret Sharing
- An Efficient Parallel Repetition Theorem
- Efficient Rational Secret Sharing in Standard Communication Networks
- Constant-Round MPC with Fairness and Guarantee of Output Delivery
- Early stopping in Byzantine agreement
- Information-Theoretically Secure Key-Insulated Multireceiver Authentication Codes
- Adaptively Secure Broadcast
- Universally composable two-party and multi-party secure computation
- Rational secret sharing and multiparty computation
- Founding Cryptography on Oblivious Transfer – Efficiently
- Fairness with an Honest Minority and a Rational Majority
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement
- Universally Composable Synchronous Computation
- Unconditional Byzantine agreement for any number of faulty processors
- Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols
- Resilient-optimal interactive consistency in constant time
- Sequential composition of protocols without simultaneous termination
- A Parallel Repetition Theorem for Any Interactive Argument
- Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds
- Advances in Cryptology - CRYPTO 2003
- Round-Efficient Secure Computation in Point-to-Point Networks
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- Two Round Multiparty Computation via Multi-key FHE
- Two-Round Secure MPC from Indistinguishability Obfuscation
- On Expected Constant-Round Protocols for Byzantine Agreement
- Adaptively secure MPC with sublinear communication complexity
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
