^Abadi, Martín; Blanchet, Bruno (2005). “Computer-assisted verification of a protocol for certified email”. Science of Computer Programming58 (1–2): 3–27. doi:10.1016/j.scico.2005.02.002.
^Abadi, Martín; Glew, Neal (2002). Certified Email with a Light On-line Trusted Third Party: Design and Implementation. WWW '02. New York, NY, USA: ACM. 387–395. doi:10.1145/511446.511497. ISBN978-1581134490
^Abadi, Martín; Blanchet, Bruno; Fournet, Cédric (July 2007). “Just Fast Keying in the Pi Calculus”. ACM Transactions on Information and System Security10 (3): 9–es. doi:10.1145/1266977.1266978. ISSN1094-9224.
^Aiello, William; Bellovin, Steven M.; Blaze, Matt; Canetti, Ran; Ioannidis, John; Keromytis, Angelos D.; Reingold, Omer (May 2004). “Just Fast Keying: Key Agreement in a Hostile Interne”. ACM Transactions on Information and System Security7 (2): 242–273. doi:10.1145/996943.996946. ISSN1094-9224.
^Blanchet, B.; Chaudhuri, A. (May 2008). Automated Formal Analysis of a Protocol for Secure File Sharing on Untrusted Storage. 417–431. doi:10.1109/SP.2008.12. ISBN978-0-7695-3168-7
^Bhargavan, Karthikeyan; Fournet, Cédric; Gordon, Andrew D. (2006-09-08) (英語). Verified Reference Implementations of WS-Security Protocols. Lecture Notes in Computer Science. Springer, Berlin, Heidelberg. 88–106. doi:10.1007/11841197_6. ISBN9783540388623
^Bhargavan, Karthikeyan; Fournet, Cédric; Gordon, Andrew D.; Swamy, Nikhil (2008). Verified Implementations of the Information Card Federated Identity-management Protocol. ASIACCS '08. New York, NY, USA: ACM. 123–135. doi:10.1145/1368310.1368330. ISBN9781595939791
^Bhargavan, Karthikeyan; Fournet, Cédric; Gordon, Andrew D.; Tse, Stephen (December 2008). “Verified Interoperable Implementations of Security Protocols”. ACM Transactions on Programming Languages and Systems31 (1): 5:1–5:61. doi:10.1145/1452044.1452049. ISSN0164-0925.
^Chen, Liqun; Ryan, Mark (2009-11-05) (英語). Attack, Solution and Verification for Shared Authorisation Data in TCG TPM. Lecture Notes in Computer Science. Springer, Berlin, Heidelberg. 201–216. doi:10.1007/978-3-642-12459-4_15. ISBN9783642124587
^Delaune, Stéphanie; Kremer, Steve; Ryan, Mark (2009-01-01). “Verifying privacy-type properties of electronic voting protocols” (英語). Journal of Computer Security17 (4): 435–487. doi:10.3233/jcs-2009-0340. ISSN0926-227X.
^Kremer, Steve; Ryan, Mark (2005-04-04) (英語). Analysis of an Electronic Voting Protocol in the Applied Pi Calculus. Lecture Notes in Computer Science. Springer, Berlin, Heidelberg. 186–200. doi:10.1007/978-3-540-31987-0_14. ISBN9783540254355
^Backes, M.; Hritcu, C.; Maffei, M. (June 2008). Automated Verification of Remote Electronic Voting Protocols in the Applied Pi-Calculus. 195–209. doi:10.1109/CSF.2008.26. ISBN978-0-7695-3182-3
^Delaune, Stéphanie; Ryan, Mark; Smyth, Ben (2008-06-18) (英語). Automatic Verification of Privacy Properties in the Applied pi Calculus. IFIP – The International Federation for Information Processing. Springer, Boston, MA. 263–278. doi:10.1007/978-0-387-09428-1_17. ISBN9780387094274
^Backes, M.; Maffei, M.; Unruh, D. (May 2008). Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol. 202–215. doi:10.1109/SP.2008.23. ISBN978-0-7695-3168-7
^Küsters, Ralf; Truderung, Tomasz (2011-04-01). “Reducing Protocol Analysis with XOR to the XOR-Free Case in the Horn Theory Based Approach” (英語). Journal of Automated Reasoning46 (3–4): 325–352. arXiv:0808.0634. doi:10.1007/s10817-010-9188-8. ISSN0168-7433.
^Kremer, Steve; Ryan, Mark; Smyth, Ben (2010-09-20) (英語). Election Verifiability in Electronic Voting Protocols. Lecture Notes in Computer Science. Springer, Berlin, Heidelberg. 389–404. doi:10.1007/978-3-642-15497-3_24. ISBN9783642154966