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

DOI10.1007/BF00196771MaRDI QIDQ809588zbMATHOpenAlexFDO

Authors 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

distributed computingfault-toleranceprotocolszero-knowledge proof systems

Mathematics Subject Classification ID

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

Recommendations

• Zero-knowledge proofs from secure multiparty computation
• Verifiable computation in multiparty protocols with honest majority
• scientific article; zbMATH DE number 5485433
• scientific article; zbMATH DE number 3856986
• Detectable Byzantine agreement secure against faulty majorities
• scientific article; zbMATH DE number 2086726
• scientific article; zbMATH DE number 1950673

Cites work

• scientific article; zbMATH DE number 4191075 (Why is no real title available?)
• scientific article; zbMATH DE number 4195141 (Why is no real title available?)
• scientific article; zbMATH DE number 4213418 (Why is no real title available?)
• scientific article; zbMATH DE number 503243 (Why is no real title available?)
• scientific article; zbMATH DE number 503260 (Why is no real title available?)
• scientific article; zbMATH DE number 503347 (Why is no real title available?)
• Arthur-Merlin games: A randomized proof system, and a hierarchy of complexity classes
• How to share a secret
• Minimum-Knowledge Interactive Proofs for Decision Problems
• Receipt-free secret-ballot elections (extended abstract)
• The Knowledge Complexity of Interactive Proof Systems

Cited in

(27)

• MPC with friends and foes
• Limits of the cryptographic realization of Dolev-Yao-style XOR
• Unifying simulatability definitions in cryptographic systems under different timing assumptions
• The cost of fault tolerance in multi-party communication complexity
• Quantum private comparison protocol with five-particle cluster states
• Universally composable symbolic security analysis
• Secure computation of the median (and other elements of specified ranks)
• scientific article; zbMATH DE number 4195141 (Why is no real title available?)
• Resilient-optimal interactive consistency in constant time
• scientific article; zbMATH DE number 4101088 (Why is no real title available?)
• Security, veriflability, and universality in distributed computing
• Cryptography and cryptographic protocols
• Secure multi-party computation made simple
• Protocols for collusion-secure asymmetric fingerprinting (extended abstract)
• Multi-party computation with conversion of secret sharing
• Round Efficient Unconditionally Secure Multiparty Computation Protocol
• scientific article; zbMATH DE number 176562 (Why is no real title available?)
• scientific article; zbMATH DE number 4191076 (Why is no real title available?)
• Correlation and unmediated cheap talk in repeated games with imperfect monitoring
• MPC vs. SFE : Unconditional and Computational Security
• Soundness of Formal Encryption in the Presence of Key-Cycles
• The reactive simulatability (RSIM) framework for asynchronous systems
• Efficient asynchronous verifiable secret sharing and multiparty computation
• Realizable Rational Multiparty Cryptographic Protocols
• scientific article; zbMATH DE number 1534512 (Why is no real title available?)
• Task-structured probabilistic I/O automata
• Adaptive security of multi-party protocols, revisited

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q809588)