{"title":"A Collusion-Resistant Distributed Signature Delegation Based on Anonymous Mobile Agent","authors":"Omaima Bamasak","volume":17,"journal":"International Journal of Computer and Information Engineering","pagesStart":1724,"pagesEnd":1731,"ISSN":"1307-6892","URL":"https:\/\/publications.waset.org\/pdf\/12636","abstract":"This paper presents a novel method that allows an\r\nagent host to delegate its signing power to an anonymous mobile\r\nagent in such away that the mobile agent does not reveal any information about its host-s identity and, at the same time, can be authenticated by the service host, hence, ensuring fairness of service\r\nprovision. The solution introduces a verification server to verify the\r\nsignature generated by the mobile agent in such a way that even if colluding with the service host, both parties will not get more information than what they already have. The solution incorporates\r\nthree methods: Agent Signature Key Generation method, Agent\r\nSignature Generation method, Agent Signature Verification method.\r\nThe most notable feature of the solution is that, in addition to allowing secure and anonymous signature delegation, it enables\r\ntracking of malicious mobile agents when a service host is attacked. The security properties of the proposed solution are analyzed, and the solution is compared with the most related work.","references":"[1] N. Asokan, V. Shoup, and M. Waidner, \"Optimistic fair exchange of digital signatures\", IEEE Journal on Selected Areas in Communication., vol. 18, pp. 591-610, April 2000.\r\n[2] O. Bamasak, \" Delegating Signing Power to Mobile Agents: Algorithms\r\nand Protocol Design\", PhD Thesis, School of Computer Science, the\r\nUniversity of Manchester, January 2006.\r\n[3] F. Bao, R.H. Deng, and W. Mao, \"Efficient and practical fair exchange protocols with off-line TTP\", in Proc. IEEE Symposium on Security and\r\nPrivacy, Oakland, CA, May 1998, pp. 77-85.\r\n[4] M. Blum, \"How to exchange (secret) keys\", ACM Trans. Computer\r\nSystems, Vol. 1, no.2, pp. 175-193, 1983.\r\n[5] C. Boyd and E. Foo, \"Off-line fair payment protocols using convertible\r\nsignature\", Advances in Cryptology - in Proc. Asiacrypt' 98, LNCS\r\n1514, Springer-Verlag, 1998, pp. 271-285.\r\n[6] L. Chen, \"Efficient fair exchange with verifiable confirmation of\r\nsignatures\", Advances in Cryptology - in Proc. Asiacrypt' 98, LNCS\r\n1514, Springer-Verlag, 1998, pp. 286-299.\r\n[7] R.H.Deng, L. Gong, A. A. Lazar, and W. Wang, \"Practical protocol for\r\ncertified electronic mail\", Journal of Network and System Management,\r\nvol. 4, no. 3, pp.279-297, 1996.\r\n[8] S. Even, O. Golreich, and A. Lempel, \"A randomized protocol for signing contracts\", Communications of the ACM, vol. 28, no. 6, pp.\r\n637-647, 1985.\r\n[9] M.K. Franklin and M.K. Reiter, \"Verifiable signature sharing\", Advances in Cryptology - Proc. Eurocrypt' 95, LNCS 921, 1995, pp.\r\n50-63.\r\n[10] J. A. Garay, M. Jakobsson, and P. MacKenzie, \"Abuse-free optimistic contract signing\", Advances in Cryptology - Proc. Crypto' 99, LNCS\r\n1666, Springer-Verlag, 1999, pp. 449 - 466.\r\n[11] M. Jakobsson, K. Sako, and R. Impagliazzo, \"Designated verifier proofs\r\nand their applications\", Advances in Cryptology - Proc. Eurocrypt' 96,\r\nLNCS 1070, Springer-Verlag, 1996, pp. 143 - 154.\r\n[12] T. Okamoto and K. Ohta, \"How to simultaneously exchange secrets by\r\ngeneral assumptions\", in Proc. the 2nd ACM Conference on Computer\r\nand Communications Security, 1994, pp. 184-192.\r\n[13] C. Wang and C. Yin, \"Practical Implementations of a Non-disclosure\r\nFair Contract Signing Protocol\", IEICE Trans. on Fundamentals of\r\nElectronics, Communications and Computer Science, vol. e89-a, no. 1, pp. 297-309, 2006.\r\n[14] J. Zhou and D. Gollmann, \"A fair non-repudiation protocol\", in Proc.\r\n1996 IEEE Symposium on Security and Privacy, Oakland, CA, 1996, pp.\r\n55-61.\r\n[15] J. Zhou and D. Gollmann, \"An efficient non-repudiation protocol\", in\r\nProc. 1997 IEEE Computer Security Foundations Workshop (CSFW\r\n10), 1997, pp. 126 - 132.\r\n[16] M. Lin, C. Chang, Y. Chen, \"A fair and secure mobile agent environment based on blind signature and proxy host\", Computers &\r\nSecurity, vol. 23, pp. 199-212, Elsevier, 2004.\r\n[17] D. Chaum, \"Blind signatures for untraceable payments\", in Proc.\r\nCRYPTO-82, Plenum Press, Berlin, 1983, pp. 199-203.\r\n[18] J. Kim, G. Kim, Y. Eom, \"Design of the Mobile Agent Anonymity\r\nFramework in Ubiquitous Computing Environments\", IEICE Trans. on\r\nInformation and Systems, Vol. E89-D, No. 12, pp. 2990-2993,\r\nDecember 2006.\r\n[19] RL. Rivest, A. Shamir, LM. Adleman, \"A method for obtaining digital\r\nsignatures and public key cryptosystems\". Communication of ACM,\r\nVol. 21, No. 2, pp. 120-126.\r\n[20] National Institute of Standard and Technology (NIST), \"Secure Hash\r\nStandard\", Federal Information Processing Standards Publication 180-1.\r\n[21] U. Wilhelm, \"Cryptographically Protected Objects\", Technical report,\r\n1997, Ecole Polytechnique Federale de Lausanne, Switzerland.\r\n[22] F. Hohl, \"Time Limited Blackbox Security: Protecting Mobile Agents\r\nfrom malicious Hosts\", In Mobile Agents and Security, Lecture Notes in\r\nComputer Science, Vol. 1419, 1998, Springer-Verlag, pp. 92-113.\r\n[23] S. Kremer and J. Raskin, \"A game-based verification of non-repudiation\r\nand fair exchange protocols\", in Proc. 12th International Conference on\r\nConcurrency Theory (CONCUR 2001), Lecture Notes in Computer\r\nScience, Vol. 2154, Springer-Verlag, Berlin, Germany, 2001, pp. 551-566.\r\n[24] S. Kremer and J. Raskin, \"Game Analysis of abuse-free contract signing\", in Proc. 15th IEEE Computer Security Foundations Workshop,\r\nIEEE Computer Society Press, 2002, pp. 206-220.\r\n[25] Aglets Mobile Agent Platform, http:\/\/www.trl.ibm.co.jp\/aglets","publisher":"World Academy of Science, Engineering and Technology","index":"Open Science Index 17, 2008"}