An efficient non-interactive deniable authentication scheme based on trapdoor commitment schemes

被引:4
|
作者
Youn, Taek-Young [2 ]
Lee, Changhoon [3 ]
Park, Young-Ho [1 ]
机构
[1] Sejong Cyber Univ, Dept Informat Secur Syst, Seoul, South Korea
[2] Korea Univ, Grad Sch Informat Management & Secur, Seoul, South Korea
[3] Hanshin Univ, Sch Comp Engn, Osan, South Korea
关键词
Deniable authentication; Trapdoor commitment; Provable security; PROTOCOL; SECURITY;
D O I
10.1016/j.comcom.2010.03.028
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Deniable authentication scheme is one of useful tools for secure communications. The scheme allows a sender to prove the authenticity of a message to a specified receiver without permitting the receiver to prove that the message was authenticated by the sender. Non-interactive schemes are more attractive than interactive schemes in terms of communication overhead, and thus several non-interactive deniable authentication scheme have been proposed. In this paper, we propose an efficient non-interactive deniable authentication scheme based on trapdoor commitment scheme. We construct an efficient trapdoor commitment scheme which provides very efficient commitment evaluation operation. Then we design an efficient non-interactive deniable authentication scheme by using the trapdoor commitment scheme. We also prove the security of our scheme under firmly formalized security model. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码:353 / 357
页数:5
相关论文
共 50 条
  • [31] A characterization of non-interactive instance-dependent commitment-schemes (NIC)
    Kapron, Bruce
    Malka, Lior
    Srinivasan, Venkatesh
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2007, 4596 : 328 - +
  • [32] Efficient deniable authentication protocol based on generalized ElGamal signature scheme
    Shao, ZH
    [J]. COMPUTER STANDARDS & INTERFACES, 2004, 26 (05) : 449 - 454
  • [33] Non-interactive deniable ring signature without random oracles
    Zeng, Shengke
    Li, Qinyi
    Qin, Zhiguang
    Lu, Qing
    [J]. SECURITY AND COMMUNICATION NETWORKS, 2016, 9 (12) : 1810 - 1819
  • [34] An Efficient Adaptive-Deniable-Concurrent Non-malleable Commitment Scheme
    Arita, Seiko
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2011, E94A (01) : 367 - 382
  • [35] Lattice-Based Logarithmic-Size Non-Interactive Deniable Ring Signatures
    Jia, Huiwen
    Tang, Chunming
    Zhang, Yanhua
    [J]. ENTROPY, 2021, 23 (08)
  • [36] A discrete-logarithm based non-interactive non-malleable commitment scheme with an online knowledge extractor
    Ding, Ning
    Gu, Dawu
    [J]. INFORMATION SECURITY AND CRYPTOLOGY, 2008, 4990 : 153 - 166
  • [37] Non-interactive and Non-malleable Commitment Scheme Based on q-one Way Group Homomorphisms
    张宗洋
    董晓蕾
    曹珍富
    [J]. Journal of Shanghai Jiaotong University(Science), 2008, (05) : 574 - 578
  • [38] Non-interactive and non-malleable commitment scheme based on q-one way group homomorphisms
    Zhang Z.-Y.
    Dong X.-L.
    Cao Z.-F.
    [J]. Journal of Shanghai Jiaotong University (Science), 2008, 13 (5) : 574 - 578
  • [39] A secure non-interactive deniable authentication protocol with strong deniability based on discrete logarithm problem and its application on internet voting protocol
    Meng, Bo
    [J]. Information Technology Journal, 2009, 8 (03) : 302 - 309
  • [40] An optimal non-interactive message authentication protocol
    Pasini, S
    Vaudenay, S
    [J]. TOPICS IN CRYPTOLOGY - CT-RSA 2006, PROCEEDINGS, 2006, 3860 : 280 - 294