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

DOI10.1007/BF00196771zbMATH Open0733.68006OpenAlexW2033766329MaRDI QIDQ809588FDOQ809588

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

Recommendations

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

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)

Cites Work

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

Cited In (27)

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

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)