多接收者环境下的匿名性和密文长度缩短的匿名广播加密算法

doi:10.7523/j.issn.2095-6134.2010.1.013

中国科学院大学学报 ›› 2010, Vol. 27 ›› Issue (1): 90-106.DOI: 10.7523/j.issn.2095-6134.2010.1.013

多接收者环境下的匿名性和密文长度缩短的匿名广播加密算法

张海滨^1,2, 武传坤, 魏凌波^1,2

1. 中国科学院软件所信息安全国家重点实验室, 北京 100190;
2. 中国科学院研究生院, 北京 100190

收稿日期:2009-03-02 修回日期:2009-04-27 发布日期:2010-01-15
通讯作者: 张海滨
基金资助:
supported by the National Grand Fundamental Research 973 Program of China(2007CB807902) and the National High-Tech Research and Development Plan of China(2006AA01Z423) 

Key privacy in multi-recipient setting and shortened private broadcast encryption

ZHANG Hai-Bin^1,2, WU Chuan-Kun, WEI Ling-Bo^1,2

1. State Key Laboratory of Information Security,Institute of Software of the Chinese Academy of Sciences,Beijing 100190,China;
2. Graduate University of the Chinese Academy of Sciences, Beijing 100190, China

Received:2009-03-02 Revised:2009-04-27 Published:2010-01-15
Supported by:
supported by the National Grand Fundamental Research 973 Program of China(2007CB807902) and the National High-Tech Research and Development Plan of China(2006AA01Z423) 

摘要/Abstract

摘要：

形式化构建了在多用户环境和随机数复用多用户环境下的匿名性安全模型,并证明了其安全性;同时提出了2种针对匿名性的可复制测试.基于这些结果,构造了一个通用的密文长度缩短的匿名广播加密算法.

关键词: 匿名性, 随机数, 多接受者, 广播加密, 匿名广播加密

Abstract:

In this paper, we formally built the security models on key privacy in the multi-recipient and randomness re-using multi-recipient setting and proved their security. Two associated reproducibility tests concerning key privacy were proposed. Based on these results, we constructed a general shortened private broadcast encryption scheme which approximately halves ciphertext overhead and computational cost.

Key words: key privacy, randomness, multi-recipient, broadcast encryption, private broadcast encryption

中图分类号:

TP309

张海滨, 武传坤, 魏凌波. 多接收者环境下的匿名性和密文长度缩短的匿名广播加密算法[J]. 中国科学院大学学报, 2010, 27(1): 90-106.

ZHANG Hai-Bin, WU Chuan-Kun, WEI Ling-Bo. Key privacy in multi-recipient setting and shortened private broadcast encryption[J]. , 2010, 27(1): 90-106.

参考文献

[1] Naor M,Yung M. Public-key cryptosystems provably secure against chosen ciphertext attacks //22nd Annual ACM Symposium on Theory of Computing.1990:427- 437.

[2] Rackoff C,Simon D. Noninteractive zero-knowledge proof of knowledge and chosen ciphertext attack //Advances in Cryptology Crypto 91. 1991:433- 444.

[3] Dolev D, Dwork C, Naor M. Non-malleable cryptography //23rd Annual ACM Symposium on Theory of Computing.1991:542-552. Extended version: Dolev D, Dwork C, Naor M. Non-malleable cryptography
[J]. SIAM J Computing, 2000,30(2):391-437.

[4] Bellare M, Boldyreva A, Desai A,et al. Key-privacy in public-key encryption //Asiacrypt.2001.

[5] Baudron O, Pointcheval D,Stern J. Extended notions of security for multicast public key cryptosystems //ICALP 2000.

[6] Bellare M,Boldyreva A,Micali S. Public-key encryption in a multi-user setting: security proofs and improvements //Eurocrypt 2000.

[7] Kurosawa K. Multi-recipient public-key encryption with shortened ciphertext //Proceedings of the Fifth International Workshop on Practice and Theory in Public Key Cryptography(PKCO2). 2002.

[8] ElGamal T. A public key cryptosystem and a signature scheme based on discrete logarithms
[J]. IEEE Transactions on Information Theory,1985,31(4):469- 472.

[9] Cramer R,Shoup V. A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack //Advances in Cryptology Crypto ' 98. 1998:13-25.

[10] Bellare M, Boldyreva A,Staddon J. Randomness reuse in multi-recipient encryption schemes //Desmedt Y, ed.Proceedings of Public Key Cryptography PKC 2003. LNCS 2567, Springer-Verlag, 2003.

[11] Smart N. Efficient key encapsulation to multiple parties //Security in Communication Networks (SCN 2004).Springer LNCS 3352,2005:208-219.

[12] Cramer R and Shoup V. Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack
[J]. SIAM Journal on Computing, 2003,33(1):167-226.

[13] Shoup V. Using hash functions as a hedge against chosen ciphertext attack //Advances in Cryptology Eurocrypt 2000.2000:275- 288.

[14] Barth A, Boneh D, Waters B. Private encrypted content distribution using private broadcast encryption //Proceedings of Financial Crypto(FC)06. LNCS 4107, 2006:52- 64.

[15] Fiat A, Naor M. Broadcast encryption //Proceedings of Crypto 93. LNCS 773,Springer-Verlag, 1993:480C４９１.

[16] Dodis Y, Fazio N. Public key broadcast encryption secure against adaptive chosen ciphertext attack //Workshop on Public Key Cryptography (PKC).2003.

[17] Dan Boneh, Craig Gentry, Brent Waters. Collusion resistant broadcast encryption with short ciphertexts and private keys // CRYPTO 2005.2005:258-275.

[18] Delerable C,Pascal Paillier, David Pointcheval. Fully collusion secure dynamic broadcast encryption with constant-size ciphertexts or decryption keys //Pairing 2007. 2007:39-59.

[19] Naor D, Naor M, Lotspiech J. Revocation and tracing schemes for stateless receivers //Proceedings of Crypto 01. LNCS 2139, 2001:41- 62.

[20] Halevy D, Shamir A. The lsd broadcast encryption scheme //Proceedings of Crypto 02. LNCS 2442, 2002:47- 60.

[21] Goodrich M T,Sun J Z,Tamassia R. Efficient tree-based revocation in groups of low-state devices //Proceedings of Crypto 04. LNCS 2204,2004.

[22] Chor B, Fiat A, Naor M. Tracing traitors //Proceedings of Crypto 94. LNCS 839, 1994:257- 270.

多接收者环境下的匿名性和密文长度缩短的匿名广播加密算法

Key privacy in multi-recipient setting and shortened private broadcast encryption

PDF (PC)

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 6

编辑推荐

Metrics

本文评价

访问统计

联系我们

[1]	刘攀, 陈天宇, 吕娜, 马原, 荆继武. 一种带有熵监控功能的软件随机数发生器[J]. 中国科学院大学学报, 2020, 37(6): 835-847.
[2]	贾世杰, 夏鲁宁, 闻楠. 基于Nand Flash物理特性的签名私钥产生方法及其应用[J]. 中国科学院大学学报, 2015, 32(5): 695-700.
[3]	朱珍超，张玉清，王凤娇. 一个具有强安全性的多接收者签密方案[J]. 中国科学院大学学报, 2008, 25(3): 395-402.
[4]	毕玉, 高虎明. 一个可计息的离线电子现金方案[J]. 中国科学院大学学报, 2006, 23(6): 802-807.
[5]	张鹏程, 武传坤. 对可撤销匿名性的盲代理签名方案的分析[J]. 中国科学院大学学报, 2006, 23(6): 833-836.
[6]	张键红, 王育民. 一种淘汰式无拍卖行的电子拍卖[J]. 中国科学院大学学报, 2003, 20(3): 358-362.