Protecting Mobile Agents against Malicious Hosts Using Dynamic Programming Homomorphic Encryption
暂无分享,去创建一个
[1] Yoav Shoham,et al. Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches , 1999, IJCAI.
[2] Tarig Mohamed Ahmed,et al. Generate secure mobile agent by using SMS to protect Hosts , 2010, ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010.
[3] Ronald M. Harstad,et al. Computationally Manageable Combinational Auctions , 1998 .
[4] Zbigniew Kotulski,et al. Security of mobile agents: a new concept of the integrity protection , 2005, ArXiv.
[5] Luc Moreau,et al. Trust Relationships in a Mobile Agent System , 2001, Mobile Agents.
[6] Giovanni Vigna,et al. Cryptographic Traces for Mobile Agents , 1998, Mobile Agents and Security.
[7] E. Rasmussen. Games and Information , 1989 .
[8] Joachim Posegga,et al. Mobile agents and telcos’ nightmares , 2000, Ann. des Télécommunications.
[9] Makoto Yokoo,et al. An efficient approximate algorithm for winner determination in combinatorial auctions , 2000, EC '00.
[10] Allam Mousa. Security and Performance of ElGamal Encryption Parameters , 2005 .
[11] Makoto Yokoo,et al. Secure multi-agent dynamic programming based on homomorphic encryption and its application to combinatorial auctions , 2002, AAMAS '02.