[1] |
Jonathan Herzog, Christopher McLaren, and Anant Godbole.
Generalized k-matches.
Statistics and Probability Letters, 38:167-175, 1998. [ bib ] |
[2] |
F. Javier Thayer Fábrega, Jonathan Herzog, and Joshua D.
Guttman.
Strand spaces: Why is a security protocol correct?
In 1998 IEEE Symposium on Security and Privacy. IEEE
Computer Society Press, May 1998. [ bib | .html ] |
[3] |
F. Javier Thayer Fábrega, Jonathan Herzog, and Joshua D.
Guttman.
Honest ideals on strand spaces.
In Proceedings of the 11th IEEE Computer Security Foundations
Workshop. IEEE Computer Society Press, June 1998. [ bib | .html ] |
[4] |
F. Javier Thayer, Jonathan Herzog, and Joshua D. Guttman.
Strand spaces: Proving security protocols correct.
Journal of Computer Security, 7(2/3):191-230, 1999. [ bib | .html ] |
[5] |
F. Javier Thayer Fábrega, Jonathan Herzog, and Joshua D.
Guttman.
Mixed strand spaces.
In Proceedings of the 12th IEEE Computer Security Foundations
Workshop. IEEE Computer Society Press, June 1999. [ bib | .html ] |
[6] |
Jonathan Herzog.
Computational soundness for formal adversaries.
Master's thesis, Massachusetts Institute of Technology, October 2002. [ bib | .ps | .pdf ] |
[7] |
Jonathan Herzog.
The Diffie-Hellman key-agreement scheme in the strand-space model.
In 16th Computer Security Foundations Workshop, pages 234-247,
Asilomar, CA, June 2003. IEEE CS Press. [ bib | .html ] |
[8] |
Jonathan Herzog, Moses Liskov, and Silvio Micali.
Plaintext awareness via key registration.
In Dan Boneh, editor, Advances in Cryptology - CRYPTO 2003,
volume 2729 of Lecture Notes in Computer Science, pages 548-564.
Springer-Verlag, August 2003. [ bib | .ps | .ps ] |
[9] |
Jonathan Herzog.
Computational Soundness for Standard Assumptions of Formal
Cryptography.
PhD thesis, Massachusetts Institute of Technology, May 2004. [ bib | .ps | .pdf ] |
[10] |
Joshua D. Guttman, F. Javier Thayer, Jay A. Carlson, Jonathan Herzog, John D.
Ramsdell, and Brian T. Sniffen.
Trust management in strand spaces: A rely-guarantee method.
In David Schmidt, editor, Programming Languages and Systems:
13th European Symposium on Programming, number 2986 in LNCS, pages 325-339.
Springer, 2004. [ bib | .ps | .pdf ] |
[11] |
Ran Canetti and Jonathan Herzog.
Universally composable symbolic analysis of cryptographic protocols
(the case of encryption-based mutual authentication and key exchange).
Cryptology ePrint Archive, Report 2004/334, 2004. [ bib | http ] |
[12] |
Jonathan Herzog.
A computational interpretation of dolev-yao adversaries.
Theoretical Computer Science, June 2005. [ bib ] |
This file has been generated by bibtex2html 1.74