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] A Survey on Optimistic Fair Exchange Protocol and Its Variants
    Loh, Jia-Ch'ng
    Heng, Swee-Huay
    Tan, Syh-Yuan
    2017 5TH INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGY (ICOIC7), 2017,
  • [22] AN OPTIMISTIC FAIR EXCHANGE PROTOCOL BASED ON COMMITTED SIGNATURE
    Chen, Guanghui
    Qing, Sihan
    Qi, Zhifeng
    Yang, Yixian
    2009 GLOBAL MOBILE CONGRESS, 2009, : 174 - +
  • [23] An optimistic fair exchange protocol based on signature policies
    Hernandez-Ardieta, Jorge L.
    Gonzalez-Tablas, Ana I.
    Alvarez, Benjamin Ramos
    COMPUTERS & SECURITY, 2008, 27 (7-8) : 309 - 322
  • [24] A Traceable Optimistic Fair Exchange Protocol in the Standard Model
    Ganjavi, Ramin
    Asaar, Maryam Rajabzadeh
    Salmasizadeh, Mahmoud
    ISECURE-ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY, 2015, 7 (01): : 3 - 14
  • [25] A Generic Framework for Accountable Optimistic Fair Exchange Protocol
    Loh, Jia-Ch'ng
    Heng, Swee-Huay
    Tan, Syh-Yuan
    INFORMATION SECURITY PRACTICE AND EXPERIENCE (ISPEC 2018), 2018, 11125 : 299 - 309
  • [26] A Generic Framework for Accountable Optimistic Fair Exchange Protocol
    Loh, Jia-Ch'ng
    Heng, Swee-Huay
    Tan, Syh-Yuan
    SYMMETRY-BASEL, 2019, 11 (02):
  • [27] Efficient Sanitizable Signatures Without Random Oracles
    Lai, Russell W. F.
    Zhang, Tao
    Chow, Sherman S. M.
    Schroeder, Dominique
    COMPUTER SECURITY - ESORICS 2016, PT I, 2016, 9878 : 363 - 380
  • [28] Efficient blind signatures without random oracles
    Camenisch, J
    Koprowski, M
    Warinschi, B
    SECURITY IN COMMUNICATION NETWORKS, 2005, 3352 : 134 - 148
  • [29] Efficient ring signatures without random oracles
    Shacham, Hovav
    Waters, Brent
    PUBLIC KEY CRYPTOGRAPHY - PKC 2007, 2007, 4450 : 166 - +
  • [30] A New Method for Formalizing Optimistic Fair Exchange Protocols
    Chen, Ming
    Wu, Kaigui
    Xu, Jie
    He, Pan
    INFORMATION AND COMMUNICATIONS SECURITY, 2010, 6476 : 251 - 265