[1] Camenisch J, Lysyanskaya A. An Efficient System for Non- transferable Anonymous Credentials with Optional Anonymity Revocation[C]//Proc. of EUROCRYPT’01. Innsbruck, Austria: [s. n.], 2001.
[2] Black J, Rogaway P, Shrimpton T. Encryption-scheme Security in the Presence of Key-dependent Messages[C]//Proc. of SAC’02. Newfoundland, Canada: [s. n.], 2002.
[3] Boneh D, Halevi S, Hamburg M, et al. Circular-secure Encryp- tion from Decision Diffie-Hellman[C]//Proc. of CRYPTO’08. Santa Barbara, USA: [s. n.], 2008.
[4] Abadi M, Rogaway P. Reconciling Two Views of Cryptography (the Computational Soundness of Formal Encryption)[J]. Journal of Cryptology, 2002, 15(2): 103-127.
[5] Gentry C. Full Homomorphic Encryption Using Ideal Lattices[C]// Proc. of the 41st Annual ACM Symposium on Theory of Computing. Bethesda, USA: [s. n.], 2009.
[6] Brakerski Z, Goldwasser S, Kalai Y. Black-box Circular-secure Encryption Beyond Affine Functions[C]//Proc. of TCC’11. Rhode Island, USA: [s. n.], 2011.
[7] Barak B, Haitner I, Hofheinz D, et al. Bounded Key-dependent Message Security[C]//Proc. of EUROCRYPT’10. Nice, French: [s. n.], 2010.
[8] Haitner I, Holenstein T. On the Impossibility of Key Dependent Encryption[C]//Proc. of TCC’09. San Francisco, USA: [s. n.], 2009.
[9] Malkin T, Teranishi I, Yung M. Efficient Circuit-size Independent Public Key Encryption with KDM Security[C]//Proc. of EUROCRYPT’11. Tallinn, Estonia: [s. n.], 2011.
[10] Brakerski Z, Goldwasser S. Circular and Leakage Resilient Public-key Encryption Under Subgroup Indistinguishability[C]// Proc. of CRYPTO’10. Santa Barbara, USA: [s. n.], 2010.
[11] Camenish J, Chandran N, Shoup V. A Public Key Encryption Scheme Secure Against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks[C]//Proc. of EUROCRYPT’09. Cologne, Germany: [s. n.], 2009.
[12] 张李军, 王鲲鹏. 环Zn上椭圆曲线的群法则及其在Paillier系统中的应用[J]. 电子学报, 2011, 39(8): 1733-1738. |