渐进、乐观的公平交易协议

Tian Lan, Zhiguang Qin, Yang Zhao, H. Xiong, Li Liu
{"title":"渐进、乐观的公平交易协议","authors":"Tian Lan, Zhiguang Qin, Yang Zhao, H. Xiong, Li Liu","doi":"10.1109/ICCCAS.2007.6251604","DOIUrl":null,"url":null,"abstract":"For electronic items without generability or revocability, previous optimistic exchange protocols can't 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 doesn't depend on equal computational power assumption. TTP isn't involved unless dispute appears. The protocol provides stronger fairness than optimistic or gradual schemes.","PeriodicalId":218351,"journal":{"name":"2007 International Conference on Communications, Circuits and Systems","volume":"252 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A gradual and optimistic fair exchange protocol\",\"authors\":\"Tian Lan, Zhiguang Qin, Yang Zhao, H. Xiong, Li Liu\",\"doi\":\"10.1109/ICCCAS.2007.6251604\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"For electronic items without generability or revocability, previous optimistic exchange protocols can't 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 doesn't depend on equal computational power assumption. TTP isn't involved unless dispute appears. The protocol provides stronger fairness than optimistic or gradual schemes.\",\"PeriodicalId\":218351,\"journal\":{\"name\":\"2007 International Conference on Communications, Circuits and Systems\",\"volume\":\"252 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-07-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 International Conference on Communications, Circuits and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCAS.2007.6251604\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 International Conference on Communications, Circuits and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCAS.2007.6251604","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

对于不具有可溯性和可撤销性的电子物品,以往的乐观交换协议无法保证强公平性。渐进协议假定具有同等的计算能力。而在线ttp(第三方可信方)协议经常遭遇通信瓶颈。为了解决这一问题,本文提出了一种渐进的、乐观的公平交换协议。秘密逐渐交换,由接收方进行部分验证,同时发现作弊的可能性增加。公平并不依赖于计算能力相等的假设。除非出现争议,否则TTP不会参与。该协议提供了比乐观或渐进方案更强的公平性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A gradual and optimistic fair exchange protocol
For electronic items without generability or revocability, previous optimistic exchange protocols can't 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 doesn't depend on equal computational power assumption. TTP isn't involved unless dispute appears. The protocol provides stronger fairness than optimistic or gradual schemes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
DC Tolerance Analysis of Nonlinear Circuits Using Set-Valued Functions Mining Co-regulated Genes Using Association Rules Combined with Hash-tree and Genetic Algorithms MTIM for IEEE 802.11 DCF power saving mode The Total Dose Radiation Hardened MOSFET with Good High-temperatue Performance Partner choice based on beam search in wireless cooperative networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1