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.
214 BIBLIOGRAPHY<br />
[160] J. C. Mitchell, M. Mitchell, <strong>and</strong> U. Stern. Automated analysis <strong>of</strong> cryptographic<br />
protocols using mur-phi. In IEEE Symposium on Security <strong>and</strong><br />
Privacy, pages 141–151. IEEE Computer Society, 1997.<br />
[161] D. Monniaux. Abstracting cryptographic protocols with tree automata.<br />
Sci. Comput. Program., 47(2-3):177–202, 2003.<br />
[162] P. Narendran, F. Pfenning, <strong>and</strong> R. Statman. On the unification problem<br />
for cartesian closed categories. J. Symb. Log., 62(2):636–647, 1997.<br />
[163] R. M. Needham <strong>and</strong> M. D. Schroeder. Using encryption for authentication<br />
in large networks <strong>of</strong> computers. Commun. ACM, 21(12):993–999, 1978.<br />
[164] H. De Nivelle. Ordering refinements <strong>of</strong> resolution. Phd thesis, Delft University<br />
<strong>of</strong> Technology, the Netherl<strong>and</strong>s, 1995.<br />
[165] T. Okamoto. Receipt-free electronic voting schemes for large scale elections.<br />
In B. Christianson, B. Crispo, T. M. A. Lomas, <strong>and</strong> M. Roe, editors,<br />
Security <strong>Protocols</strong> Workshop, volume 1361 <strong>of</strong> Lecture Notes in Computer Science,<br />
pages 25–35. Springer, 1997.<br />
[166] Paritosh K. P<strong>and</strong>ya <strong>and</strong> Jaikumar Radhakrishnan, editors. FST TCS 2003:<br />
Foundations <strong>of</strong> S<strong>of</strong>tware Technology <strong>and</strong> Theoretical Computer Science, 23rd<br />
Conference, Mumbai, India, December 15-17, 2003, Proceedings, volume 2914<br />
<strong>of</strong> Lecture Notes in Computer Science. Springer, 2003.<br />
[167] M. Paterson <strong>and</strong> M. N. Wegman. Linear unification. J. Comput. Syst. Sci.,<br />
16(2):158–167, 1978.<br />
[168] L. C. Paulson. The inductive approach to verifying cryptographic protocols.<br />
Journal <strong>of</strong> Computer Security, 6(1-2):85–128, 1998.<br />
[169] O. Pereira <strong>and</strong> J.J. Quisquater. On the perfect encryption assumption.<br />
Proc. <strong>of</strong> the 1st Workshop on Issues in the Theory <strong>of</strong> Security (WITS’00), pages<br />
42–45, Geneva (Switzerl<strong>and</strong>), 2000.<br />
[170] T. Pornin <strong>and</strong> J. P. Stern. Digital signatures do not guarantee exclusive<br />
ownership. In J. Ioannidis, A. D. Keromytis, <strong>and</strong> M. Yung, editors, ACNS,<br />
volume 3531 <strong>of</strong> Lecture Notes in Computer Science, pages 138–150, 2005.<br />
[171] M. O. Rabin. Digitalized signatures <strong>and</strong> public-key functions as intractable<br />
as factorization. MIT/LCS/TR-212, MIT Laboratory for Computer<br />
Science, 1979.<br />
[172] R. L. Rivest. The md4 message digest algorithm. In A. Menezes <strong>and</strong><br />
S. A. Vanstone, editors, CRYPTO, volume 537 <strong>of</strong> Lecture Notes in Computer<br />
Science, pages 303–311. Springer, 1990.