Logical Analysis and Verification of Cryptographic Protocols - Loria
Logical Analysis and Verification of Cryptographic Protocols - Loria
Logical Analysis and Verification of Cryptographic Protocols - Loria
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
BIBLIOGRAPHY 211<br />
[119] S. Hirose <strong>and</strong> S. Yoshida. An authenticated diffie-hellman key agreement<br />
protocol secure against active attacks. In H. Imai <strong>and</strong> Y. Zheng, editors,<br />
Public Key Cryptography, volume 1431 <strong>of</strong> Lecture Notes in Computer Science,<br />
pages 135–148. Springer, 1998.<br />
[120] J. Hsiang <strong>and</strong> M. Rusinowitch. On word problems in equational theories.<br />
In T. Ottmann editor, ICALP, volume 267 <strong>of</strong> Lecture Notes in Computer Science,<br />
pages 54–71, Springer, 1987.<br />
[121] G. P. Huet. A complete pro<strong>of</strong> <strong>of</strong> correctness <strong>of</strong> the knuth-bendix completion<br />
algorithm. J. Comput. Syst. Sci., 23(1):11–21, 1981.<br />
[122] A. Huima. Efficient infinite-state analysis <strong>of</strong> security protocols. In In Proc.<br />
FLOC’99 Workshop on Formal Methods <strong>and</strong> Security <strong>Protocols</strong>, Trento,<br />
Italy, 1999.<br />
[123] J.M. Hullot. Canonical forms <strong>and</strong> unification. In W. Bibel <strong>and</strong> R. A. Kowalski,<br />
editors, CADE, volume 87 <strong>of</strong> Lecture Notes in Computer Science, pages<br />
318–334. Springer, 1980.<br />
[124] J.M. Hullot. A catalogue <strong>of</strong> canonical term rewriting systems. Technical<br />
Report CSL-114, Computer Science Laboratory, SRI, CA, USA, 1980.<br />
[125] A. Evans Jr., W. Kantrowitz, <strong>and</strong> E. Weiss. A user authentication scheme<br />
not requiring secrecy in the computer. Commun. ACM, 17(8):437–442,<br />
1974.<br />
[126] A. Juels, D. Catalano, <strong>and</strong> M. Jacobsson. Coercion-resistant electronic elections.<br />
Cryptology ePrint Archive, Report 2002/165, 2002.<br />
[127] A. Juels, D. Catalano, <strong>and</strong> M. Jacobsson. Coercion-resistant electronic elections.<br />
In WPES’05: Proceedings <strong>of</strong> the 2005 ACM workshop on Privacy in the<br />
electronic society, pages 61-70, New York, NY, USA, ACM, 2005.<br />
[128] D. Kähler, R. Küsters, <strong>and</strong> T. Wilke. Deciding properties <strong>of</strong> contractsigning<br />
protocols. In V. Diekert <strong>and</strong> B. Dur<strong>and</strong>, editors, STACS, volume<br />
3404 <strong>of</strong> Lecture Notes in Computer Science, pages 158–169. Springer, 2005.<br />
[129] V. Klìma. Finding md5 collisions on a notebook pc using multi-message<br />
modifications. Cryptology ePrint Archive, Report 2005/102, 2005. http:<br />
//eprint.iacr.org/.<br />
[130] V. Klìma. Finding md5 collisions a toy for a notebook. Cryptology ePrint<br />
Archive, Report 2005/075, 2005. http://eprint.iacr.org/.<br />
[131] D.E. Knuth <strong>and</strong> P.B. Bendix. Simple word problems in universal algebra.<br />
Computational Algebra, J. Leach, Pergamon Press, pages 263–297, 1970.