2001 · 60 citations · 14 references
ComputingComputer ScienceAuthenticationFormal MethodsGame TheoryAuthentication ProtocolsCryptographic ProtocolsDeductive VerificationProtocol AnalysisProtocol VerificationSecurity Protocol VerificationAuthentication Protocol AnalysisContract Signing ProtocolsFormal Methods For Security ProtocolsFormal Security AnalysisFormal Verification Of Authentication ProtocolsFormal Verification Of Cryptographic ProtocolsInductive Proof TechniquesProtocol Formal Verification
Garay, Jakobsson and MacKenzie introduced the notion of abuse-free distributed contract-signing: at any stage of the protocol, no participant Ahas the ability to prove to an outside party, that A has the power to choose between completing the contract and aborting it. We study a version of this property, which is naturally formulated in terms of game strategies, and which we formally state and prove for a two-party, optimistic contract-signing protocol. We extend to this setting the formal inductive proof methods previously used in the formal analysis of simpler, trace-based properties of authentication protocols.
14
Jean-Yves Girard · Theoretical Computer Science · 1987 · 4.1K citations
On the security of public key protocols
Danny Dolev, A. Yao · 1981 · 472 citations
Asynchronous protocols for optimistic fair exchange
N. Asokan, Victor Shoup, Michael Waidner · 2002 · 315 citations