enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Byzantine fault - Wikipedia

    en.wikipedia.org/wiki/Byzantine_fault

    Byzantine Fault Tolerance (BFT) is a crucial concept in blockchain technology, ensuring that a network can continue to function even when some nodes [33] (participants) fail or act maliciously. This tolerance is necessary because blockchains are decentralized systems with no central authority, making it essential to achieve consensus among ...

  3. Quantum Byzantine agreement - Wikipedia

    en.wikipedia.org/wiki/Quantum_Byzantine_agreement

    The Byzantine Agreement protocol is a protocol in distributed computing.It takes its name from a problem formulated by Lamport, Shostak and Pease in 1982, [2] which itself is a reference to a historical problem.

  4. Leslie Lamport - Wikipedia

    en.wikipedia.org/wiki/Leslie_Lamport

    Leslie B. Lamport (born February 7, 1941) is an American computer scientist and mathematician.Lamport is best known for his seminal work in distributed systems, and as the initial developer of the document preparation system LaTeX and the author of its first manual.

  5. Robert Shostak - Wikipedia

    en.wikipedia.org/wiki/Robert_Shostak

    Robert Eliot Shostak (born July 26, 1948, in Arlington, Virginia) is an American computer scientist and Silicon Valley entrepreneur. He is most noted academically for his seminal work in the branch of distributed computing known as Byzantine Fault Tolerance .

  6. Paxos (computer science) - Wikipedia

    en.wikipedia.org/wiki/Paxos_(computer_science)

    Consensus protocols are the basis for the state machine replication approach to distributed computing, as suggested by Leslie Lamport [2] and surveyed by Fred Schneider. [3] State machine replication is a technique for converting an algorithm into a fault-tolerant, distributed implementation.

  7. Consensus (computer science) - Wikipedia

    en.wikipedia.org/wiki/Consensus_(computer_science)

    An example of a polynomial time binary consensus protocol that tolerates Byzantine failures is the Phase King algorithm by Garay and Berman. [14] The algorithm solves consensus in a synchronous message passing model with n processes and up to f failures, provided n > 4f. In the phase king algorithm, there are f + 1 phases, with 2 rounds per ...

  8. Merkle signature scheme - Wikipedia

    en.wikipedia.org/wiki/Merkle_signature_scheme

    In hash-based cryptography, the Merkle signature scheme is a digital signature scheme based on Merkle trees (also called hash trees) and one-time signatures such as the Lamport signature scheme. It was developed by Ralph Merkle in the late 1970s [1] and is an alternative to traditional digital signatures such as the Digital Signature Algorithm ...

  9. Chandy–Lamport algorithm - Wikipedia

    en.wikipedia.org/wiki/Chandy–Lamport_algorithm

    The Chandy–Lamport algorithm is a snapshot algorithm that is used in distributed systems for recording a consistent global state of an asynchronous system. It was developed by and named after Leslie Lamport and K. Mani Chandy .