Logical Analysis and Verification of Cryptographic Protocols - Loria
Logical Analysis and Verification of Cryptographic Protocols - Loria
Logical Analysis and Verification of Cryptographic Protocols - Loria
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
210 BIBLIOGRAPHY<br />
[108] B. Donovan, P. Norris, <strong>and</strong> G. Lowe. Analyzing a library <strong>of</strong> security protocols<br />
using casper <strong>and</strong> fdr. Workshop on Formal Methods <strong>and</strong> Security <strong>Protocols</strong>,<br />
Trento, Italy, 1999.<br />
[109] L. Durante, R. Sisto, <strong>and</strong> A. Valenzano. Automatic testing equivalence<br />
verification <strong>of</strong> spi calculus specifications. ACM Trans. S<strong>of</strong>tw. Eng.<br />
Methodol., 12(2):222–284, 2003.<br />
[110] N. A. Durgin, P. D. Lincoln, J. C. Mitchell, <strong>and</strong> A. Scedrov. Undecidability<br />
<strong>of</strong> bounded security protocols. In In Workshop on Formal Methods <strong>and</strong><br />
Security <strong>Protocols</strong>, Trento, Italia, 1999.<br />
[111] S. Even <strong>and</strong> O. Goldreich. On the security <strong>of</strong> multi-party ping-pong protocols.<br />
In FOCS, pages 34–39. IEEE, 1983.<br />
[112] S. Even, O. Goldreich, <strong>and</strong> A. Shamir. On the security <strong>of</strong> ping-pong protocols<br />
when implemented using the rsa. In Hugh C. Williams, editor,<br />
CRYPTO, volume 218 <strong>of</strong> Lecture Notes in Computer Science, pages 58–72.<br />
Springer, 1985.<br />
[113] M. Fay. First-order unification in an equational theory, in proc. 4th workshop<br />
on automated deduction. pages 161–167, Austin, Texas, 1979.<br />
[114] C. Fournet <strong>and</strong> M. Abadi. Hiding names: Private authentication in the<br />
applied pi calculus. In M. Okada, B. C. Pierce, A. Scedrov, H. Tokuda,<br />
<strong>and</strong> A. Yonezawa, editors, ISSS, volume 2609 <strong>of</strong> Lecture Notes in Computer<br />
Science, pages 317–338. Springer, 2002.<br />
[115] A. Fujioka, T. Okamoto, <strong>and</strong> K. Ohta. A Practical Secret Voting Scheme<br />
for Large Scale Elections. In AUSCRYPT’92: Proceedings <strong>of</strong> the Workshop on<br />
the Theory <strong>and</strong> Application <strong>of</strong> <strong>Cryptographic</strong> Techniques, volume 718 <strong>of</strong> LNCS,<br />
pages 244–251. Springer, 1993.<br />
[116] T. El Gamal. A public key cryptosystem <strong>and</strong> a signature scheme based<br />
on discrete logarithms. IEEE Transactions on Information Theory, 31(4):469–<br />
472, 1985.<br />
[117] S. Goldwasser, S. Micali, <strong>and</strong> R. L. Rivest. A digital signature scheme<br />
secure against adaptive chosen-message attacks. SIAM J. Comput.,<br />
17(2):281–308, 1988.<br />
[118] J. Goubault-Larrecq. A method for automatic cryptographic protocol verification.<br />
In J. D. P. Rolim, editor, IPDPS Workshops, volume 1800 <strong>of</strong> Lecture<br />
Notes in Computer Science, pages 977–984. Springer, 2000.