New Types of Verifiably Encrypted Signature Schemes

Abstract:

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.

• Periodical: Advanced Materials Research (Volumes 490-495)
• Pages: 914-918
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.490-495.914
• Online since: March 2012
• Authors: Bao Yuan Kang
• Keywords: Cryptography, Fair Exchange, ID-Based Signature, Signature, Verifiably Encrypted Signature

References

[1] N. Asokan, V. Shoup and M. Waidner. Optimistic fair exchange of digital signature(extended abstract). In: Advances in Cryptology-eurocrypt'98, Lecture Notes in Computer Science, vol. 1403. Berlin: Springer; 1998. pp.591-606.

DOI: 10.1007/bfb0054156

[2] G. Ateniese. Verifiable encryption of digital signature and applications. ACM Transactions on Information and System Security 2004; 7(1): 1-20.

DOI: 10.1145/984334.984335

[3] D. Boneh, C. Gentry, B. Lynn, H. Shacham. Aggregate and verifiably encrypted signatures from bilinear maps. In: Advances in Cryptologyeurocrypt' 03, Lecture Notes in Computer Science, vol. 2656. Berlin: Springer; 2003. pp.416-432.

DOI: 10.1007/3-540-39200-9_26

[4] J. Camenisch, V. Shoup. Practical verifiable encryption and decryption of discrete logarithms. In: CRYPTO 2003, Lecture Notes in Computer Science, vol. 2729. Berlin: Springer; 2003. pp.126-144.

DOI: 10.1007/978-3-540-45146-4_8

[5] X. Cheng, J. Liu, X. Wang. Identity-based aggregate and verifiably encrypted signatures from bilinear pairing. In: ICCSA 2005, Lecture Notes in Computer Science, vol. 3483. Berlin: Springer; 2005. pp.1046-1054.

DOI: 10.1007/11424925_109

[6] M. Choudary Gorantla, A. Saxena. Verifiably encrypted signature without random oracles. In: ICDCIT 2005, Lecture Notes in Computer Science, vol. 3816. Berlin: Springer; 2005. pp.357-363.

DOI: 10.1007/11604655_41

[7] C. Gu, Y. Zhu. An ID-based verifiable encrypted signature scheme based on Hess's scheme. In: CISC 2005, Lecture Notes in Computer Science, vol. 3822. Berlin: Springer; 2005. pp.42-52.

DOI: 10.1007/11599548_4

[8] F. Zhang, R. Safavi-Naini, W. Susilo. Efficient verifiably encrypted signature and partially blind signature from bilinear pairings. In: Progress in cryptology-indocrypt'03, Lecture Notes in Computer Science, vol. 2904. Berlin: Springer; 2003. pp.191-204.

DOI: 10.1007/978-3-540-24582-7_14

[9] S. Kwon, S. Lee. An efficient id-based verifiable encrypted signature scheme based on Hess's scheme. In: ISPEC 2007, Lecture Notes in Computer Science, vol. 4464. Berlin: Springer; 2007. pp.93-104.

DOI: 10.1007/978-3-540-72163-5_9

[10] J. Zhang, C. Liu, Y. Yang. An efficient secure proxy verifiably encrypted signature scheme. Journal of Network and Computer Applications 33(2010) 29-34.

DOI: 10.1016/j.jnca.2009.07.003

[11] Z. Huang, K. Chen, Y. wang. Efficient identity-based signatures and blind signatures. In: CANS 2005, Lecture Notes in Computer Science, vol. 3810. Berlin: Springer; 2005. pp.120-133.

DOI: 10.1007/11599371_11