Skip to main content

Guarantee of Cryptographic Protocol Security

  • Chapter
Cryptographic Protocol
  • 884 Accesses

Abstract

Some important provable security notions like indistinguishability, match conversation, authentication, etc. are briefly reviewed. The security definitions of UA-Secure, MA-Secure, UK-Secure and MK-Secure are specified based on the trusted freshness principle, and these formalization specifications are proved to be adequate for the intended security goals.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 149.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 199.99
Price excludes VAT (USA)
  • Durable hardcover 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. Bellare M, Rogaway P (1993) Entity Authentication and Key Distribution. In: CRYPTO’93 Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology, Santa Barbara, 22–26 Aug 1993. Lecture Notes in Computer Science, vol 773, pp 232–249, Springer

    Google Scholar 

  2. Bellare M, Canetti R, Krawczyk H (1998) A Modular Approach to the Design and Analysis of Authentication and Key-exchange Protocols. In: Proceedings of the 30th STOC, Dallas, 23–26 May 1998

    Google Scholar 

  3. Goldwasser S, Micali S (1984) Probabilistic Encryption. Journal of Computer and System Sciences 28(2): 270–299

    Article  MathSciNet  MATH  Google Scholar 

  4. Goldwasser S, Micali S, Rivest R (1988) A Digital Signature Scheme Secure Against Adaptive Chosen-message Attacks. SIAM Journal of Computing 17(2): 281–308

    Article  MathSciNet  MATH  Google Scholar 

  5. Blum M, Micali S (1984) How to Generate Cryptographically Strong Sequences of Pseudorandom Bits. SIAM Journal on Computing 13(4): 850–864

    Article  MathSciNet  MATH  Google Scholar 

  6. Yao AC (1982) Theory and Applications of Trapdoor Functions. In: Proceedings of the IEEE 23rd Annual Symposium on the Foundations of Computer Science, Chicago, 3–5 Nov 1982

    Google Scholar 

  7. Bellare M, Rogaway P (1995) Provably Secure Session Key Distribution—the Three Party Case. In: Proceedings of the 27th ACM Symposium on the Theory of Computing, Las Vegas, 29 May–1 June 1995

    Google Scholar 

  8. Mao W (2004) Modern Cryptography: Theory and Practice. Prentice Hall, New Jersey

    Google Scholar 

  9. Menezes A, van Oorschot P, Vanstone S (1996) Handbook of Applied Cryptography. CRC Press, New York

    Book  Google Scholar 

  10. Canetti R, Krawczy H (2001) Analysis of Key-exchange Protocols and Their Use for Building Secure Channels. In: EUROCRYPT’01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology, Innsbruck, 6–10 May 2001. Lecture Notes in Computer Science, vol 2045, pp 453–474, Springer

    Google Scholar 

  11. Dolev D, Yao AC (1983) On the Security of Public Key Protocols. IEEE Transactions on Information Theory 29(2): 198–208

    Article  MathSciNet  MATH  Google Scholar 

  12. Goldreich O (2003) Foundations of Cryptography. Cambridge University Press, New York

    Google Scholar 

  13. Otway D, Rees O (1987) Efficient and Timely Mutual Authentication. Operating Systems Review 21(1): 8–10

    Article  Google Scholar 

  14. Abadi M, Needham R (1996) Prudent Engineering Practice for Cryptographic Protocols. IEEE Transactions on Software Engineering 22(1): 6–15

    Article  Google Scholar 

  15. Lowe G (1995) An Attack on the Needham-Schroeder Public Key Authentication Protocol. Information Processing Letters 56(3): 131–133

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Higher Education Press, Beijing and Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Dong, L., Chen, K. (2012). Guarantee of Cryptographic Protocol Security. In: Cryptographic Protocol. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-24073-7_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-24073-7_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-24072-0

  • Online ISBN: 978-3-642-24073-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics