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 条
  • [21] Usable optimistic fair exchange
    Kupcu, Alptekin
    Lysyanskaya, Anna
    COMPUTER NETWORKS, 2012, 56 (01) : 50 - 63
  • [22] A New Construction of Designated Confirmer Signature and Its Application to Optimistic Fair Exchange (Extended Abstract)
    Huang, Qiong
    Wong, Duncan S.
    Susilo, Willy
    PAIRING-BASED CRYPTOGRAPHY-PAIRING 2010, 2010, 6487 : 41 - +
  • [23] Usable Optimistic Fair Exchange
    Kupcu, Alptekin
    Lysyanskaya, Anna
    TOPICS IN CRYPTOLOGY - CT-RSA 2010, PROCEEDINGS, 2010, 5985 : 252 - 267
  • [24] New Constructions of Equality Test Scheme Without Random Oracles
    Zhu, Huijun
    Ahmad, Haseeb
    Xue, Qingji
    Li, Tianfeng
    Liu, Ziyu
    Liu, Ao
    IEEE ACCESS, 2023, 11 (49519-49529) : 49519 - 49529
  • [25] Collusion-Resistance in Optimistic Fair Exchange
    Wang, Yang
    Susilo, Willy
    Au, Man Ho
    Wang, Guilin
    IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2014, 9 (08) : 1227 - 1239
  • [26] Signcryption from NTRU Lattices Without Random Oracles
    Liu, Zi-Yuan
    Tso, Raylin
    Tseng, Yi-Fan
    Mambo, Masahiro
    2019 14TH ASIA JOINT CONFERENCE ON INFORMATION SECURITY (ASIAJCIS 2019), 2019, : 134 - 141
  • [27] 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
  • [28] ID-Based Optimistic Fair Exchange Scheme Based on RSA
    Youn, Taek-Young
    Chang, Ku-Young
    ETRI JOURNAL, 2014, 36 (04) : 672 - 680
  • [29] Efficient intrusion-resilient signatures without random oracles
    Libert, Benoit
    Quisquater, Jean-Jacques
    Yung, Moti
    INFORMATION SECURITY AND CRYPTOLOGY, PROCEEDINGS, 2006, 4318 : 27 - +
  • [30] Efficient identity-based encryption without random oracles
    Waters, B
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2005,PROCEEDINGS, 2005, 3494 : 114 - 127