Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority

DOI10.1007/BF00196771zbMath0733.68006OpenAlexW2033766329MaRDI QIDQ809588

Donald Beaver

Publication date: 1991

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00196771

zbMATH Keywords

fault-tolerancedistributed computingprotocolszero-knowledge proof systems

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Computer system organization (68M99) Theory of computing (68Q99)

Related Items (20)

Protocols for collusion-secure asymmetric fingerprinting ⋮ The Cost of Fault Tolerance in Multi-Party Communication Complexity ⋮ Correlation and unmediated cheap talk in repeated games with imperfect monitoring ⋮ Universally composable symbolic security analysis ⋮ Adaptive security of multi-party protocols, revisited ⋮ Cryptography and cryptographic protocols ⋮ Resilient-optimal interactive consistency in constant time ⋮ Multi-party computation with conversion of secret sharing ⋮ The reactive simulatability (RSIM) framework for asynchronous systems ⋮ Quantum private comparison protocol with five-particle cluster states ⋮ Task-structured probabilistic I/O automata ⋮ Unifying simulatability definitions in cryptographic systems under different timing assumptions ⋮ Secure multi-party computation made simple ⋮ Efficient asynchronous verifiable secret sharing and multiparty computation ⋮ MPC vs. SFE : Unconditional and Computational Security ⋮ Secure computation of the median (and other elements of specified ranks) ⋮ Round Efficient Unconditionally Secure Multiparty Computation Protocol ⋮ MPC with friends and foes ⋮ Limits of the Cryptographic Realization of Dolev-Yao-Style XOR ⋮ Soundness of Formal Encryption in the Presence of Key-Cycles

Cites Work

• Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
• Receipt-free secret-ballot elections (extended abstract)
• How to share a secret
• The Knowledge Complexity of Interactive Proof Systems
• Minimum-Knowledge Interactive Proofs for Decision Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority