Table of Contents Author Guidelines Submit a Manuscript
Mobile Information Systems
Volume 2015 (2015), Article ID 430797, 10 pages
http://dx.doi.org/10.1155/2015/430797
Research Article

New Construction of PVPKE Scheme and Its Application in Information Systems and Mobile Communication

1School of Computer Science, Northwestern Polytechnical University, Xi’an 710072, China
2Key Laboratory of Information and Network Security, Engineering University of Chinese Armed Police Force, Xi’an 710086, China

Received 29 August 2014; Accepted 1 September 2014

Academic Editor: David Taniar

Copyright © 2015 Minqing Zhang 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. A. J. Jara, S. Varakliotis, A. F. Skarmeta, and P. Kirstein, “Extending the Internet of things to the future internet through IPv6 support,” Mobile Information Systems, vol. 10, no. 1, pp. 3–17, 2014. View at Publisher · View at Google Scholar · View at Scopus
  2. A. J. Jara, D. Fernandez, P. Lopez, M. A. Zamora, and A. F. Skarmeta, “Lightweight MIPv6 with IPSec support,” Mobile Information Systems, vol. 10, no. 1, pp. 37–77, 2014. View at Publisher · View at Google Scholar · View at Scopus
  3. W. Diffie and M. E. Hellman, “New directions in cryptography,” IEEE Transactions on Information Theory, vol. 22, no. 6, pp. 644–654, 1976. View at Google Scholar · View at MathSciNet
  4. R. L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Communications of the Association for Computing Machinery, vol. 21, no. 2, pp. 120–126, 1978. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. 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
  6. M. Abe, E. Kiltz, and T. Okamoto, “Chosen ciphertext security with optimal ciphertext overhead,” in Advances in Cryptology—ASIACRYP, vol. 5350 of Lecture Notes in Computer Science, pp. 355–371, Springer, Berlin, Germany, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. M. Bellare and P. Rogaway, “Optimal asymmetric encryption: how to encrypt with RSA,” in Advances in Cryptology—EUROCRYPT'94, vol. 950 of Lecture Notes in Computer Science, pp. 92–111, 1994. View at Google Scholar
  8. R. Cramer and V. Shoup, “A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack,” in Advances in Cryptology—CRYPTO '98, vol. 1462 of Lecture Notes in Computer Science, pp. 13–25, Springer, Berlin, Germany, 1998. View at Publisher · View at Google Scholar
  9. G. Hanaoka and K. Kurosawa, “Efficient chosen ciphertext secure public key encryption under the computational Diffie-Hellman assumption,” in Advances in Cryptology—ASIACRYPT 2008, vol. 5350 of Lecture Notes in Computer Science, pp. 308–325, Springer, Berlin, Germany, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  10. D. Hofheinz, E. Kiltz, and V. Shoup, “Practical chosen ciphertext secure encryption from factoring,” Journal of Cryptology, vol. 26, no. 1, pp. 102–118, 2013. View at Publisher · View at Google Scholar · View at Scopus
  11. Y. Lindell, “A simpler construction of cca2-secure public-key encryption under general assumptions,” in Advances in Cryptology—EUROCRYPT 2003, vol. 2656 of Lecture Notes in Computer Science, pp. 241–254, Springer, Berlin, Germany, 2003. View at Publisher · View at Google Scholar · View at MathSciNet
  12. K. Goto, Y. Sasaki, T. Hara, and S. Nishio, “Data gathering using mobile agents for reducing traffic in dense mobile wireless sensor networks,” Mobile Information Systems, vol. 9, no. 4, pp. 295–314, 2013. View at Publisher · View at Google Scholar · View at Scopus
  13. M. Zhang, X. A. Wang, W. Li, and X. Yang, “CCA secure publicly verifiable public key encryption without pairings nor random oracle and its applications,” Journal of Computers, vol. 8, no. 8, pp. 1987–1994, 2013. View at Publisher · View at Google Scholar · View at Scopus
  14. X. Chen, J. Li, and W. Susilo, “Efficient fair conditional payments for outsourcing computations,” IEEE Transactions on Information Forensics and Security, vol. 7, no. 6, pp. 1687–1694, 2012. View at Publisher · View at Google Scholar · View at Scopus
  15. X. Chen, J. Li, J. Ma, Q. Tang, and W. Lou, “New algorithms for secure outsourcing of modular exponentiations,” in Computer Security—ESORICS 2012, vol. 7459 of Lecture Notes in Computer Science, pp. 541–556, Springer, Berlin, Germany, 2012. View at Publisher · View at Google Scholar
  16. R. Canetti and S. Goldwasser, “An efficient threshold public key cryptosystem secure against adaptive chosen ciphertext attack,” in Advances in Cryptology—EUROCRYPT'99, vol. 1592 of Lecture Notes in Computer Science, pp. 90–106, Springer, Berlin, Germany, 1999. View at Publisher · View at Google Scholar
  17. J. Baek and Y. Zheng, “Identity-based threshold decryption,” in Public Key Cryptography—PKC 2004, vol. 2947 of Lecture Notes in Computer Science, pp. 262–276, Springer, Berlin, Germany, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  18. D. Boneh, X. Boyen, and S. Halevi, “Chosen ciphertext secure public key threshold encryption without random oracles,” in Topics in Cryptology—CT-RSA 2006, vol. 3860 of Lecture Notes in Computer Science, pp. 226–243, 2006. View at Publisher · View at Google Scholar
  19. V. Shoup and R. Gennaro, “Securing threshold cryptosystems against chosen ciphertext attack,” Journal of Cryptology, vol. 15, no. 2, pp. 75–96, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  20. C. Delerablée and D. Pointcheval, “Dynamic threshold public-key encryption,” in Advances in Cryptology—CRYPTO, vol. 5157 of Lecture Notes in Computer Science, pp. 317–334, Springer, Berlin, Germany, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. G. Ateniese, K. Fu, M. Green, and S. Hohenberger, “Improved proxy re-encryption schemes with applications to secure distributed storage,” in Proceedings of the 12th Annual Network and Distributed System Security Symposium (NDSS '05), pp. 29–43, San Diego, Calif, USA, 2005.
  22. G. Ateniese, K. Fu, M. Green, and S. Hohenberger, “Improved proxy re-encryption schemes with applications to secure distributed storage,” ACM Transactions on Information and System Security, vol. 9, no. 1, pp. 1–30, 2006. View at Publisher · View at Google Scholar
  23. B. Libert and D. Vergnaud, “Unidirectional chosen-ciphertext secure proxy re-encryption,” in Public Key Cryptography—PKC 2008, vol. 4939 of Lecture Notes in Computer Science, pp. 360–379, Springer, Berlin, Germany, 2008. View at Publisher · View at Google Scholar
  24. R. Canetti and S. Hohenberger, “Chosen ciphertext secure proxy re-encryption,” in Proceedings of the 14th ACM Conference on Computer and Communications Security (CCS '07), pp. 185–194, ACM, 2007.
  25. J. Zhang and X. A. Wang, “On the security of a multi-use CCA-secure proxy re-encryption scheme,” in Proceedings of the 4th International Conference on Intelligent Networking and Collaborative Systems (INCoS '12), pp. 571–576, Bucharest, Romania, September 2012. View at Publisher · View at Google Scholar
  26. J. Zhang and X. Wang, “Security analysis of a multi-use identity based CCA-secure proxy reencryption scheme,” in Proceedings of the 4th International Conference on Intelligent Networking and Collaborative Systems (INCoS '12), pp. 581–586, September 2012.
  27. J. Nieto, M. Manulis, B. Poettering, J. Rangasamy, and D. Stebila, “Publicly verifiable ciphertexts,” in Proceedings of the 8th International Conference on Security and Cryptography for Networks (SCN '12), vol. 7485 of Lecture Notes in Computer Science, pp. 393–410, Amalfi, Italy, 2012. View at Publisher · View at Google Scholar
  28. D. Hofheinz and E. Kiltz, “The group of signed quadratic residues and applications,” in Advances in Cryptology—CRYPTO 2009, vol. 5677 of Lecture Notes in Computer Science, pp. 637–653, Springer, Berlin, Germany, 2009. View at Publisher · View at Google Scholar
  29. 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), pp. 427–437, May 1990. View at Scopus
  30. C. Rackoff and D. R. Simon, “Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack,” in Advances in Cryptology—CRYPTO '91, vol. 576 of Lecture Notes in Computer Science, pp. 433–444, Springer, Berlin, Germany, 1992. View at Publisher · View at Google Scholar
  31. D. Dolev, C. Dwork, and M. Naor, “Non-malleable cryptography,” in Proceedings of the 23rd Annual ACM Symposium on Theory of Computing (STOC '91), pp. 542–552, May 1991. View at Publisher · View at Google Scholar
  32. A. Sahai, “Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security,” in Proceedings of the 40th Annual Symposium on Foundations of Computer Science (IEEE FOCS '99), pp. 543–553, New York, NY, USA, October 1999. View at Publisher · View at Google Scholar
  33. M. Bellare and P. Rogaway, “Random oracles are practical: a paradigm for designing efficient protocols,” in Proceedings of the 1st ACM Conference on Computer and Communications Security (CCS '93), pp. 62–73, November 1993. View at Scopus
  34. R. Canetti, O. Goldreich, and S. Halevi, “Random oracle methodology, revisited,” in Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC '98), pp. 209–218, May 1998. View at Scopus
  35. 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
  36. K. Kurosawa and Y. Desmedt, “A new paradigm of hybrid encryption scheme,” in Advances in Cryptology—CRYPTO 2004, vol. 3152 of Lecture Notes in Computer Science, pp. 426–442, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  37. M. Abe, R. Gennaro, K. Kurosawa, and V. Shoup, “Tag-kem/dem: a new framework for hybrid encryption and a new analysis of kurosawa-desmedt kem,” in Advances in Cryptology—EUROCRYPT 2005, vol. 3494 of Lecture Notes in Computer Science, pp. 128–146, Springer, Berlin, Germany, 2005. View at Publisher · View at Google Scholar
  38. R. Canetti, S. Halevi, and J. Katz, “Chosen-ciphertext security from identity-based encryption,” in Advances in Cryptology—EUROCRYPT 2004, vol. 3027 of Lecture Notes in Computer Science, pp. 207–222, Springer, Berlin, Germany, 2004. View at Publisher · View at Google Scholar · View at MathSciNet
  39. D. Boneh and J. Katz, “Improved efficiency for CCA-secure cryptosystems built using identity-based encryption,” in Topics in Cryptology—CT-RSA 2005, vol. 3376 of Lecture Notes in Computer Science, pp. 87–103, Springer, Berlin, Germany, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  40. X. Boyen, Q. Mei, and B. Waters, “Direct chosen ciphertext security from identity-based techniques,” in Proceedings of the 12th ACM Conference on Computer and Communications Security (CCS '05 ), pp. 320–329, November 2005. View at Publisher · View at Google Scholar · View at Scopus
  41. E. Kiltz, “Chosen-ciphertext security from tag-based encryption,” in Theory of Cryptography, vol. 3876 of Lecture Notes in Computer Science, pp. 581–600, Springer, Berlin, Germany, 2006. View at Publisher · View at Google Scholar
  42. C. Peikert and B. Waters, “Lossy trapdoor functions and their applications,” in Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC '08), pp. 187–196, 2008. View at Publisher · View at Google Scholar
  43. A. Rosen and G. Segev, “Chosen-ciphertext security via correlated products,” in Theory of Cryptography, vol. 5444, pp. 419–436, Springer, Berlin, Germany, 2009. View at Publisher · View at Google Scholar
  44. D. Boneh and M. Franklin, “Identity-based encryption from the Weil pairing,” in Advances in Cryptology—CRYPTO 2001: Proceedings of the 21st Annual International Cryptology Conference, Santa Barbara, California, USA, August 19–23, 2001, vol. 2139 of Lecture Notes in Computer Science, pp. 213–229, Springer, Berlin, Germany, 2001. View at Publisher · View at Google Scholar
  45. D. Boneh, C. Gentry, and B. Waters, “Collusion resistant broadcast encryption with short ciphertexts and private keys,” in Proceedings of the 25th Annual International Cryptology Conference (CRYPTO '05), vol. 3621 of Lecture Notes in Computer Science, pp. 258–275, Santa Barbara, Calif, USA, 2005. View at Publisher · View at Google Scholar
  46. J. Groth and A. Sahai, “Efficient non-interactive proof systems for bilinear groups,” in Advances in Cryptology—EUROCRYPT 2008, vol. 4965 of Lecture Notes in Computer Science, pp. 415–432, Springer, Berlin, Germany, 2008. View at Publisher · View at Google Scholar
  47. D. Boneh, G. D. Crescenzo, R. Ostrovsky, and G. Persiano, “Public key encryption with keyword search,” in Computational Science and Its Applications—ICCSA 2008, vol. 3089 of Lecture Notes in Computer Science, pp. 31–45, Springer, Berlin, Germany, 2004. View at Google Scholar
  48. M. Abdalla, M. Bellare, D. Catalano et al., “Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions,” in Advances in Cryptology—CRYPTO 2005, vol. 3621 of Lecture Notes in Computer Science, pp. 205–222, Springer, Berlin, Germany, 2005. View at Publisher · View at Google Scholar
  49. V. Goyal, O. Pandey, A. Sahai, and B. Waters, “Attribute-based encryption for fine-grained access control of encrypted data,” in Proceedings of the 13th ACM Conference on Computer and Communications Security (CCS '06), pp. 89–98, November 2006. View at Publisher · View at Google Scholar · View at Scopus
  50. J. Katz, A. Sahai, and B. Waters, “Predicate encryption supporting disjunctions, polynomial equations, and inner products,” in Advances in Cryptology—EUROCRYPT 2008, vol. 4965 of Lecture Notes in Computer Science, pp. 146–162, Springer, Berlin, Germany, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  51. J. Baek, R. Safavi-Naini, and W. Susilo, “Certificateless public key encryption without pairing,” in Information Security, vol. 3650 of Lecture Notes in Computer Science, pp. 134–148, Springer, Berlin, Germany, 2005. View at Publisher · View at Google Scholar
  52. S. Al Riyami and K. Paterson, “Certificateless public key cryptography,” in Advances in Cryptology—ASIACRYPT 2003, vol. 2894 of Lecture Notes in Computer Science, pp. 452–473, Springer, 2003. View at Google Scholar
  53. R. Deng, J. Weng, S. Liu, and K. Chen, “Chosen ciphertext secure proxy re-encryption without pairings,” in Cryptology and Network Security, vol. 5339 of Lecture Notes in Computer Science, pp. 1–17, Springer, Berlin, Germany, 2008, http://eprint.iacr.org/2008/509. View at Publisher · View at Google Scholar
  54. J. Shao and Z. Cao, “CCA-secure proxy re-encryption without pairings,” in Public Key Cryptography—PKC 2009, vol. 5443 of Lecture Notes in Computer Science, pp. 357–376, Springer, Berlin, Germany, 2009. View at Publisher · View at Google Scholar · View at MathSciNet
  55. J. Camenisch and V. Shoup, “Practical verifiable encryption and decryption of discrete logarithms,” in Advances in Cryptology—CRYPTO 2003, vol. 2729 of Lecture Notes in Computer Science, pp. 126–144, Springer, Berlin, Germany, 2003. View at Publisher · View at Google Scholar
  56. A. Kiayias, Y. Tsiounis, and M. Yung, Group Encryption, Cryptology ePrint Archive, 2007, http://eprint.iacr.org/2007/015.pdf.
  57. E. Kiltz, “Chosen-ciphertext secure key-encapsulation based on gap hashed Diffie-Hellman,” in Public Key Cryptography—PKC, vol. 4450 of Lecture Notes in Computer Science, pp. 282–297, Springer, Berlin, Germany, 2007. View at Publisher · View at Google Scholar · View at MathSciNet
  58. J. Herranz, D. Hofheinz, and E. Kiltz, “KEM/DEM: necessary and sucffcient conditions for secure hybrid encryption,” in IACR Cryptology ePrint Archive, Report 2006/256, IACR, 2006. View at Google Scholar
  59. J. Zhang and X. Wang, “New construction of PVPKE scheme based on signed quadratic residues,” in Proceedings of the 5th International Conference on Intelligent Networking and Collaborative Systems (INCoS '13), pp. 434–437, September 2013. View at Publisher · View at Google Scholar