Efficient Fair Conditional Payments for Outsourcing Computations

The outsourcing computations in distributed environments suffer from the trust problems between the outsourcer and the workers. All existing solutions only assume the rational lazy-but-honest workers. In this paper, we first introduce the rational lazy-and-partially-dishonest workers in the outsourcing computation model. In addition, we propose a new fair conditional payment scheme for outsourcing computation that is only based on traditional electronic cash systems. The proposed construction uses a semitrusted third party T to achieve the fairness and efficiency. However, T is only involved in the protocol in the exceptional case, namely in the case of disputes. Moreover, since neither the secret sharing/splitting scheme nor the cut-and-choose protocol is used for the generation or verification of the payment token, our solution clearly outperforms the existing schemes in terms of efficiency.

[1]  Marina Blanton Improved Conditional E-Payments , 2008, ACNS.

[2]  Jan Camenisch,et al.  Separability and Efficiency for Generic Group Signature Schemes , 1999, CRYPTO.

[3]  Stephen C. Pohlig,et al.  An Improved Algorithm for Computing Logarithms over GF(p) and Its Cryptographic Significance , 2022, IEEE Trans. Inf. Theory.

[4]  Wenliang Du,et al.  Uncheatable grid computing , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[5]  Philippe Golle,et al.  Uncheatable Distributed Computations , 2001, CT-RSA.

[6]  Doug Szajda,et al.  Hardening functions for large scale distributed computations , 2003, 2003 Symposium on Security and Privacy, 2003..

[7]  Markus Jakobsson,et al.  Abuse-Free Optimistic Contract Signing , 1999, CRYPTO.

[8]  Arjen K. Lenstra,et al.  Factorization of a 768-Bit RSA Modulus , 2010, CRYPTO.

[9]  Martin E. Hellman,et al.  An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (Corresp.) , 1978, IEEE Trans. Inf. Theory.

[10]  N. Asokan,et al.  Optimistic protocols for fair exchange , 1997, CCS '97.

[11]  Birgit Baum-Waidner,et al.  Optimistic Asynchronous Multi-party Contract Signing with Reduced Number of Rounds , 2001, ICALP.

[12]  Jan Camenisch,et al.  Endorsed E-Cash , 2007, 2007 IEEE Symposium on Security and Privacy (SP '07).

[13]  Robert H. Deng,et al.  Efficient and practical fair exchange protocols with off-line TTP , 1998, Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186).

[14]  N. Asokan,et al.  Asynchronous protocols for optimistic fair exchange , 1998, Proceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186).

[15]  Jan Camenisch,et al.  A Signature Scheme with Efficient Protocols , 2002, SCN.

[16]  Guomin Yang,et al.  Ambiguous Optimistic Fair Exchange , 2008, ASIACRYPT.

[17]  David Chaum,et al.  Wallet Databases with Observers , 1992, CRYPTO.

[18]  Luis F. G. Sarmenta Sabotage-tolerance mechanisms for volunteer computing systems , 2002, Future Gener. Comput. Syst..

[19]  Bogdan Carbunar,et al.  Conditional Payments for Computing Markets , 2008, CANS.

[20]  Manuel Blum,et al.  How to exchange (secret) keys , 1983, TOCS.

[21]  Radu Sion,et al.  Uncheatable Reputation for Distributed Computation Markets , 2006, Financial Cryptography.

[22]  Radu Sion,et al.  Conditional E-Cash , 2007, Financial Cryptography.

[23]  Barry Lawson,et al.  Toward an Optimal Redundancy Strategy for Distributed Computations , 2005, 2005 IEEE International Conference on Cluster Computing.

[24]  Oded Goldreich,et al.  A randomized protocol for signing contracts , 1985, CACM.

[25]  Philippe Golle,et al.  Secure Distributed Computing in a Commercial Environment , 2002, Financial Cryptography.

[26]  Radu Sion,et al.  Conditional e-payments with transferability , 2011, J. Parallel Distributed Comput..

[27]  Jacques Stern,et al.  A new public key cryptosystem based on higher residues , 1998, CCS '98.

[28]  Giuseppe Ateniese Verifiable encryption of digital signatures and applications , 2004, TSEC.

[29]  Dieter Gollmann,et al.  A fair non-repudiation protocol , 1996, Proceedings 1996 IEEE Symposium on Security and Privacy.

[30]  Ivan Damgård,et al.  Verifiable Encryption, Group Encryption, and Their Applications to Separable Group Signatures and Signature Sharing Schemes , 2000, ASIACRYPT.

[31]  N. Asokan,et al.  Optimistic fair exchange of digital signatures , 1998, IEEE Journal on Selected Areas in Communications.

[32]  Robert H. Deng,et al.  Practical protocols for certified electronic mail , 1996, Journal of Network and Systems Management.

[33]  Kazue Sako,et al.  Verifiable Encryption , 2005, Encyclopedia of Cryptography and Security.

[34]  Ivan Damgård,et al.  Practical and provably secure release of a secret and exchange of signatures , 1994, Journal of Cryptology.

[35]  Fabian Monrose,et al.  Distributed Execution with Remote Audit , 1999, NDSS.

[36]  Michael K. Reiter,et al.  Fair Exchange with a Semi-Trusted Third Party (extended abstract) , 1997, CCS.

[37]  Bogdan Carbunar,et al.  Fair Payments for Outsourced Computations , 2010, 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON).

[38]  Markus Stadler,et al.  Publicly Verifiable Secret Sharing , 1996, EUROCRYPT.

[39]  Yi Mu,et al.  Three-Round Abuse-Free Optimistic Contract Signing with Everlasting Secrecy , 2010, Financial Cryptography.