Journal of Systems Engineering and Electronics ›› 2006, Vol. 17 ›› Issue (4): 858-863.doi: 10.1016/S1004-4132(07)60028-0

• SOFTWARE ALGORITHM AND SIMULATION • Previous Articles     Next Articles

Optimistic fair exchange E-commerce protocol based on secret sharing

Ma Changshe1,2,3Lei Feiyu1 & Chen Kefei1
  

  1. 1. Dept. of Computer Science and Engineering, Shanghai Jiaotong Univ. Shanghai 200080, P.R.China; 2. School of Computer, South China Normal Univ., Guangzhou 510631, P.R.China;
    3. The State Key Lab of Information Security, China Academy of Sciency, Beijing 100039, P.R.China
  • Online:2006-12-25 Published:2019-12-20

Abstract:

A key problem of electronic commerce (for short e-commerce) is fair exchange which guarantees that at the end of the transaction, either both parties involved in the transaction receive each other's items or none do. A non-interactive optimistic fair exchange e-commerce protocol model based on the publicly verifiable secret sharing is presented. The main idea of our exchange protocol is to interchange verifiable and recoverable keys of the symmetric encryption for participants' items. So it is especially suitable for exchange of large-size items. Furthermore, our protocol is efficient and simple as it does not need interactive proof system which has been adopted by a large quantity of previously proposed fan- exchange protocols. Based on a modified (2,2) secret sharing scheme, a concrete non-interactive fair exchange e-commerce protocol is designed.

Key words: