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 条
  • [31] Space-efficient kleptography without random oracles
    Youngi, Adam L.
    Yung, Moti M.
    INFORMATION HIDING, 2007, 4567 : 112 - 129
  • [32] Efficient Signcryption Key Encapsulation without Random Oracles
    Li, Fagen
    Shirase, Masaaki
    Takagi, Tsuyoshi
    INFORMATION SECURITY AND CRYPTOLOGY, 2009, 5487 : 47 - +
  • [33] Efficient certificateless threshold signatures without random oracles
    Piyi Yang
    Zhenfu Cao
    Xiaolei Dong
    Journal of Systems Science and Complexity, 2010, 23 : 1167 - 1182
  • [34] An efficient group signature scheme without random oracles
    Wang Shaohui
    Wang Meiqin
    CIS WORKSHOPS 2007: INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY WORKSHOPS, 2007, : 807 - +
  • [35] EFFICIENT CERTIFICATELESS THRESHOLD SIGNATURES WITHOUT RANDOM ORACLES
    Yang, Piyi
    Cao, Zhenfu
    Dong, Xiaolei
    JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2010, 23 (06) : 1167 - 1182
  • [36] Usable optimistic fair exchange
    Kupcu, Alptekin
    Lysyanskaya, Anna
    COMPUTER NETWORKS, 2012, 56 (01) : 50 - 63
  • [37] Ambiguous Optimistic Fair Exchange
    Huang, Qiong
    Yang, Guomin
    Wong, Duncan S.
    Susilo, Willy
    ADVANCES IN CRYPTOLOGY - ASIACRYPT 2008, 2008, 5350 : 74 - 89
  • [38] Usable Optimistic Fair Exchange
    Kupcu, Alptekin
    Lysyanskaya, Anna
    TOPICS IN CRYPTOLOGY - CT-RSA 2010, PROCEEDINGS, 2010, 5985 : 252 - 267
  • [39] A practical strongly secure one-round authenticated key exchange protocol without random oracles
    Yang, Zheng
    Yang, Wu
    SECURITY AND COMMUNICATION NETWORKS, 2015, 8 (06) : 1118 - 1131
  • [40] Efficient ID-based Key Agreement Protocol under the DLDH Assumption Without Random Oracles
    Moriyama, Daisuke
    Doi, Hiroshi
    2008 INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY AND ITS APPLICATIONS, VOLS 1-3, 2008, : 330 - 335