Cryptographic protocol design concept with genetic algorithms

3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Park, K., & Hong, C. (2005). Cryptographic protocol design concept with genetic algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3682 LNAI, pp. 483–489). Springer Verlag. https://doi.org/10.1007/11552451_65

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free