Inductive methods and contract-signing protocols

Proceedings of the ACM Conference on Computer and Communications Security

Volumn , Issue , 2001, Pages 176-185

  Chadha, R ^a   Kanovich, M ^a   Scedrov, A ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; CONTRACTS; ELECTRONIC COMMERCE; ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; SECURITY OF DATA;

CONTRACT-SIGNING PROTOCOLS;

NETWORK PROTOCOLS;

EID: 0035751922     PISSN: 15437221     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/501983.502008     Document Type: Conference Paper

References (21)

1. Asynchronous protocols for optimistic fair exchange
2. Typed MSR: Syntax and examples
3. A meta-notation for protocol analysis
4. Proving secrecy is easy enough
5. Successive approximation of abstract transition relations
6. On the security of public-key protocols
7. Protocol for signing contracts
8. Impossibility of distributed consensus with one faulty process
9. Abuse-free optimistic contract signing
10. Linear logic
11. Linear logic as a logic of computations
12. The direct simulation of Minsky machines in linear logic
13. Formal verification of non-repudiation protocols - A game approach
14. Analysis of abuse-free contract signing
15. Using encryption for authentication in large networks of computers
16. Proving properties of security protocols by induction
17. Analysis of a fair exchange protocol
18. Dolev-yao is no better than machiavelli
19. Finite-state analysis of two contract signing protocols
20. A semantic model for authentication protocols