Security protocol design by composition
暂无分享,去创建一个
[1] William Allen Simpson,et al. PPP Challenge Handshake Authentication Protocol (CHAP) , 1996, RFC.
[2] Pekka Nikander,et al. DOS-Resistant Authentication with Client Puzzles , 2000, Security Protocols Workshop.
[3] Dawn Xiaodong Song,et al. Looking for diamonds in the desert - extending automatic protocol generation to three-party authentication and key agreement protocols , 2000, Proceedings 13th IEEE Computer Security Foundations Workshop. CSFW-13.
[4] Martín Abadi,et al. A calculus for cryptographic protocols: the spi calculus , 1997, CCS '97.
[5] Dawn Xiaodong Song,et al. A First Step Towards the Automatic Generation of Security Protocols , 2000, NDSS.
[6] John C. Mitchell,et al. A derivation system for security protocols and its logical formalization , 2003, 16th IEEE Computer Security Foundations Workshop, 2003. Proceedings..
[7] Lawrence C. Paulson,et al. Inductive analysis of the Internet protocol TLS , 1999, TSEC.
[8] John A. Clark,et al. Searching for a solution: engineering tradeoffs and the evolution of provably secure protocols , 2000, Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000.
[9] Joshua D. Guttman,et al. Authentication tests , 2000, Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000.
[10] Roger M. Needham,et al. Authentication revisited , 1987, OPSR.
[11] Leslie Lamport,et al. Time, clocks, and the ordering of events in a distributed system , 1978, CACM.
[12] Joshua D. Guttman,et al. Authentication tests and the structure of bundles , 2002, Theor. Comput. Sci..
[13] F. Javier Thayer Fábrega,et al. Strand spaces: proving security protocols correct , 1999 .
[14] Giovanni Maria Sacco,et al. Timestamps in key distribution protocols , 1981, CACM.
[15] Li Gong,et al. Lower bounds on messages and rounds for network authentication protocols , 1993, CCS '93.
[16] Markus Jakobsson,et al. A Practical Mix , 1998, EUROCRYPT.
[17] Adam Stubblefield,et al. Using Client Puzzles to Protect TLS , 2001, USENIX Security Symposium.
[18] David Chaum,et al. The dining cryptographers problem: Unconditional sender and recipient untraceability , 1988, Journal of Cryptology.
[19] Lawrence C. Paulson,et al. The Inductive Approach to Verifying Cryptographic Protocols , 2021, J. Comput. Secur..
[20] David Chaum,et al. Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.
[21] Rajeev Alur,et al. A Temporal Logic of Nested Calls and Returns , 2004, TACAS.
[22] Ross J. Anderson,et al. Robustness Principles for Public Key Protocols , 1995, CRYPTO.
[23] Colin Boyd,et al. Towards formal analysis of security protocols , 1993, [1993] Proceedings Computer Security Foundations Workshop VI.
[24] ProtocolsLi GongSRI InternationalComputer. Fail-Stop Protocols : An Approach to Designing Secure , 1994 .
[25] Joshua D. Guttman,et al. Honest ideals on strand spaces , 1998, Proceedings. 11th IEEE Computer Security Foundations Workshop (Cat. No.98TB100238).
[26] Ari Juels,et al. Client puzzles: A cryptographic defense against connection depletion , 1999 .
[27] Gavin Lowe,et al. A hierarchy of authentication specifications , 1997, Proceedings 10th Computer Security Foundations Workshop.
[28] Moti Yung,et al. Systematic Design of Two-Party Authentication Protocols , 1991, CRYPTO.
[29] Charalampos Manifavas,et al. A new family of authentication protocols , 1998, OPSR.
[30] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .
[31] Gavin Lowe,et al. An Attack on the Needham-Schroeder Public-Key Authentication Protocol , 1995, Inf. Process. Lett..
[32] Paul F. Syverson,et al. Limitations on design principles for public key protocols , 1996, Proceedings 1996 IEEE Symposium on Security and Privacy.
[33] John A. Clark,et al. A survey of authentication protocol literature: Version 1.0 , 1997 .
[34] Jean-Jacques Quisquater,et al. Authentication Procedures , 1982, EUROCRYPT.
[35] Markus Jakobsson,et al. Flash mixing , 1999, PODC '99.
[36] Dieter Gollmann. What do we mean by entity authentication? , 1996, Proceedings 1996 IEEE Symposium on Security and Privacy.
[37] Gavin Lowe,et al. Breaking and Fixing the Needham-Schroeder Public-Key Protocol Using FDR , 1996, Softw. Concepts Tools.
[38] Levente Buttyán,et al. A simple logic for authentication protocol design , 1998, Proceedings. 11th IEEE Computer Security Foundations Workshop (Cat. No.98TB100238).
[39] Li Gong,et al. Reasoning about belief in cryptographic protocols , 1990, Proceedings. 1990 IEEE Computer Society Symposium on Research in Security and Privacy.
[40] Yvo Desmedt,et al. How to Break a Practical MIX and Design a New One , 2000, EUROCRYPT.
[41] A. W. Roscoe. Intensional specifications of security protocols , 1996, Proceedings 9th IEEE Computer Security Foundations Workshop.
[42] Joshua D. Guttman,et al. Security protocol design via authentication tests , 2002, Proceedings 15th IEEE Computer Security Foundations Workshop. CSFW-15.
[43] Andreas Pfitzmann,et al. Anonymity, Unobservability, and Pseudonymity - A Proposal for Terminology , 2000, Workshop on Design Issues in Anonymity and Unobservability.
[44] Martín Abadi,et al. A logic of authentication , 1990, TOCS.
[45] Catherine A. Meadows,et al. The NRL Protocol Analyzer: An Overview , 1996, J. Log. Program..
[46] Danny Dolev,et al. On the security of public key protocols , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[47] Steve A. Schneider,et al. Using CSP for protocol analysis: the Needham-Schroeder Public-Key Protocol , 1996 .
[48] Jonathan K. Millen,et al. Protocol-independent secrecy , 2000, Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000.
[49] Roger M. Needham,et al. Using encryption for authentication in large networks of computers , 1978, CACM.
[50] Martín Abadi,et al. Prudent Engineering Practice for Cryptographic Protocols , 1994, IEEE Trans. Software Eng..
[51] Daniel R. Simon,et al. Cryptographic defense against traffic analysis , 1993, STOC.
[52] Simon S. Lam,et al. A lesson on authentication protocol design , 1994, OPSR.