Authenticity and provability - A formal framework

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2437, Issue , 2002, Pages 227-245

  Gürgens, Sigrid ^a   Ochsenschläger, Peter ^a   Rudolph, Carsten ^a  

^a FRAUNHOFER INSTITUTE FOR SECURE INFORMATION TECHNOLOGY SIT   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; CRYPTOGRAPHY; ELECTRONIC COMMERCE; FORMAL LANGUAGES;

ASYNCHRONOUS PRODUCT AUTOMATA; CRYPTOGRAPHIC ALGORITHMS; FORMAL LANGUAGE THEORY; LEVEL OF ABSTRACTION; MODELING CRYPTOGRAPHIC PROTOCOLS; SECURE ELECTRONIC COMMERCE; SECURITY ENGINEERING; SECURITY PROPERTIES;

AUTHENTICATION;

EID: 84944042480     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45831-x_16     Document Type: Conference Paper

References (13)

1. C. Boyd. A Framework for Design of Key Establishment Protocols. Lecture Notes in Computer Science, 1172:146–157, 1996.
2. C. Boyd and W. Mao. Design and analysis of key exchange protocols via secure channel identification. In J.Pieprzyk and R. Safavi-Naini, editors, ASIACRYPT ‘94, volume 917 of Lecture Notes in Computer Science, pages 171–181. Springer, 1994.
3. E.M. Clarke, S. Jha, and W. Marrero. A machine checkable logic of knowledge for specifying security properties of electronic commerce protocols. In LICS Security Workshop, 1998.
4. S. Eilenberg. Automata, Languages andMachines. Academic Press, New York, 1974.
5. R. Grimm and P. Ochsenschläger.: Binding Cooperation, A Formal Model for Electronic Commerce. Computer Networks, 37:171–193, 2001.
6. S. Gürgens, P. Ochsenschläger, and C. Rudolph. Authenticity and Provability - a Formal Framework. GMD Report 150, GMD – Forschungszentrum Informationstechnik GmbH, 2001.
7. R. Kailar. Accountability in Electronic Commerce Protocols. IEEE Transactions on Software Engineering, 22(5):313–328, 1996.
8. U. M. Maurer and P. E. Schmid. A Calculus for Secure Channel Establishment in Open Networks. In D. Gollmann, editor, Computer Security – ESORICS 94, volume 875 of LNCS, pages 175–192. Springer, 1994.
9. P. Ochsenschläger, J. Repp, and R. Rieke. Abstraction and composition – a verification method for co-operating systems. Journal of Experimental andThe oretical Artificial Intelligence, 12:447–459, 2000.
10. P. Ochsenschläger, J. Repp, R. Rieke, and U. Nitsche. The SH-Verification Tool – Abstraction-Based Verification of Co-operating Systems. Formal Aspects of Computing, The Int. Journal of Formal Methods, 11:1–24, 1999.
11. C. Rudolph. A Model for Secure Protocols and its Application to Systematic Design of Cryptographic Protocols. PhD thesis, Queensland University of Technology, 2001.
12. S. Schneider. Security Properties and CSP. In Symposion on Security andPrivacy. IEEE, 1996.
13. P. Syverson and C. Meadows. A Logical Language for Specifying Cryptographic Protocol Requirements. In Proceedings of the 1993 IEEE Computer Society Symposium on Security and Privacy, pages 165–177. IEEE Computer Society Press, New York, 1993.