会议专题

A Gradual and Optimistic Fair Exchange Protocol

For electronic items without generability or revocability, previous optimistic exchange protocols cant guarantee strong fairness. Gradual protocols assume equal computing power. And online-TTP (Third Trusted Party) protocols often suffer from communication bottle-neck. A gradual and optimistic fair exchange protocol is presented in this paper to solve the problem. Secrets are gradually exchanged with partially validation by recipients, while the probability of detecting cheats increases. Fairness doesnt depend on equal computational power assumption. TTP isnt involved unless dispute appears. The protocol provides stronger fairness than optimistic or gradual schemes.

Tian Lan Zhiguang Qin Yang Zhao Hu Xiong Li Liu

School of Computer Science and Engineering, University of Electronic Science and Technology of China, Chengdu, Sichuan, China

国际会议

2007年通信、电路与系统国际会议(2007 International Conference on Communications,Circuits and Systems Proceedings)

日本福冈

英文

2007-07-11(万方平台首次上网日期,不代表论文的发表时间)