可证安全的高效可托管公钥加密方案

doi:doi:10.3969/j.issn.1000-436x.2014.07.004

Journal on Communications ›› 2014, Vol. 35 ›› Issue (7): 33-37.doi: doi:10.3969/j.issn.1000-436x.2014.07.004

• paperⅠ:Cryptographic algorithms and security protocols • Previous Articles Next Articles

Provably secure and efficient escrowable public key encryption schemes

Wen-hao LIU¹,Sheng-bao WANG¹(),Zhen-fu CAO²,Li-dong HAN¹

¹ School of Information Science and Engineering,Hangzhou Normal University,Hangzhou 310012,China
² Department of Computer Science and Engineering,Shanghai Jiaotong University,Shanghai 200240,China

Online:2014-07-25 Published:2017-06-24
Supported by:
The National Natural Science Foundation of China;The National Natural Science Foundation of China;The Natural Science Foundation of Zhejiang Province;Education Department Foundation of Zhejiang Province;The Open Foundationa of State Key Laboratory of Networking and Switching Technology of China

Abstract

Abstract:

In an escrowable public key encryption (E-PKE) scheme, there are two keys associated with one public key. It can reduce the total number of certificates in the public key infrastructure (PKI) to a large extent, thus degrade the com-plexity of certificate management. Moreover, an E-PKE scheme can also reduce the key storage for end users. Two such schemes were proposed, with the second one being the most efficient one among all existing E-PKE schemes. It is also the first provably secure E-PKE scheme, whose security is based on the standard bilinear Diffie-Hellman (BDH) assump-tion.

Key words: cryptographic algorithm, encryption scheme, escrowable public key encryption, provable security

Wen-hao LIU,Sheng-bao WANG,Zhen-fu CAO,Li-dong HAN. Provably secure and efficient escrowable public key encryption schemes[J]. Journal on Communications, 2014, 35(7): 33-37.

Figures/Tables 1

References 9

[1]	ZIMMERMANN P . Pretty Good Privacy―Public Key Encryption for the Masses, PGP User's Guide[M]. Cambridge, MA: MIT Press, 1995.
[2]	SANTESSON S , POLK W , BARZIN P , et al. Internet X.509 Public Key Infrastructure, Qualified Certificates Profile, RFC 3039, IETF[S]. 2001.
[3]	VERHEUL E R . Evidence that XTR is more secure than supersingular elliptic curve crypto systems[A]. Proc of Eurocrypt'01[C]. Springer, 2001. 195-210.
[4]	BONEH D , FRANKLIN M . Identity-based encryption from the weil pairing[A]. Proc of CRYPTO'01[C]. Springer, 2001. 213-229.
[5]	BONEH D , FRANKLIN M . Identity-based encryption from the weil pairing[J]. SIAM J Computing, 2003,32(3):586-615.
[6]	ELGAMAL T . A public key cryptosystem and signature scheme based on discrete logarithms[J]. IEEE Trans Inf Theory, 1985,31(4):469-472.
[7]	FUJISAKI E , OKAMOTO T . How to enhance the security of pub-lic-key encryption at minimum cost[J]. IEICE Trans Fundamentals, 2000,9(1):24-32.
[8]	ZHANG F , SAFAVI-NAINI R , SUSILO W . An efficient signature scheme from bilinear pairings and its applications[A]. Proc of PKC'04[C]. Springer 2004. 277-290.
[9]	LYNN B . On the Implementation of Pairing-Based Cryptography[D]. Stanford University 2006.

Metrics

Recommended 0

No Suggested Reading articles found!

方案/比较项目	用户公钥	预先加密	在线双线性映射运算	可证安全
文献[4]中方案	xP	×	1	×
方案1	(x₁ P,x₂ P)	×	1	×
文献[3]中方案	e (P,P)^x	×	0	×
方案2	xP	√	0	√

[1]	Huanhuan LIAN, Huiying HOU, Yunlei ZHAO. Post-quantum verifier-based three-party password authenticated key exchange protocol [J]. Journal on Communications, 2022, 43(4): 95-106.
[2]	Zhen LIU,Yiliang HAN,Xiaoyuan YANG,Shuguang LIU. Provable security signcryption scheme based on RLWE without trapdoor [J]. Journal on Communications, 2020, 41(6): 14-25.
[3]	Changgen PENG, Xiaoyu ZHANG, Hongfa DING, Shanhui YANG. Efficient signcryption scheme based on Cocks’ identity cryptosystem [J]. Journal on Communications, 2020, 41(12): 128-138.
[4]	Youliang TIAN,Qiuxian LI,Duo ZHANG,Linjie WANG. Provably secure rational delegation computation protocol [J]. Journal on Communications, 2019, 40(7): 135-143.
[5]	Jinxia YU,Huanhuan LIAN,Yongli TANG,Mengyao SHI,Zongqu ZHAO. Password-based three-party authenticated key exchange protocol from lattices [J]. Journal on Communications, 2018, 39(11): 87-97.
[6]	Zhi-bo DU,UNYuan-hua S,ANGYi W. Multi-point joint power analysis attack against AES [J]. Journal on Communications, 2016, 37(Z1): 78-84.
[7]	Hao-xing LI,Feng-hua LI,Cheng-gen SONG,Ya-long YAN. Provable data possession scheme with authentication [J]. Journal on Communications, 2016, 37(10): 117-127.
[8]	. Analysis and improvement of an identity-based signcryption [J]. Journal on Communications, 2015, 36(11): 174-179.
[9]	. Fused access control scheme for sensitive data sharing [J]. Journal on Communications, 2014, 35(8): 10-77.
[10]	Xi-xi YAN,Tao GENG. Fused access control scheme for sensitive data sharing [J]. Journal on Communications, 2014, 35(8): 71-77.
[11]	Hai-ying MA,Guo-sun ZENG,GZhan-jun WAN,Wei WANG. Efficient and provably secure attribute-based online/offline encryption schemes [J]. Journal on Communications, 2014, 35(7): 104-112.
[12]	. Provably secure and efficient escrowable public key encryption schemes [J]. Journal on Communications, 2014, 35(7): 4-37.
[13]	. Forward-secure ciphertext-policy attribute-based encryption scheme [J]. Journal on Communications, 2014, 35(7): 5-45.
[14]	. Efficient and provably secure attribute-based online/ offline encryption schemes [J]. Journal on Communications, 2014, 35(7): 13-112.
[15]	EIJiang-hong W,IUWen-fen L,UXue-xian H. Forward-secure ciphertext-policy attribute-based encryption scheme [J]. Journal on Communications, 2014, 35(7): 38-45.

Provably secure and efficient escrowable public key encryption schemes

RichHTML

PDF

Knowledge

Abstract

Cite this article

share this article

Figures/Tables 1

References 9

Related Articles 15

Metrics

Recommended 0