Skip to main content

Cryptographic Protocol Design Concept with Genetic Algorithms

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3682))

Abstract

This paper describes design concepts of genetic algorithms in the cryptographic protocols for a fault-tolerant agent replication system. The principles of cryptographic protocols are outlined, followed by the specification of modal logic that is used to encode the belief and knowledge of communicating parties. Replication and voting do not suffice and cryptographic support is required. Secret sharing is a fundamental notion for secure cryptographic design. In a secret sharing protocol a dealer shares a secret among n servers so that subsets of t + 1 or more servers can later reconstruct the secret, while subsets of t or less servers have no information about it. This is what it is called a threshold secret sharing scheme. A verifiable secret sharing protocol adds fault tolerance to the above tasks. Our protocol can be used by asynchronous fault-tolerant service replicas.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Castro, M., Liskov, B.: Practical Byzantine Fault Tolerance. In: OSDI: Symp. on Operating Systems Design and Implementation, USENIX Association (1999)

    Google Scholar 

  2. Dasgupta, P.: A Fault Tolerance Mechanism for MAgNET: A Mobile Agent based ECommerce System. In: Proc. Sixth Int. Conf. Internet Computing, Las Vegas, NV, June 24-27, pp. 733–739 (2002)

    Google Scholar 

  3. Herzberg, A., Jarecki, S., Krawczyk, H., Yung, M.: Proactive secret sharing or: How to cope with perpetual leakage. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 339–352. Springer, Heidelberg (1995)

    Google Scholar 

  4. Ito, M., Saito, A., Nishizeki, T.: Secret sharing scheme realizing general access structure. In: IEEE Globecom, pp. 99–102 (1987)

    Google Scholar 

  5. Jarecki, S.: Proactive Secret Sharing and Public Key Cryptosystems. Master’s thesis, MIT, Cambridge, MA (September 1995)

    Google Scholar 

  6. Mishra, S., et al.: DaAgent: A Dependable Mobile Agent System. In: Proc. of the 29th IEEE Int. Symp. Fault-Tolerant Computing, Madison, WI (June 1999)

    Google Scholar 

  7. Shamir, A.: How to share a secret. Communications of the ACM 22, 612–613 (1979)

    Article  MATH  MathSciNet  Google Scholar 

  8. Strasser, M., Rothermel, K.: Reliability Concepts for Mobile Agent. Int. Journal Cooperative Information Systems 7(4), 355–382 (1998)

    Article  Google Scholar 

  9. Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, 3rd edn. Springer, Heidelberg (1996)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Park, K., Hong, C. (2005). Cryptographic Protocol Design Concept with Genetic Algorithms. In: Khosla, R., Howlett, R.J., Jain, L.C. (eds) Knowledge-Based Intelligent Information and Engineering Systems. KES 2005. Lecture Notes in Computer Science(), vol 3682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11552451_65

Download citation

  • DOI: https://doi.org/10.1007/11552451_65

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-31986-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics