{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T01:20:26Z","timestamp":1777425626715,"version":"3.51.4"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,10,26]],"date-time":"2014-10-26T00:00:00Z","timestamp":1414281600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s10623-014-0014-x","type":"journal-article","created":{"date-parts":[[2014,10,25]],"date-time":"2014-10-25T05:55:00Z","timestamp":1414216500000},"page":"493-526","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Generic constructions of integrated PKE and PEKS"],"prefix":"10.1007","volume":"78","author":[{"given":"Yu","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongdai","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhenfeng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,10,26]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Abdalla M., Bellare M., Rogaway P.: The oracle Diffie\u2013Hellman assumptions and an analysis of dhies. In: Naccache D. (ed.) Topics in Cryptology-CT-RSA 2001. Lecture Notes in Computer Science, vol. 2020, pp. 143\u2013158. Springer, Berlin (2001).","DOI":"10.1007\/3-540-45353-9_12"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Abdalla M., Bellare M., Catalano D., Kiltz E., Kohno T., Lange T., Malone-Lee J., Neven G., Paillier P., Shi H.: Searchable encryption revisited: Consistency properties, relation to anonymous ibe, and extensions. J. Cryptol. 21(3), 350\u2013391 (2008).","DOI":"10.1007\/s00145-007-9006-6"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Abdalla M., Bellare M., Neven G.: Robust encryption. In: Micciancio D. (ed.) TCC 2010. Lecture Notes in Computer Science, vol. 5978, pp. 480\u2013497. Springer, Berlin (2010).","DOI":"10.1007\/978-3-642-11799-2_28"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Agrawal S., Boneh D., Boyen X.: Efficient lattice (h)ibe in the standard model. In: Gilbert H. (ed.) Advances in Cryptology\u2014EUROCRYPT 2010. Lecture Notes in Computer Science, vol. 6110, pp. 553\u2013572. Springer, Berlin (2010).","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Baek J., Safavi-Naini R., Susilo W.: On the integration of public key data encryption and public key encryption with keyword search. In: Katsikas S.K., Lopez J., Backes M., Gritzalis S., Preneel B., (eds.) Information Security, 9th International Conference, ISC 2006. Lecture Notes in Computer Science, vol. 4176, pp. 217\u2013232. Springer, Berlin (2006).","DOI":"10.1007\/11836810_16"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Boneh D., Boyen X.: Efficient selective-id secure identity based encryption without random oracles. In: Cachin C., Camenisch J.L. (eds.) Advances in Cryptology\u2014EUROCRYPT 2004. Lecture Notes in Computer Science, vol. 3027, pp. 223\u2013238. Springer, Berlin (2004).","DOI":"10.1007\/978-3-540-24676-3_14"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Boneh D., Boyen X.: Short signatures without random oracles. In: Cachin C., Camenisch J. (eds.) Advances in Cryptology\u2014EUROCRYPT 2004. Lecture Notes in Computer Science, vol. 3027, pp. 56\u201373. Springer, Berlin (2004).","DOI":"10.1007\/978-3-540-24676-3_4"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Boneh D., Boyen X.: Short signatures without random oracles and the sdh assumption in bilinear groups. J. Cryptol. 21(2), 149\u2013177 (2008).","DOI":"10.1007\/s00145-007-9005-7"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Boneh D., Franklin M.K.: Identity-based encryption from the weil pairing. SIAM J. Comput. 32, 586\u2013615 (2003).","DOI":"10.1137\/S0097539701398521"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Boneh D., Waters B.: Conjunctive, subset, and range queries on encrypted data. In: Vadhan S.P. (ed.) Theory of Cryptography, 4th Theory of Cryptography Conference, TCC 2007. Lecture Notes in Computer Science, vol. 4392, pp. 535\u2013554. Springer, Beriln (2007).","DOI":"10.1007\/978-3-540-70936-7_29"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Boneh D., Canetti R., Halevi S., Katz J.: Chosen-ciphertext security from identity-based encryption. SIAM J. Comput. 36(5), 1301\u20131328 (2007).","DOI":"10.1137\/S009753970544713X"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Boneh D., Di Crescenzo G., Ostrovsky R., Persiano G.: Public key encryption with keyword search. In: Advances in Cryptology\u2014EUROCRYPT 2004. Lecture Notes in Computer Science, vol. 3621, pp. 506\u2013522. Springer, Berlin (2004).","DOI":"10.1007\/978-3-540-24676-3_30"},{"key":"14_CR13","unstructured":"Boneh D., Gentry C., Hamburg M.: Space-efficient identity based encryption without pairings. In: 48th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2007, pp. 647\u2013657. IEEE Computer Society (2007)."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Boneh D., Kushilevitz .E, Ostrovsky R., Skeith III W.E.: Public key encryption that allows pir queries. In: Menezes A. (ed.) Advances in Cryptology\u2014CRYPTO 2007. Lecture Notes in Computer Science, vol. 4622, pp. 50\u201367. Springer, Berlin (2007).","DOI":"10.1007\/978-3-540-74143-5_4"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Boneh D., Raghunathan A., Segev G.: Function-private identity-based encryption: hiding the function in functional encryption. In: Canetti R., Garay J.A. (eds.) Advances in Cryptology\u2014CRYPTO 2013. Lecture Notes in Computer Science, vol. 8043, pp. 461\u2013478. Springer, Berlin (2013).","DOI":"10.1007\/978-3-642-40084-1_26"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Boyen X.: Lattice mixing and vanishing trapdoors: a framework for fully secure short signatures and more. In: Nguyen, P.Q., Pointcheval D. (eds.) Public Key Cryptography\u2014PKC 2010. Lecture Notes in Computer Science, vol. 6056, pp. 499\u2013517. Springer, Berlin (2010).","DOI":"10.1007\/978-3-642-13013-7_29"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Boyen X., Waters B.: Anonymous hierarchical identity-based encryption (without random oracles). In: Dwork C. (ed.) Advances in Cryptology\u2014CRYPTO 2006. Lecture Notes in Computer Science, vol. 4117, pp. 290\u2013307. Springer, Berlin (2006).","DOI":"10.1007\/11818175_17"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Canetti R., Halevi S., Katz J.: Chosen-ciphertext security from identity based encryption. In: Cachin C., Camenisch J.L. (eds.) Advances in Cryptology\u2014EUROCRYPT 2004. Lecture Notes in Computer Science, vol. 3027, pp. 207\u2013222. Springer, Berlin (2004).","DOI":"10.1007\/978-3-540-24676-3_13"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Cash D., Hofheinz D., Kiltz E., Peikert C.: Bonsai trees, or how to delegate a lattice basis. In: Gilbert H. (ed.) Advances in Cryptology\u2014EUROCRYPT 2010. Lecture Notes in Computer Science, vol. 6110, pp. 523\u2013552. Springer, Berlin (2010).","DOI":"10.1007\/978-3-642-13190-5_27"},{"key":"14_CR20","unstructured":"Cocks C.: An indentity based encryption scheme based on quadratic residues. In: Cryptography and Coding, 8th IMA International Conference. Lecture Notes in Computer Science, vol. 2260, pp. 360\u2013363. Springer, Berlin (2001)."},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Cramer R., Shoup V.: Universal hash proofs and a paradigm for adaptive chosen ciphertext secure public-key encryption. In: Knudsen L.R. (ed.) Advances in Cryptology\u2014EUROCRYPT 2002. Lecture Notes in Computer Science, vol. 2332, pp. 45\u201364. Springer, Berlin (2002).","DOI":"10.1007\/3-540-46035-7_4"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"De Caro A., Iovino V., and Persiano G.: Fully secure anonymous hibe and secret-key anonymous Ibe with short ciphertexts. In: 4th International Conference\u2014Pairing-Based Cryptography\u2014Pairing 2010. Lecture Notes in Computer Science, vol. 6487, pp. 347\u2013366. Springer, Beriln (2010).","DOI":"10.1007\/978-3-642-17455-1_22"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Di Crescenzo G., Saraswat V.: Public key encryption with searchable keywords based on jacobi symbols. In: Srinathan K., Rangan C.P., Yung M., (eds.) Progress in Cryptology\u2014INDOCRYPT 2007. Lecture Notes in Computer Science, vol. 4859, pp. 282\u2013296. Springer, Berlin (2007).","DOI":"10.1007\/978-3-540-77026-8_21"},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Dodis Y., Katz J.: Chosen-ciphertext security of multiple encryption. In: Kilian J. (ed.) Theory of Cryptography, TCC 2005. Lecture Notes in Computer Science, vol. 3378, pp. 188\u2013209. Springer, Berlin (2005).","DOI":"10.1007\/978-3-540-30576-7_11"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Dolev D., Dwork C., Naor M.: Nonmalleable cryptography. SIAM J. Comput. 30(2), 391\u2013437 (2000).","DOI":"10.1137\/S0097539795291562"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"ElGamal T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31, 469\u2013472 (1985).","DOI":"10.1109\/TIT.1985.1057074"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Farshim P., Libert B., Paterson K.G., Quaglia E.A.: Robust encryption, revisited. In: Kurosawa K., Hanaoka G. (eds.) Public-Key Cryptography\u2014PKC 2013. Lecture Notes in Computer Science, vol. 7778, pp. 352\u2013368. Springer, Berlin (2013).","DOI":"10.1007\/978-3-642-36362-7_22"},{"key":"14_CR28","doi-asserted-by":"crossref","unstructured":"Fuhr T., Paillier P.: Decryptable searchable encryption. In: Susilo W., Liu J.K., Mu Y. (eds.) Provable Security, First International Conference, ProvSec 2007. Lecture Notes in Computer Science, vol. 4784, pp. 228\u2013236. Springer, Berli (2007).","DOI":"10.1007\/978-3-540-75670-5_17"},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Gentry C., Silverberg A.: Hierarchical id-based cryptography. In: Zheng Y. (ed.) Advances in Cryptology\u2014ASIACRYPT 2002. Lecture Notes in Computer Science, vol. 2501, pp. 548\u2013566. Springer, Berlin (2002).","DOI":"10.1007\/3-540-36178-2_34"},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Gentry C.: Practical identity-based encryption without random oracles. In: Vaudenay S. (ed.) Advances in Cryptology\u2014EUROCRYPT 2006. Lecture Notes in Computer Science, vol. 4004, pp. 445\u2013464. Springer, Berlin (2006).","DOI":"10.1007\/11761679_27"},{"key":"14_CR31","doi-asserted-by":"crossref","unstructured":"Gentry C., Peikert C., Vaikuntanathan V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC 2008), pp. 197\u2013206. ACM Press, New York (2008).","DOI":"10.1145\/1374376.1374407"},{"key":"14_CR32","doi-asserted-by":"crossref","unstructured":"Haber S., Pinkas B.: Securely combining public-key cryptosystems. In: Proceedings of the 8th ACM Conference on Computer and Communications Security (CCS 2001), pp. 215\u2013224. ACM Press, New York (2001).","DOI":"10.1145\/501983.502013"},{"key":"14_CR33","unstructured":"Hofheinz D., Weinreb E.: Searchable encryption with decryption in the standard model. IACR Cryptology ePrint Archive, Report 2008\/423 (2008). http:\/\/eprint.iacr.org\/2008\/423 . Accessed 25 June 2012."},{"key":"14_CR34","doi-asserted-by":"crossref","unstructured":"Horwitz J., Lynn B.: Toward hierarchical identity-based encryption. In: Advances in Cryptology\u2014EUROCRYPT 2002. Lecture Notes in Computer Science, vol. 2322, pp. 466\u2013481. Springer, Berlin (2002).","DOI":"10.1007\/3-540-46035-7_31"},{"key":"14_CR35","unstructured":"Krawczyk H., Rabin T.: Chameleon signatures. In: Proceedings of the Network and Distributed System Security Symposium (NDSS 2000). The Internet Society, San Diego (2000)."},{"key":"14_CR36","doi-asserted-by":"crossref","unstructured":"Kushilevitz E., Ostrovsky R.: Replication is not needed: single database, computationally-private information retrieval. In: 38th Annual Symposium on Foundations of Computer Science (FOCS 1997), pp. 364\u2013373. IEEE Computer Society, Los Alamitos (1997).","DOI":"10.1109\/SFCS.1997.646125"},{"key":"14_CR37","doi-asserted-by":"crossref","unstructured":"Micciancio D., Peikert C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval D., Johansson T. (eds.) Advances in Cryptology\u2014EUROCRYPT 2012. Lecture Notes in Computer Science, vol. 7237, pp. 700\u2013718. Springer, Berlin (2012).","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"14_CR38","doi-asserted-by":"crossref","unstructured":"Mohassel P.: A closer look at anonymity and robustness in encryption schemes. In: Masayuki A. (ed.) Advances in Cryptology\u2014ASIACRYPT 2010. Lecture Notes in Computer Science, vol. 6477, pp. 501\u2013518. Springer, Berlin (2010).","DOI":"10.1007\/978-3-642-17373-8_29"},{"key":"14_CR39","doi-asserted-by":"crossref","unstructured":"Nishioka M.: Perfect keyword privacy in peks systems. In: Provable Security\u20146th International Conference (ProvSec 2012). Lecture Notes in Computer Science, vol. 7496, pp. 175\u2013192. Springer, Berlin (2012).","DOI":"10.1007\/978-3-642-33272-2_12"},{"key":"14_CR40","doi-asserted-by":"crossref","unstructured":"Okamoto T., Pointcheval D.: The gap-problems: a new class of problems for the security of cryptographic schemes. In: Kim K. (ed.) Proceedings of Public Key Cryptography\u2014PKC 2001. Lecture Notes in Computer Science, vol. 1992, pp. 104\u2013118. Springer, Berlin (2001).","DOI":"10.1007\/3-540-44586-2_8"},{"key":"14_CR41","doi-asserted-by":"crossref","unstructured":"Paterson K.G., Schuldt J.C.N., Stam M., Thomson S.: On the joint security of encryption and signature, revisited. In: Lee D.H., Wang X. (eds.) Advances in Cryptology\u2014ASIACRYPT 2011. Lecture Notes in Computer Science, vol. 7073, pp. 161\u2013178. Springer, Berlin (2011).","DOI":"10.1007\/978-3-642-25385-0_9"},{"key":"14_CR42","unstructured":"Sakai R., Kasahara M.: Id based cryptosystems with pairing on elliptic curve. Cryptology ePrint Archive, Report 2003\/054 (2003). http:\/\/eprint.iacr.org\/2003\/054 . Accessed 25 June 2012."},{"key":"14_CR43","unstructured":"Seo J.H., Cheon J.H.: Fully secure anonymous hierarchical identity-based encryption with constant size ciphertexts. IACR Cryptology ePrint Archive, Report 2011\/021 (2011). http:\/\/eprint.iacr.org\/2011\/021 . Accessed 25 June 2012."},{"key":"14_CR44","unstructured":"Shoup V.: A proposal for an iso standard for public key encryption. IACR Cryptology ePrint Archive, Report 2001\/112 (2001). http:\/\/eprint.iacr.org\/2001\/112 . Accessed 25 June 2012."},{"key":"14_CR45","doi-asserted-by":"crossref","unstructured":"Waters B.: Efficient identity-based encryption without random oracles. In: Advances in Cryptology\u2014EUROCRYPT 2005. Lecture Notes in Computer Science, vol. 3494, pp. 114\u2013127. Springer, Berlin (2005).","DOI":"10.1007\/11426639_7"},{"key":"14_CR46","doi-asserted-by":"crossref","unstructured":"Zhang R., Imai H.: Generic combination of public key encryption with keyword search and public key encryption. In: Wang H., Xing C. (eds.) Cryptology and Network Security, 6th International Conference, CANS 2007. Lecture Notes in Computer Science, vol. 4856, pp. 159\u2013174. Springer, Berlin (2007).","DOI":"10.1007\/978-3-540-76969-9_11"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-014-0014-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-014-0014-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-014-0014-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:38Z","timestamp":1559231918000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-014-0014-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,26]]},"references-count":46,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["14"],"URL":"https:\/\/doi.org\/10.1007\/s10623-014-0014-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,26]]}}}