Table of Contents Author Guidelines Submit a Manuscript
Security and Communication Networks
Volume 2017, Article ID 2148534, 27 pages
https://doi.org/10.1155/2017/2148534
Research Article

Efficient KDM-CCA Secure Public-Key Encryption via Auxiliary-Input Authenticated Encryption

Shuai Han,1,2 Shengli Liu,1,2,3 and Lin Lyu1,2

1Department of Computer Science and Engineering, Shanghai Jiao Tong University, Shanghai 200240, China
2State Key Laboratory of Cryptology, P.O. Box 5159, Beijing 100878, China
3Westone Cryptologic Research Center, Beijing 100070, China

Correspondence should be addressed to Shengli Liu; nc.ude.utjs@uills

Received 1 April 2017; Revised 13 June 2017; Accepted 6 July 2017; Published 11 December 2017

Academic Editor: Muhammad Khurram Khan

Copyright © 2017 Shuai Han et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. S. Goldwasser and S. Micali, “Probabilistic encryption,” Journal of Computer and System Sciences, vol. 28, no. 2, pp. 270–299, 1984. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  2. J. Black, P. Rogaway, and T. Shrimpton, “Encryption-scheme security in the presence of key-dependent messages,” in Selected Areas in Cryptography, K. Nyberg and H. M. Heys, Eds., vol. 2595 of Lecture Notes in Computer Science, pp. 62–75, Springer, 2003. View at Publisher · View at Google Scholar · View at MathSciNet
  3. J. Camenisch and A. Lysyanskaya, “An efficient system for non-transferable anonymous credentials with optional anonymity revocation,” in Advances in Cryptology, B. Pfitzmann, Ed., vol. 2045 of Lecture Notes in Computer Science, pp. 93–118, Springer, 2001. View at Publisher · View at Google Scholar · View at MathSciNet
  4. D. Boneh, S. Halevi, M. Hamburg, and R. Ostrovsky, “Circular-secure encryption from decision Diffie-Hellman,” in Advances in Cryptology, D. Wagner, Ed., vol. 5157 of Lecture Notes in Computer Science, pp. 108–125, Springer, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  5. Z. Brakerski and S. Goldwasser, “Circular and leakage resilient public-key encryption under subgroup indistinguishability (or: quadratic residuosity strikes back),” in Advances in Cryptology, T. Rabin, Ed., vol. 6223 of Lecture Notes in Computer Science, pp. 1–20, Springer, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  6. B. Applebaum, D. Cash, C. Peikert, and A. Sahai, “Fast cryptographic primitives and circular-secure encryption based on hard learning problems,” in Advances in Cryptology, S. Halevi, Ed., vol. 5677 of Lecture Notes in Computer Science, pp. 595–618, Springer, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  7. O. Regev, “On lattices, learning with errors, random linear codes, and cryptography,” in Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC '05), H. N. Gabow and R. Fagin, Eds., pp. 84–93, ACM, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  8. Z. Brakerski, S. Goldwasser, and Y. T. Kalai, “Black-box circular-secure encryption beyond affine functions,” in Theory of Cryptography, Y. Ishai, Ed., vol. 6597 of Lecture Notes in Computer Science, pp. 201–218, Springer, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  9. B. Barak, I. Haitner, D. Hofheinz, and Y. Ishai, “Bounded key-dependent message security,” in Advances in Cryptology, H. Gilbert, Ed., vol. 6110 of Lecture Notes in Computer Science, pp. 423–444, Springer, 2010. View at Publisher · View at Google Scholar · View at MathSciNet
  10. T. Malkin, I. Teranishi, and M. Yung, “Efficient circuit-size independent public key encryption with KDM security,” in Advances in Cryptology, K. G. Paterson, Ed., vol. 6632 of Lecture Notes in Computer Science, pp. 507–526, Springer, 2011. View at Publisher · View at Google Scholar · View at MathSciNet
  11. J. Camenisch, N. Chandran, and V. Shoup, “A public key encryption scheme secure against key dependent chosen plaintext and adaptive chosen ciphertext attacks,” in Advances in Cryptology, A. Joux, Ed., vol. 5479 of Lecture Notes in Computer Science, pp. 351–368, Springer, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  12. M. Naor and M. Yung, “Public-key cryptosystems provably secure against chosen ciphertext attacks,” in Proceedings of the 22nd Annual ACM Symposium on Theory of Computing (STOC '90), H. Ortiz, Ed., pp. 427–437, May 1990. View at Scopus
  13. J. Groth and A. Sahai, “Efficient non-interactive proof systems for bilinear groups,” in Advances in Cryptology, N. P. Smart, Ed., vol. 4965 of Lecture Notes in Computer Science, pp. 415–432, Springer, 2008. View at Publisher · View at Google Scholar · View at MathSciNet
  14. D. Galindo, J. Herranz, and J. Villar, “Identity-based encryption with master key-dependent message security and leakage-resilience,” in European Symposium on Research in Computer Security, S. Foresti, M. Yung, and F. Martinelli, Eds., vol. 7459 of Lecture Notes in Computer Science, pp. 627–642, 2012. View at Publisher · View at Google Scholar · View at Scopus
  15. D. Hofheinz, “Circular chosen-ciphertext security with compact ciphertexts,” in Advances in Cryptology, T. Johansson and P. Q. Nguyen, Eds., vol. 7881 of Lecture Notes in Computer Science, pp. 520–536, Springer, 2013. View at Publisher · View at Google Scholar · View at Scopus
  16. X. Lu, B. Li, and D. Jia, “KDM-CCA security from RKA secure authenticated encryption,” in Advances in Cryptology. Part I, E. Oswald and M. Fischlin, Eds., vol. 9056 of Lecture Notes in Computer Science, pp. 559–583, Springer, 2015. View at Publisher · View at Google Scholar · View at MathSciNet
  17. S. Han, S. Liu, and L. Lyu, “Efficient KDM-CCA secure public-key encryption for polynomial functions,” in Annual International Conference on the Theory and Applications of Cryptology and Information Security, J. H. Cheon and T. Takagi, Eds., vol. 10032 of Lecture Notes in Computer Science, pp. 307–338, Springer, 2016. View at Publisher · View at Google Scholar · View at MathSciNet
  18. R. Cramer and V. Shoup, “Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack,” SIAM Journal on Computing, vol. 33, no. 1, pp. 167–226, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  19. B. Qin, S. Liu, and K. Chen, “Efficient chosen-ciphertext secure public-key encryption scheme with high leakage-resilience,” IET Information Security, vol. 9, no. 1, pp. 32–42, 2015. View at Publisher · View at Google Scholar · View at Scopus
  20. R. Cramer and V. Shoup, “Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption,” in Advances in Cryptology, L. R. Knudsen, Ed., vol. 2332 of Lecture Notes in Computer Science, pp. 45–64, Springer, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  21. Y. Dodis, E. Kiltz, K. Pietrzak, and D. Wichs, “Message authentication, revisited,” in Advances in Cryptology, D. Pointcheval and T. Johansson, Eds., vol. 7237 of Lecture Notes in Computer Science, pp. 355–374, Springer, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  22. K. Xagawa, “Message authentication codes secure against additively related-key attacks,” in Proceedings of the Symposium on Cryptography and Information Security (SCIS '13), 2013.
  23. I. DamgÅrd and M. Jurik, “A generalisation, a simplification and some applications of Paillier's probabilistic public-key system,” in Public Key Cryptography, K. Kim, Ed., vol. 1992 of Lecture Notes in Computer Science, pp. 119–136, Springer, 2001. View at Publisher · View at Google Scholar · View at MathSciNet