Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Deterministic Multi-step Crossover Fusion: A Handy Crossover Composition for GAs
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Distributed Constraint Satisfaction and Optimization with Privacy Enforcement
IAT '04 Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
On private scalar product computation for privacy-preserving data mining
ICISC'04 Proceedings of the 7th international conference on Information Security and Cryptology
Privacy-preserving multi-objective evolutionary algorithms
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part II
Secure and efficient distributed linear programming
Journal of Computer Security - DBSec 2011
| Hi-index | 0.00 |
We propose a protocol for a local search and a genetic algorithm for the distributed traveling salesman problem (TSP). In the distributed TSP, information regarding the cost function such as traveling costs between cities and cities to be visited are separately possessed by distributed parties and both are kept private each other. We propose a protocol that securely solves the distributed TSP by means of a combination of genetic algorithms and a cryptographic technique, called the secure multiparty computation. The computation time required for the privacy preserving optimization is practical at some level even when the city-size is more than a thousand.