A new efficient optimistic fair exchange protocol without random oracles

被引:13
|
作者
Huang, Qiong [1 ]
Yang, Guomin [2 ]
Wong, Duncan S. [3 ]
Susilo, Willy [4 ]
机构
[1] S China Agr Univ, Coll Informat, Guangzhou, Guangdong, Peoples R China
[2] Natl Univ Singapore, Temasek Labs, Singapore 117548, Singapore
[3] City Univ Hong Kong, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China
[4] Univ Wollongong, Sch Comp Sci & Software Engn, Wollongong, NSW, Australia
基金
中国国家自然科学基金; 澳大利亚研究理事会;
关键词
Optimistic fair exchange; Time capsule signature; Standard model; CDH assumption; SEQUENTIAL AGGREGATE SIGNATURES; RING SIGNATURES; STAND-ALONE; ENCRYPTION; SECURE; MODEL;
D O I
10.1007/s10207-011-0152-3
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Optimistic fair exchange (OFE) is a kind of protocols to solve the problem of fair exchange between two parties. Most of the previous work on this topic are provably secure in the random oracle model. In this work, we propose a new construction of OFE from another cryptographic primitive, called time capsule signature. The construction is efficient and brings almost no overhead other than the primitive itself. The security of our new construction is based on that of the underlying primitive without relying on the random oracle heuristic. Applying our generic construction to the time capsule signature scheme recently proposed by Libert and Quisquater, we obtain a new concrete and efficient OFE construction secure based on Computational Diffie-Hellman assumption in the standard model.
引用
收藏
页码:53 / 63
页数:11
相关论文
共 50 条
  • [41] Efficient ID-based optimistic fair exchange with provable security
    Zhang, ZF
    Feng, DG
    Xu, J
    Zhou, YB
    INFORMATION AND COMMUNICATIONS SECURITY, PROCEEDINGS, 2005, 3783 : 14 - 26
  • [42] An Abuse-Free Optimistic Fair Exchange Protocol Based on BLS Signature
    Gao, Wei
    Li, Fei
    Xu, Banghai
    2008 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY, VOLS 1 AND 2, PROCEEDINGS, 2008, : 841 - +
  • [43] An ID-based optimistic fair signature exchange protocol from pairings
    Gu, CX
    Zhu, YF
    Zhang, YJ
    COMPUTATIONAL INTELLIGENCE AND SECURITY, PT 2, PROCEEDINGS, 2005, 3802 : 9 - 16
  • [44] EAR Protocol-Towards Fair Optimistic Non-Repudiation Exchange
    WANG Hai-yan~1
    2.State Key Laboratory of Information Security
    TheJournalofChinaUniversitiesofPostsandTelecommunications, 2005, (02) : 59 - 63
  • [45] Efficient and secure protocol in fair document exchange
    Liang, Xiaohui
    Cao, Zhenfu
    Lu, Rongxing
    Qin, Liuquan
    COMPUTER STANDARDS & INTERFACES, 2008, 30 (03) : 167 - 176
  • [46] An efficient protocol for anonymous and fair document exchange
    Zhang, N
    Shi, Q
    Merabti, M
    COMPUTER NETWORKS, 2003, 41 (01) : 19 - 28
  • [47] Efficient intrusion-resilient signatures without random oracles
    Libert, Benoit
    Quisquater, Jean-Jacques
    Yung, Moti
    INFORMATION SECURITY AND CRYPTOLOGY, PROCEEDINGS, 2006, 4318 : 27 - +
  • [48] Optimistic fair exchange E-commerce protocol based on secret sharing
    Ma Changshe1
    2. School of Computer
    3. The State Key Lab of Information Security
    JournalofSystemsEngineeringandElectronics, 2006, (04) : 858 - 863
  • [49] An efficient designated verifier signature scheme without random oracles
    Zhang, Jianhong
    Ji, Cheng
    PROCEEDINGS OF THE FIRST INTERNATIONAL SYMPOSIUM ON DATA, PRIVACY, AND E-COMMERCE, 2007, : 338 - +
  • [50] Efficient identity-based signcryption without random oracles
    Lee, Peter Hyun-Jeen
    Parampalli, Udaya
    Narayan, Shivaramakrishnan
    Conferences in Research and Practice in Information Technology Series, 2012, 125 : 3 - 14