Privacy, Abstract Encryption and Protocols: An ASM Model - Part I

1. Martin Abadi and Phillip Rogaway. Reconciling two views of cryptography. Journal of Cryptology, 15(2):103–127, 2002. 377, 389

   MATH  MathSciNet  Google Scholar 

2. M. Bellare, A. Desai, D. Pointcheval, and P. Rogaway. Relations among notions of security for public-key encryption schemes. In CRYPTO’ 98, volume 1462 of LNCS, 1998. 376

   Google Scholar 

3. Andreas Blass and Yuri Gurevich. Background, reserve, and Gandy machines. In Proceedings of CSL’2000, volume 1862 of LNCS, 2000. 375

   Google Scholar 

4. Andreas Blass and Yuri Gurevich. Abstract state machines capture parallel algorithms. Technical Report MSR-TR-2001-117, Microsoft Research, 2001. 375, 376, 386, 388

   Google Scholar 

5. A. Blass, Y. Gurevich, and S. Shelah. Choiceless polynomial time. Annals of Pure and Applied Logic, 100 (1–3), 1999. 376

   Google Scholar 

6. Giampaolo Bella and Elvinia Riccobene. Formal analysis of the Kerberos authentication system. Journal of UCS, 3(12):1337–1381, 1997. 373

   MATH  Google Scholar 

7. Giampaolo Bella and Elvinia Riccobene. A realistic environment for cryptoprotocol analyses by ASMs. In Proceedings of the 28th Annual Conference of the German Society of Computer Science, 1998. 373

   Google Scholar 

8. Illiano Cervesato, Nancy Durgin, Patrick Lincoln, John Mitchell, and Andre Scedrov. Relating strands and multiset rewriting for security protocol analysis. In Proceeding of 13th IEEE CSFW, 2000. 377

   Google Scholar 

9. Hans Delfs and Helmut Knebl. Introduction to Cryptography. Springer, 2001. 374

   Google Scholar 

10. N. Durgin, P. Lincoln, J. Mitchell, and A. Scedrov. Multiset rewriting and the complexity of bounded security protocols. Technical report, 2002. 377, 389

    Google Scholar 

11. Nancy Durgin, John Mitchell, and Dusko Pavlovic. A compositional logic for protocol correctness. In Proceeding of 14th IEEE CSFW, 2001. 373, 377, 382

    Google Scholar 

12. M. P. Fiore and M. Abadi. Computing symbolic models for verifying cryptographic protocols. In Proceeding of 14th IEEE CSFW, pages 160–173, 2001. 377, 389

    Google Scholar 

13. F. Javier Thayer Fábrega, Jonathan C. Herzog, and Joshua D. Guttman. Honest ideals on strand spaces. In Proceeding of 11th IEEE CSFW, 1998. 377

    Google Scholar 

14. F. Javier Thayer Fábrega, Jonathan C. Herzog, and Joshua D. Guttman. Strand spaces: Proving security protocols correct. Journal of Computer Security, 7(2/3), 1999. 377

    Google Scholar 

15. Uwe Glaesser, Yuri Gurevich, and Margus Veanes. An abstract communication model. Technical Report MSR-TR-2002-55, 2002. 375

    Google Scholar 

16. Yuri Gurevich, Wolfram Schulte, Colin Campbell, and Wolfgang Grieskamp. AsmL: The Abstract State Machine Language, 2001. Version 1.5. 372, 373, 375

    Google Scholar 

17. Yuri Gurevich, Wolfram Schulte, and Margus Veanes. Toward industrial strength abstract state machines. Technical Report MSR-TR-2001-98, 2001. 375

    Google Scholar 

18. Yuri Gurevich. Sequential Abstract State Machines Capture Sequential Algorithms. ACM Transactions on Computational Logic, 1(1):77–111, July 2000. 386

    Article  MathSciNet  Google Scholar 

19. Gavin Lowe. A hierarchy of authentication specifications. In Proceedings of 10th IEEE CSFW, 1997. 387

    Google Scholar 

20. Paul Syverson. Towards a strand semantics for authentication logic. In Electronic Notes in TCS, volume 20, 2000. 377

    Google Scholar 

Download references