A Simple Protocol Whose Proof Isn't

DOI10.1109/TCOM.1985.1096306MaRDI QIDQ3688294zbMATH OpenFDO

Authors Brent T. Hailpern

Publication date 1985

Published in IEEE Transactions on Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TCOM.1985.1096306

zbMATH Keywords

abstract-program approacherror-prone channelfinite-state machinesreliable transmission of datasynchronous protocol

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Communication theory (94A05)

Recommendations

• A simple Byzantine generals protocol
• On "A Simple Protocol Whose Proof Isńt": The State Machine Approach
• The simplest protocol for oblivious transfer
• A proof of protocol correctness
• A simple proof of a simple consensus algorithm
• scientific article; zbMATH DE number 1863379
• A simple deniable authentication protocol based on the Diffie–Hellman algorithm
• A security proof for key exchange protocols
• ``The simplest protocol for oblivious transfer revisited

Cited in

(17)

• Self-stabilization over unreliable communication media
• The Austin Protocol Compiler.
• Non-deterministic transducer models of retransmission protocols over noisy channels
• Passing corrupt data across network layers: an overview of recent developments and issues
• Using automated theorem provers in verification of protocols
• Modeling robust asynchronous communication protocols with finite-state machines
• scientific article; zbMATH DE number 3881867 (Why is no real title available?)
• Verification of a multidestination selective repeat procedure
• Protocol Verification via Projections
• On "A Simple Protocol Whose Proof Isńt": The State Machine Approach
• scientific article; zbMATH DE number 3967907 (Why is no real title available?)
• scientific article; zbMATH DE number 4055007 (Why is no real title available?)
• scientific article; zbMATH DE number 4058839 (Why is no real title available?)
• A little knowledge goes a long way
• Algebraic Specification of Communication Protocols
• A validation algorithm of the transmitter`s boundedly deterministic behaviour in a partial erasure channel
• Specification and analysis of a data transfer protocol using systems of communicating machines

This page was built for publication: A Simple Protocol Whose Proof Isn't

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