Design, Analysis, and Evaluation of Mobile Agent based Privacy Protection Scheme for Multi-party Computation Problems

Existing cryptography-based algorithms for multi-party computation problems (MPCP) are either too complex to be used practically or applicable only to the specific applications for which they have been developed. In addition, traditional (non-cryptography-based)algorithms do not provide good privacy protection for MPCPs. This paper presents the security system design, intuitive analysis, and empirical evaluation of an agent server platform for protecting privacy in solving multi-party computation problems with traditional algorithms. We have devised the security policies for an agent server platform and showed how the enforcement of those policies can effectively protect privacy while solving many MPCPs. Experimental analysis shows that the presented agent platform security system can significantly enhance privacy protection while solving the problems with traditional algorithms.

[1]  Wenliang Du,et al.  A study of several specific secure two-party computation problems , 2001 .

[2]  John Davin,et al.  Impact of problem centralization in distributed constraint optimization algorithms , 2005, AAMAS '05.

[3]  Wenliang Du,et al.  Privacy-preserving cooperative scientific computations , 2001, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001..

[4]  Eiji Kamioka,et al.  Privacy Protection in Multi-Agent based Applications , 2005 .

[5]  Andrew Chi-Chih Yao,et al.  Protocols for secure computations , 1982, FOCS 1982.

[6]  Eiji Kamioka,et al.  Privacy Protection in Mobile Agent Based Service Domain , 2005, Third International Conference on Information Technology and Applications (ICITA'05).

[7]  Victor R. Lesser,et al.  Solving distributed constraint optimization problems using cooperative mediation , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[8]  Josep Domingo-Ferrer,et al.  A nonrepudiable bitstring commitment scheme based on a public-key cryptosystem , 2004, International Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004..

[9]  Virgil D. Gligor,et al.  A guide to understanding covert channel analysis of trusted systems , 1993 .

[10]  Hong Shen,et al.  An Efficient Protocol for the Problem of Secure Two-party Vector Dominance , 2005, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05).

[11]  Makoto Yokoo,et al.  Secure distributed constraint satisfaction: reaching agreement without revealing private information , 2002, Artif. Intell..

[12]  Richard A. Kemmerer,et al.  A practical approach to identifying storage and timing channels: twenty years later , 2002, 18th Annual Computer Security Applications Conference, 2002. Proceedings..

[13]  Brian D. Snow.  Four Ways to Improve Security , 2005, IEEE Secur. Priv..

[14]  Milind Tambe,et al.  Privacy Loss in Distributed Constraint Reasoning: A Quantitative Framework for Analysis and its Applications , 2006, Autonomous Agents and Multi-Agent Systems.

[15]  Eiji Kamioka,et al.  An Efficient and Privacy-Aware Meeting Scheduling Scheme Using Common Computational Space , 2007, IEICE Trans. Inf. Syst..

[16]  Eiji Kamioka,et al.  Privacy Preserving Services for Wireless Network Environments , 2006 .

[17]  Sushil Jajodia,et al.  Performance optimizations for group key management schemes , 2003, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings..

[18]  Makoto Yokoo,et al.  Adopt: asynchronous distributed constraint optimization with quality guarantees , 2005, Artif. Intell..