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] Optimistic fair exchange in the enhanced chosen-key model
    Wang, Yang
    Au, Man Ho
    Susilo, Willy
    THEORETICAL COMPUTER SCIENCE, 2015, 562 : 57 - 74
  • [42] Optimistic Fair Exchange Using Trusted Devices
    Dashti, Mohammad Torabi
    STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, PROCEEDINGS, 2009, 5873 : 711 - 725
  • [43] Tight Proofs for Signature Schemes without Random Oracles
    Schaege, Sven
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2011, 2011, 6632 : 189 - 206
  • [44] Identity based signcryption scheme without random oracles
    Yu, Yong
    Yang, Bo
    Sun, Ying
    Zhu, Sheng-lin
    COMPUTER STANDARDS & INTERFACES, 2009, 31 (01) : 56 - 62
  • [45] Concurrent signature without random oracles
    Tan, Xiao
    Huang, Qiong
    Wong, Duncan S.
    THEORETICAL COMPUTER SCIENCE, 2015, 562 : 194 - 212
  • [46] AN EFFICIENT IDENTITY-BASED RING SIGNCRYPTION SCHEME WITHOUT RANDOM ORACLES
    Sun Hua
    Guo Li
    Wang Aimin
    FOURTH INTERNATIONAL CONFERENCE ON COMPUTER AND ELECTRICAL ENGINEERING (ICCEE 2011), 2011, : 673 - +
  • [47] ID-Based Ambiguous Optimistic Fair Exchange in the Standard Model
    Qi M.
    Chen M.
    Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2020, 48 (08): : 1516 - 1527
  • [48] A NEW CONSTRUCTION OF IDENTITY-BASED SIGNCRYPTION WITHOUT RANDOM ORACLES
    Fan, Jia
    Zheng, Yuliang
    Tang, Xiaohu
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2014, 25 (01) : 1 - 23
  • [49] A new signature scheme without random oracles from bilinear pairings
    Zhang, Fangguo
    Chen, Xiaofeng
    Susilo, Willy
    Mu, Yi
    PROGRESS IN CRYPTOLOGY - VIETCRYPT 2006, 2006, 4341 : 67 - 80
  • [50] New identity-based short signature without random oracles
    Zhang, Leyou
    Hu, Yupu
    Wu, Qing
    CEIS 2011, 2011, 15