Cryptographic protocol design concept with genetic algorithms

Authors:
Kyeongmo Park;Chuleui Hong
Affiliations:
School of Computer Science and Information Engineering, The Catholic University of Korea, Yeongdeungpo-Gu, Seoul, Korea;Software School, Sangmyung University, Seoul, Korea
Venue:
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II
Year:
2005

Citing 4
Cited 1

Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
Practical Byzantine fault tolerance

OSDI '99 Proceedings of the third symposium on Operating systems design and implementation
How to share a secret

Communications of the ACM
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage

CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology

Nature---Inspired Synthesis of Rational Protocols

Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X

Quantified Score

Hi-index	0.00

Visualization

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.