加密 |n|+k bit明文的高效公钥概率加密体制

姜正涛; 刘建伟; 秦波; 王育民

加密 |n|+k bit明文的高效公钥概率加密体制

1.
北京航空航天大学计算机学院, 北京 100083
2. 北京航空航天大学电子信息工程学院, 北京 100083
3. 西安电子科技大学综合业务网国家重点实验室, 西安 710071

基金项目: 中国博士后科学基金资助项目(20060400035); 国家自然科学基金资助项目(60672102,60473027); 国家863课题资助项目(2006AA012422)

详细信息

作者简介:
姜正涛(1976-),男,山东青岛人,博士后,z.t.jiang@163.com.

中图分类号: TP 309⁺.7
计量
- 文章访问数: 3124
- HTML全文浏览量: 246
- PDF下载量: 1081
- 被引次数: 0
出版历程
- 收稿日期: 2007-01-15
- 网络出版日期: 2008-01-31

Efficient probabilistic public-key encryption schemes with | n|+k bit plaintexts

1.
School of Computer Science and Technology, Beijing University of Aeronautics and Astronautics, Beijing 100083, China
2. School of Electronics and Information Engineering, Beijing University of Aeronautics and Astronautics, Beijing 100083, China
3. National Key Laboratory of Integrated Service Networks, Xidian University, Xi-an 710071,China

摘要

摘要: 基于二次剩余和高次剩余的困难问题,通过选择适当的参数,在不增加密文长度的情况下, 对Paillier和Pointcheval提出的公钥概率加密体制的效率和加密的明文长度进行改进,能以更高的效率加密|n|+k bit长度的明文消息,并分析了改进后加密体制的效率和安全性,改进加密体制的安全性与原加密体制的安全性、模n的高次剩余问题以及二次剩余问题等价.与原Paillier-Pointcheval加密体制相比,改进的加密体制具有加、解密效率高,传输数据量低,加密明文长等特点.
- Paillier-Pointcheval加密体制 /
- 剩余问题 /
- 安全性分析 /
- 单向性 /
- 语意安全性
Abstract: Based on the intractable problems of n th residuosity and quadratic residuosity, by choosing proper parameters and without increasing the length of ciphertexts, the efficiency and the size of plaintexts of a probabilistic public-key encryption scheme proposed by Paillier and Pointcheval were improved. The improved encryption scheme can encrypt |n|+k bit messages with higher efficiency. Security and efficiency analysis of the improved encryption scheme were also provided, and the security of the improved scheme is equivalent to that of the original encryption scheme, the higher residuosity problem and quadratic residuosity problem modulo n . Compared to the original Paillier-Pointcheval encryption scheme, the improved encryption scheme has features of higher efficiency, lower traffic date and larger size of plaintexts.
- Paillier-Pointcheval encryption scheme /
- residuosity problem /
- security analysis /
- one wayness /
- semantic security

HTML全文

参考文献(1)

[1] Diffie W, Hellman M E. New directions in cryptography[J]. IEEE Transaction of Information Theory, 1976, 22(6): 644-654 [2] Rivest R, Shamir A, Adleman L. A method for obtaining digital signatures and public-key cryptosystems[J]. Communications ACM, 1978, 21(2): 120-126 [3] Paillier P, Pointcheval D. Efficient public-key cryptosystem provably secure against active adversaries Lam KY, Okamoto E. Theory and Applications of Cryptology and Information Security. London: Springer-Verlag Press, 1999: 163-179 [4] Paillier P. Public-key cryptosystems based on composite degree residuosity classes Stern J. Advances in Cryptoology-EUROCRYPT-99. Berlin: Springer-Verlag Press, 1999: 223-238 [5] Sakurai K, Takagi T. New semantically secure public-key cryptosystems from the RSA-primitive NaccacheD, Paillier P. Practice and Theory in Public Key Cryptosystems. Paris: Springer-Verlag Press, 2002: 1-16 [6] Cramer R, Shoup V. Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption Knudsen L R. Advances in Cryptoology-EUROCRYPTO-02. Berlin: Springer-Verlag, 2002: 45-94 [7] David G, Mart n S, Morillo P, et al. A practical public key cryptosystemfrom paillier and rabin schemes Desmedt Y. International Workshop on Theory and Practice in Public Key Cryptography. Miami: Springer,2003: 279-291 [8] Onodera T, Tanaka K E. Shufle for paillier-s encryption scheme[J]. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2005, E88-A(5): 1241-1248 [9] Catalano D, Gennaro R, Graham N H, et al. The bit security of paillier-s encryption scheme and its application Pfitzmann B. Advances in Cryptoology-Eurocrypto-01. Berlin: Springer-Verlag, 2001: 229-243 [10] Jiang Z T, Sun X, Wang Y M. Security analysis and improvement of a double-trapdoor encryption scheme[J]. Applied Mathematics and Computation, 2005, 169(1): 41-50

施引文献

资源附件(0)

访问统计