Heterogeneous Signcryption with Key Privacy

被引:54
作者
Huang, Qiong [1 ]
Wong, Duncan S. [1 ]
Yang, Guomin [2 ]
机构
[1] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Hong Kong, Peoples R China
[2] Natl Univ Singapore, Temasek Labs, Singapore 117548, Singapore
关键词
signcryption; key privacy; ciphertext anonymity; identity-based cryptography; IDENTITY-BASED ENCRYPTION; EFFICIENT SIGNCRYPTION; SECURITY; SIGNATURE; AUTHENTICATION; PROTOCOLS; SCHEME; PROOFS;
D O I
10.1093/comjnl/bxq095
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A signcryption scheme allows a sender to produce a ciphertext for a receiver so that both confidentiality and non-repudiation can be ensured. It is built to be more efficient and secure, for example, supporting insider security, when compared with the conventional sign-then-encrypt approach. In this paper, we propose a new notion called heterogeneous signcryption in which the sender has an identity-based secret key while the receiver is holding a certificate-based public key pair. Heterogeneous signcryption is suitable for practical scenarios where an identity-based user, who does not have a personal certificate or a public key, wants to communicate securely with a server which has a certificate with its public key. We propose two constructions and show their security under the model we define in the random oracle model. The model we define captures the insider security for both confidentiality and unforgeability. Both of the schemes also support public verifiability and key privacy, that is, an adversary cannot find out who the sender and receiver are from a ciphertext in the insider security model. The second scheme is the most efficient one computationally among all key-privacy-preserving signcryption schemes even when compared with schemes in an identity-based cryptographic setting or certificate-based public key setting.
引用
收藏
页码:525 / 536
页数:12
相关论文
共 41 条
[1]  
An JH, 2002, LECT NOTES COMPUT SC, V2332, P83
[2]  
[Anonymous], PAIR BAS CRYPT LIB
[3]  
[Anonymous], LNCS
[4]  
[Anonymous], MULT INT RAT AR C C
[5]  
[Anonymous], 1993, ACM CCS 1993, DOI DOI 10.1145/168588.168596
[6]  
[Anonymous], LNCS
[7]  
[Anonymous], 1998, LECT NOTES COMPUTER
[8]  
[Anonymous], 5408 IETF RFC
[9]  
[Anonymous], 2006, P 13 ACM C COMP COMM, DOI DOI 10.1145/1180405.1180453
[10]   Formal proofs for the security of signcryption [J].
Baek, Joonsang ;
Steinfeld, Ron ;
Zheng, Yuliang .
JOURNAL OF CRYPTOLOGY, 2007, 20 (02) :203-235