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 215<br />
[173] R. L. Rivest. The md5 message digest algorithm. RFC, 1321, April, 1992.<br />
[174] R. L. Rivest, A. Shamir, <strong>and</strong> L. M. Adleman. A method for obtaining digital<br />
signatures <strong>and</strong> public-key cryptosystems. Commun. ACM, 21(2):120–<br />
126, 1978.<br />
[175] R. L. Rivest, A. Shamir, <strong>and</strong> L. M. Adleman. A method for obtaining digital<br />
signatures <strong>and</strong> public-key cryptosystems. Commun. ACM, 21(2):120–<br />
126, 1978.<br />
[176] J.A. Robinson. A machine-oriented logic based on the resolution principle.<br />
J. ACM, 12(1):23–41, 1965.<br />
[177] J.A. Robinson. Fast unification. In Theorem Proving Workshop, Oberwolfach,<br />
W. Germany, 1976.<br />
[178] M. Rusinowitch <strong>and</strong> M. Turuani. Protocol insecurity with finite number<br />
<strong>of</strong> sessions is np-complete. In CSFW, pages 174–. IEEE Computer Society,<br />
2001.<br />
[179] P. Ryan, S. Schneider, M. Goldsmith, G. Lowe, <strong>and</strong> B. Roscoe. Modelling<br />
<strong>and</strong> analysis <strong>of</strong> security protocols. Livres aux éditions Addison-Wesley, 2001.<br />
[180] H. Lin S. Delaune <strong>and</strong> Ch. Lynch. Protocol verification via rigid/flexible<br />
resolution. In N. Dershowitz <strong>and</strong> A. Voronkov, editors, LPAR, volume<br />
4790 <strong>of</strong> Lecture Notes in Computer Science, pages 242–256. Springer, 2007.<br />
[181] K. Sako <strong>and</strong> J. Kilian. Receipt-free mix-type voting scheme - a practical<br />
solution to the implementation <strong>of</strong> a voting booth. In EUROCRYPT, pages<br />
393–403, 1995.<br />
[182] D. S<strong>and</strong>ler, K. Derr, <strong>and</strong> D. S. Wallach. Votebox: A tamper-evident, verifiable<br />
electronic voting system. In P. C. van Oorschot, editor, USENIX<br />
Security Symposium, pages 349–364. USENIX Association, 2008.<br />
[183] Y. Sasaki, Y. Naito, N. Kunihiro, <strong>and</strong> K. Ohta. Wang’s sufficient conditions<br />
<strong>of</strong> md5 are not sufficient. 2005.<br />
[184] M. Schmidt-Schauß. Unification under associativity <strong>and</strong> idempotence is<br />
<strong>of</strong> type nullary. J. Autom. Reasoning, 2(3):277–281, 1986.<br />
[185] C.P. Schnorr. Efficient signature generation by smart cards. J. Cryptology,<br />
4(3):161–174, 1991.<br />
[186] K. U. Schulz. Makanin’s algorithm for word equations - two improvements<br />
<strong>and</strong> a generalization. In K. U. Schulz, editor, IWWERT, volume 572<br />
<strong>of</strong> Lecture Notes in Computer Science, pages 85–150. Springer, 1990.