Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Abstract State Machines 2003 (ASM 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2589))

Included in the following conference series:

Abstract

We introduce an executable formal model of abstract encryption using the specification language AsmL, based on Abstract State Machines of Gurevich, providing a simple executable models for cryptographic protocols. We show strong universality properties of our descriptions of patterns, protocol roles and environment behaviors-no ASM program can do better, given the same information.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  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

Author information

Authors and Affiliations

  1. University of Zagreb, Zagreb

    Dean Rosenzweig, Davor Runje & Neva Slani

Authors
  1. Dean Rosenzweig
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Davor Runje
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Neva Slani
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università di Pisa, Via Buonarotti 2, 56127, Pisa, Italy

    Egon Börger

  2. CEA, Università di Catania, Piazza Università 2, 95124, Catania, Italy

    Angelo Gargantini

  3. Dipartimento di Matematica e Informatica, Università di Catania, Città Universitaria, viale A. Doria 6, 95125, Catania, Italy

    Elvinia Riccobene

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rosenzweig, D., Runje, D., Slani, N. (2003). Privacy, Abstract Encryption and Protocols: An ASM Model - Part I. In: Börger, E., Gargantini, A., Riccobene, E. (eds) Abstract State Machines 2003. ASM 2003. Lecture Notes in Computer Science, vol 2589. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36498-6_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-36498-6_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00624-4

  • Online ISBN: 978-3-540-36498-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation