共 50 条
- [1] A Core Calculus for Equational Proofs of Cryptographic Protocols PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2023, 7 (POPL): : 866 - 892
- [2] Ensuring the correctness of cryptographic protocols with respect to secrecy SECRYPT 2008: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON SECURITY AND CRYPTOGRAPHY, 2008, : 184 - 189
- [3] Sufficient conditions for secrecy under equational theories PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON INFORMATION SECURITY AND ASSURANCE, 2008, : 380 - 383
- [4] Secrecy by Witness-Functions under Equational Theories PROCEEDINGS OF THE 2015 7TH INTERNATIONAL CONFERENCE ON ELECTRONICS, COMPUTERS AND ARTIFICIAL INTELLIGENCE (ECAI), 2015,
- [6] Automatic Verification for Secrecy of Cryptographic Protocols in First-Order Logic INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2009, 5 (01): : 14 - 14
- [7] Automatic verification for secrecy of cryptographic protocols in first-order logic INTERNATIONAL SYMPOSIUM ON ADVANCES IN COMPUTER AND SENSOR NETWORKS AND SYSTEMS, PROCEEDINGS: IN CELEBRATION OF 60TH BIRTHDAY OF PROF. S. SITHARAMA IYENGAR FOR HIS CONTRIBUTIONS TO THE SCIENCE OF COMPUTING, 2008, : 75 - 80
- [9] Accelerating Cryptographic Protocols: A Review of Theory and Technologies PROCEEDINGS OF THE FOURTH INTERNATIONAL CONFERENCE ON COMMUNICATION THEORY, RELIABILITY, AND QUALITY OF SERVICE (CTRQ 2011), 2011, : 103 - 109
- [10] Deciding knowledge in security protocols under equational theories AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2004, 3142 : 46 - 58