New Types of Verifiably Encrypted Signature Schemes

被引:2
|
作者
Kang, Baoyuan [1 ]
机构
[1] Tianjin Polytech Univ, Comp Sci & Software Inst, Tianjin 300387, Peoples R China
关键词
Fair Exchange; Cryptography; Signature; Verifiably Encrypted Signature; ID-based signature; HESSS SCHEME; AGGREGATE;
D O I
10.4028/www.scientific.net/AMR.490-495.914
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
A verifiably encrypted signature scheme involves a signer, a verifier, and an adjudicator. It can convince a verifier that a given ciphertext is an encryption of signature on a given message. At a later stage on agreed or in case of dispute, the adjudicator can extract and give the signer's signature to the verifier. In existing verifiably encrypted signatures, the adjudicator is assumed to be a trusted third party who will not conspire with either of the two parties involved. Obviously, this assumption is naive. In this paper, we propose two new types of verifiably encrypted signature schemes. They can resolve the problem that the adjudicator may collaborate with the verifier. We also analyze the security of the proposed schemes.
引用
收藏
页码:914 / 918
页数:5
相关论文
共 50 条
  • [31] Lattice-Based Encrypted Verifiably Encryption Signature Scheme for the Fair and Private Electronic Commence
    Wang, Fenghe
    Shi, Shaoquan
    [J]. IEEE ACCESS, 2019, 7 : 147481 - 147489
  • [32] Lattice-Based Verifiably Encrypted Signature Scheme without Gaussian Sampling for Privacy Protection in Blockchain
    Lu, Xiuhua
    Yin, Wei
    Zhang, Pingyuan
    [J]. SUSTAINABILITY, 2022, 14 (21)
  • [33] Efficient verifiably encrypted signatures from lattices
    Kim, Kee Sung
    Jeong, Ik Rae
    [J]. INTERNATIONAL JOURNAL OF INFORMATION SECURITY, 2014, 13 (04) : 305 - 314
  • [34] Efficient Verifiably Encrypted ECDSA Schemes From Castagnos-Laguillaumie and Joye-Libert Encryptions
    Yang, Xiao
    Zhang, Chengru
    Xue, Haiyang
    Au, Man Ho
    [J]. IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY, 2024, 19 : 4161 - 4173
  • [35] Verifiably Encrypted Signatures Without Random Oracles
    李祥学
    陈克非
    刘胜利
    李世群
    [J]. Journal of Shanghai Jiaotong University(Science), 2006, (02) : 230 - 235
  • [36] Efficient verifiably encrypted signatures from lattices
    Kee Sung Kim
    Ik Rae Jeong
    [J]. International Journal of Information Security, 2014, 13 : 305 - 314
  • [37] Verifiably Encrypted Signatures from RSA without NIZKs
    Rueckert, Markus
    [J]. PROGRESS IN CRYPTOLOGY - INDOCRYPT 2009, PROCEEDINGS, 2009, 5922 : 363 - 377
  • [38] Verifiably encrypted short signatures from bilinear maps
    Zuhua Shao
    [J]. annals of telecommunications - annales des télécommunications, 2012, 67 : 437 - 445
  • [39] Verifiably encrypted short signatures from bilinear maps
    Shao, Zuhua
    [J]. ANNALS OF TELECOMMUNICATIONS, 2012, 67 (9-10) : 437 - 445
  • [40] Aggregate and verifiably encrypted signatures from bilinear maps
    Boneh, D
    Gentry, C
    Lynn, B
    Shacham, H
    [J]. ADVANCES IN CRYPTOLOGY-EUROCRYPT 2003, 2003, 2656 : 416 - 432