Efficient fair conditional payments for outsourcing computations

IEEE Transactions on Information Forensics and Security

Volumn 7, Issue 6, 2012, Pages 1687-1694

  Chen, Xiaofeng ^a   Li, Jin ^b   Susilo, Willy ^c  

^a XIDIAN UNIVERSITY   (China)

^b GUANGZHOU UNIVERSITY   (China)

^c UNIVERSITY OF WOLLONGONG   (Australia)

Author keywords

electronic cash; Outsourcing computations; ringers; verifiable encryption

Indexed keywords

COMPUTATION MODEL; DISTRIBUTED ENVIRONMENTS; ELECTRONIC CASH; ELECTRONIC CASH SYSTEMS; SECRET SHARING; SEMI-TRUSTED THIRD PARTIES; VERIFIABLE ENCRYPTIONS;

BELLS; ELECTRONIC COMMERCE;

OUTSOURCING;

EID: 84870282993     PISSN: 15566013     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIFS.2012.2210880     Document Type: Article

References (39)

1. G. Ateniese, "Verifiable encryption of digital signatures and applications," ACM Trans. Inf. Syst. Security, vol. 7, no. 1, pp. 1-20, 2004, ACM Press.
2. N. Asokan, M. Schunter, and M. Waidner, "Optimistic protocols for fair exchange," in Proc. ACM Conf. Computer and Communications Security, 1997, pp. 6-17, ACM Press.
3. N. Asokan, V. Shoup, and M. Waidner, "Asynchronous protocols for optimistic fair exchange," in Proc. IEEE Symp. Research in Security and Privacy, 1998, pp. 86-99, IEEE Computer Society Press.
4. N. Asokan, V. Shoup, and M. Waidner, "Optimistic fair exchange of digital signatures," in Proc. Advances in Cryptology-Eurocrypt 1998 (LNCS 1403), Berlin, Heidelberg, New York, 1998, pp. 591-606, Springer. (Pubitemid 128081515)
5. N. Asokan, V. Shoup, and M. Waidner, "Optimistic fair exchange of digital signatures," IEEE J. Sel. Areas Commun., vol. 18, no. 4, pp. 593-610, Apr. 2000.
6. M. Blanton, "Improved conditional e-payments," in Proc. ACNS 2008, LNCS 5037, 2008, pp. 188-206, Springer-Verlag.
7. M. Blum, "How to exchange (secret) keys," ACMTrans. Comput. Syst., vol. 1, no. 2, pp. 175-193, 1983.
8. S. Brands, "Untraceable off-line cash in wallet with observers," in Proc. Advances in Cryptology-Crypto 1993 (LNCS 773), 1993, pp. 302-318, Springer-Verlag.
9. B. Baum-Waidner, "Optimistic asynchronous multi-party contract signing with reduced number of rounds," in Proc. ICALP 2001, LNCS 2076, Berlin, Heidelberg, New York, 2001, pp. 898-911, Springer. (Pubitemid 33300856)
10. F. Bao, R. Deng, and W. Mao, "Efficient and practical fair exchange protocols with off-Line TTP," in Proc. IEEE Symp. Research in Security and Privacy, 1998, pp. 77-85, IEEE Computer Society Press.
11. J. Camenisch and I. Damgård, "Verifiable encryption, group encryption, and their applications to separable group signatures and signature sharing schemes," in Proc. Advances in Cryptology-Asiacrypt 2000 (LNCS 1976), 2000, pp. 331-345, Springer-Verlag.
12. J. Camenisch and A. Lysyanskaya, "A signature scheme with efficient protocols," in Proc. SCN 2002, LNCS 2576, 2003, pp. 268-289, Springer-Verlag.
13. J. Camenisch, A. Lysyanskaya, and Meyerovich, "Endorsed e-cash," in Proc. IEEE Symp. Secrity and Privacy, 2007, pp. 101-115. (Pubitemid 47432520)
14. D. Chaum and T. Pedersen, "Wallet databases with observers," in Proc. Advances in Cryptology-Crypto 1992 (LNCS 740), 1993, pp. 89-105, Springer-Verlag.
15. J. Camenisch and M. Michels, "Separability and efficiency for generic group signature schemes," in Proc. Advances in Cryptology-Crypto 1999 (LNCS 1666), 1999, pp. 413-430, Springer-Verlag.
16. B. Carbunar and R. Sion, "Uncheatable reputation for distributed computation markets," in Proc. FC 2006, LNCS 4107, 2006, pp. 96-110, Springer-Verlag. (Pubitemid 44577280)
17. B. Carbunar, L. Shi, and R. Sion, "Conditional e-payments with transferability," J. Parallel Distrib. Comput., vol. 71, no. 1, pp. 16-26, 2011, Elsevier.
18. B. Carbunar and M. Tripunitara, "Conditioal payments for computing markets," in Proc. CANS 2008, LNCS 5339, 2008, pp. 317-331, Springer-Verlag.
19. B. Carbunar and M. Tripunitara, "Fair payments for outsourced computations," in Proc. 7th Ann. IEEE Communications Society Conf. Sensor, Mesh and Ad Hoc Communications and Networks (SECON 2010), 2010, pp. 529-537.
20. X.Chen, F. Zhang, H. Tian,Q.Wu, Y.Mu, J.Kim, andK. Kim, "Threeround abuse-free optimistic contract signing with everlasting secrecy," in Proc. FC 2010, LNCS 6052, 2010, pp. 304-311, Springer-Verlag.
21. I. Damgåard, "Practical and provably secure release of a secret and exchange of signatures," J. Cryptology, vol. 8, no. 4, pp. 201-222, 1995, Springer, Berlin, Heidelberg, New York.
22. W.Du, J. Jia, M. Mangal, andM. Murugesan, "Uncheatable grid computing," in Proc. 24th Int. Conf. Distributed Computing Systems, 2004, pp. 4-11.
23. R. H. Deng, L. Gong, A. Lazar, and W. Wang, "Practical protocol for certified electronic mail," J. Netw. Syst. Manage., vol. 4, no. 3, pp. 279-297, 1996.
24. S. Even, O. Goldreich, and A. Lempel, "A randomized protocol for signing contracts," Commun. ACM, vol. 28, no. 6, pp. 637-647, 1985.
25. M. Franklin and M. Reiter, "Fair exchange with a semi-trusted third party," in Proc. ACM Conf. Computer and Communications Security, 1997, pp. 1-5, ACM Press.
26. J. A. Garay, M. Jakobsson, and P. MacKenzie, "Abuse-free optimistic contract signing," in Proc. Advances in Cryptology-Crypto 1999 (LNCS 1666), Berlin, Heidelberg, New York, 1999, pp. 449-466, Springer.
27. P. Golle and I. Mironov, "Uncheatable distributed computations," in Proc. CT-RSA 2001, LNCS 2020, 2001, pp. 425-440, Springer-Verlag. (Pubitemid 33255180)
28. P. Golle and S. G. Stubblebine, "Secure distributed computing in a commercial environment," in Proc. FC 2001, LNCS 2339, 2001, pp. 289-304, Springer-Verlag.
29. Q. Huang, G. Yang, D. Wong, and W. Susilo, "Ambiguous optimistic fair exchange," in Proc. Advances in Cryptology-ASIACRYPT 2008 (LNCS5350),Berlin,Heidelberg,NewYork, 2008, pp. 74-89, Springer.
30. T. Kleinjung, K. Aoki, J. Franke, A. Lenstra, E. Thomé, J. Bos, P. Gaudry, A. Kruppa, P. Montgomery, D. Osvik, H. te Riele, A. Timofeev, and P. Zimmermann, "Factorization of a 768-bit RSA modulus," in Proc. Advances in Cryptology-Crypto 2010 (LNCS 6223), Berlin, Heidelberg, New York, 2010, pp. 333-350, Springer.
31. F.Monrose, P.Wyckoff, and A. Rubin, "Distributed execution with remote audit," in Proc. Network and Distributed System Security Symp., 1999, pp. 103-113.
32. D. Naccache and J. Stern, "A new public key cryptosystem based on higher residues," in Proc. Fifth ACM Conf. Computer and Communications Security, 1998, pp. 59-66, ACM Press.
33. S. C. Pohlig and M. E. Hellman, "An improved algorithm for computing logarithms over and its crytographic significance," IEEE Trans. Inf. Theory, vol. IT-24, no. 1, pp. 106-110, Jan. 1978.
34. L. F. G. Sarmenta, "Sabotage-tolerance mechanisms for volunteer computing systems," Future Generation Computer Systems: Special Issue on Cluster Computing and the Grid, vol. 18, pp. 561-572, 2002. (Pubitemid 34181832)
35. M. Stadler, "Publicly verifiable secret sharing," in Proc. Advances in Cryptology-Eurocrypt 1996 (LNCS 1070), 1996, pp. 191-199, Springer-Verlag.
36. L. Shi, B. Carbunar, and R. Sion, "Conditional e-Cash," in Proc. FC 2007, LNCS 4886, 2007, pp. 15-28, Springer-Verlag. (Pubitemid 351153039)
37. D. Szajda, B. Lawson, and J. Owen, "Hardening functions for largescale distributed computations," in Proc. IEEE Symp. Security and Privacy, 2003, pp. 216-224.
38. D. Szajda, B. Lawson, and J. Owen, "Toward an optimal redundancy strategy for distributed computations," in Proc. 2005 IEEE Int. Conf. Cluster Computing, 2005, pp. 1-11.
39. J. Zhou and D. Gollmann, "A fair non-repudiation protocol," in Proc. IEEE Symp. Research in Security and Privacy, 1996, pp. 55-61, IEEE Computer Society Press.