Broadcast and secure computation under reduced setup assumptions

No abstract is available for this paper.

• Publication year

  2005

• Venue

  IEEE Information Theory Workshop on Theory and Practice in Information-Theoretic Security, 2005.

• Publication date

  2005-12-05

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1109/ITWTPI.2005.1543955
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Byzantine Agreement Given Partial Broadcast

  2005cited by this paper
• On Byzantine Agreement over (2, 3)-Uniform Hypergraphs

  2004cited by this paper
• Pseudo-signatures, Broadcast, and Multi-party Computation from Correlated Randomness

  2004cited by this paper
• Two-Threshold Broadcast and Detectable Multi-party Computation

  2003influential reference
• Detectable byzantine agreement secure against faulty majorities

  2002influential reference
• Secure Computation without Agreement

  2002cited by this paper
• Unconditional Byzantine Agreement and Multi-party Computation Secure against Dishonest Minorities from Scratch

  2002cited by this paper
• Quantum solution to the Byzantine agreement problem.

  2001cited by this paper
• Minimal Complete Primitives for Secure Multi-Party Computation

  2001cited by this paper
• From partial consistency to global broadcast

  2000cited by this paper
• An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement

  1997cited by this paper
• Unconditional Byzantine Agreement for any Number of Faulty Processors

  1992cited by this paper
• Multiparty Protocols Tolerating Half Faulty Processors

  1989cited by this paper
• Verifiable secret sharing and multiparty protocols with honest majority

  1989cited by this paper
• Multiparty Unconditionally Secure Protocols (Extended Abstract)

  1988cited by this paper
• Completeness theorems for non-cryptographic fault-tolerant distributed computation

  1988cited by this paper
• How to play ANY mental game

  1987influential reference
• Easy impossibility proofs for distributed consensus problems

  1985cited by this paper
• The Weak Byzantine Generals Problem

  1983cited by this paper
• Polynomial algorithms for multiple processor agreement

  1982cited by this paper
• The Byzantine Generals Problem

  1982cited by this paper
• An Efficient Algorithm for Byzantine Agreement without Authentication

  1982cited by this paper
• Protocols for secure computations

  1982cited by this paper

• No citing papers are available for this paper.