Deterministic Public Key Encryption Scheme  Under Auxiliary Input Environment

doi:10.3969/j.issn.1000-3428.2013.10.024

Abstract

Abstract: It is not easy to construct a secure Deterministic Public Key Encryption(DPKE) schemes under Auxiliary Input(AI) environment. Aiming at this problem, based on a new intractable problem named d-decisional Diffie-Hellman(d-DDH) problem introduced recently, a new DPKE scheme under AI environment is proposed in this paper. The scheme is proved to have privacy strong indistinguish- able security in the standard model under the d-DDH assumption. Some methods and theories such as matrix encryption, matrix d-DDH, and Goldreich-Levin theorem for finite fields are used in the construction and security proof of the scheme. The d-DDH problem on which the scheme is based is more intractable than decisional Diffie-Hellman Problem(DDHP). Moreover, it can select different d for different security demand of applications.

Key words: deterministic public key encryption, Auxiliary Input(AI), strong indistinguishable privacy security, provable security, d-Decisional Diffie-Hellman(d-DDH) problem

摘要： 针对辅助输入环境下确定性公钥加密方案较难构造的问题，基于d-判定性Diffie-Hellman(d-DDH)问题，应用矩阵加密、矩阵d-DDH以及有限域上的Goldreich-Levin定理，构造一个辅助输入环境下的确定性公钥加密方案，并在标准模型下证明该方案具有强不可区分私密安全性。该方案所基于的d-DDH问题比判定性Diffie-Hellman问题更难，且可以根据应用需要选择不同d值，提供不同的安全级别。

关键词: 确定性公钥加密, 辅助输入, 强不可区分私密安全性, 可证安全, d-判定性Diffie-Hellman问题

CLC Number:

TP309.2

WANG Ze-cheng, WANG Xiu. Deterministic Public Key Encryption Scheme Under Auxiliary Input Environment[J]. Computer Engineering, doi: 10.3969/j.issn.1000-3428.2013.10.024.

王泽成，汪秀. 辅助输入环境下的确定性公钥加密方案[J]. 计算机工程, doi: 10.3969/j.issn.1000-3428.2013.10.024.

/ / Recommend / Download Citations

URL: http://www.ecice06.com/EN/10.3969/j.issn.1000-3428.2013.10.024

http://www.ecice06.com/EN/Y2013/V39/I10/116

References

参考文献 [1] Bellare M, Boldyreva A, O’Neill A. Deterministic and Effic- iently Searchable Encryption[C]//Proceedings of Crypto’07. Santa Barbara, USA: Springer, 2007: 535-552. [2] Goldwasser S, Micali S. Probabilistic Encryption[J]. Journal of Computer and System Sciences, 1984, 28(2): 270-299. (下转第122页) (上接第119页) [3] Bellare M, Fischlin M, O’Neill A, et al. Deterministic Encryp- tion: Definitional Equivalences and Constructions Without Random Oracles[C]//Proceedings of Crypto’08. Santa Barbara, USA: Springer, 2008: 360-378. [4] Boldyreva A, Fehr S, O’Neill A. On Notions of Security for Deterministic Encryption and Efficient Constructions Without Random Oracles[C]//Proceedings of Crypto’08. Santa Barbara, USA: Springer, 2008: 335-359. [5] Fuller B, O’Neill A, Reyzin L. A Unified Approach to Deter- ministic Encryption: New Constructions and a Connection to Computational Entropy[C]//Proceedings of TCC’12. Taormina, Italy: Springer, 2012: 582-599. [6] Mironov I, Pandey O, Reingold O, et al. Incremental Deter- ministic Public-key Encryption[C]//Proceedings of Eurocrypt’12. Cambridge, UK: Springer, 2012: 628-644. [7] 陈浩, 朱艳琴, 罗喜召. 改进的抗自适应泄漏公钥加密方案[J]. 计算机工程, 2012, 38(15): 108-110. [8] 张明武, 杨波, Tsuyoshi T. 抗主密钥泄露和连续泄露的双态仿射函数加密[J]. 计算机学报, 2012, 35(9): 1856-1867. [9] Brakerski Z, Segev G. Better Security for Deterministic Public-key Encryption: The Auxiliary-input Setting[C]// Proceedings of Crypto’11. Santa Barbara, USA: Springer, 2011: 543-560. [10] Wee H. Dual Projective Hashing and Its Applications——Lossy Trapdoor Functions and More[C]//Proceedings of Eurocrypt’12. Cambridge, UK: Springer, 2012: 246-262. [11] Cramer R, Damgard I, Kiltz E, et al. DDH-like Assumptions Based on Extension Rings[C]//Proceedings of PKC’12. Darmstadt, Germany: Springer, 2012: 644-661. [12] Boneh D, Halevi S, Hamburg M, et al. Circular-secure Encryption from Decision Diffie-Hellman[C]//Proceedings of Crypto’08. Santa Barbara, USA: Springer, 2008: 108-125. [13] Dodis Y, Goldwasser S, Kalai Y T, et al. Public Key Encry- ption Schemes with Auxiliary Inputs[C]//Proceedings of TCC’10. Zurich, Switzerland: Springer, 2010: 361-381. 编辑金胡考

[1]	LI Qiuxian, ZHOU Quanxing, WANG Zhenlong, DING Hongfa, PAN Qixin. Provable Secure Delegation Computing Protocol Based on Privacy Protection [J]. Computer Engineering, 2021, 47(5): 131-137.
[2]	YANG Xiaodong, PEI Xizhen, AN Faying, LI Ting, WANG Caifen. Message Authentication Scheme for Vehicular Ad Hoc Network Using Identity-based Aggregate Signature [J]. Computer Engineering, 2020, 46(2): 170-174,182.
[3]	YANG Xiaodong,XIAO Likun,LI Yutong,CHEN Chunlin,WANG Caifen. Security Analysis of An Efficient Identity-Based Signature Scheme [J]. Computer Engineering, 2018, 44(11): 115-118.
[4]	WEI Lihao,AI Jieqing,LIU Shenghan. Efficient Identity-based Encryption Scheme over Ideal Lattice [J]. Computer Engineering, 2016, 42(7): 134-138.
[5]	DU Ruiying,ZHOU Zhenyu,Milan Heinayati. Non-interactive Key Exchange Protocol for Space DTN [J]. Computer Engineering, 2016, 42(4): 137-142.
[6]	LIU Xiaoqian,ZHAO Yiming. Variant Scheme of Ring Signature Based on Multivariate Public Key Cryptosystems [J]. Computer Engineering, 2015, 41(2): 96-99.
[7]	MOU Yanfei,ZHAO Yiming. A Lattice-based Provable Secure Digital Signature Scheme [J]. Computer Engineering, 2014, 40(12): 94-96,103.
[8]	YANG Xiaodong,LI Chunmei,ZHOU Si’an,WANG Caifen. A Strongly Unforgeable Proxy Re-signature Scheme [J]. Computer Engineering, 2014, 40(11): 130-134.
[9]	TANG Zuo-Bei, JIU Xiang-Hua. An Improved Three-party Authenticated Key Agreement Protocol [J]. Computer Engineering, 2013, 39(6): 174-176,180.
[10]	DENG Jiang-Dong, WANG Li-Bin. Security Proof for Rhee Protocol [J]. Computer Engineering, 2012, 38(5): 155-157.
[11]	JU Mei, TUN Hong-Wei, ZHOU Jun, LI Xiao-Chao, GUO Dong-Hui. Security Analysis of Key Derivation Function in Office Authentication Mechanism [J]. Computer Engineering, 2012, 38(08): 101-104.
[12]	MA Chang-She. Ordered Digital Multi-Signature Scheme in Plain Public Key Model [J]. Computer Engineering, 2011, 37(9): 19-21.
[13]	ZHANG Zhi-jun; GUO Yuan-bo; LIU Wei; LV Jin-na. Group Key Agreement Protocol Based on m-tree and DH Protocol [J]. Computer Engineering, 2010, 36(1): 161-163,.
[14]	HUANG Meng-qiao; LI Qing-guo; MA Chang-she. Verifiable Signcryption Scheme Based on Bilinear Pairs [J]. Computer Engineering, 2010, 36(1): 139-142.
[15]	LIU Feng; HU Yang-yang. Multi-message and Short Signature Scheme Based on Bilinear Pairing [J]. Computer Engineering, 2010, 36(06): 137-139.

Please choose a citation manager

Content to export