{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T15:16:39Z","timestamp":1726413399206},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2012,8,4]],"date-time":"2012-08-04T00:00:00Z","timestamp":1344038400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2012,10]]},"DOI":"10.1007\/s10207-012-0171-8","type":"journal-article","created":{"date-parts":[[2012,8,3]],"date-time":"2012-08-03T07:53:48Z","timestamp":1343980428000},"page":"305-320","source":"Crossref","is-referenced-by-count":1,"title":["The n-Diffie\u2013Hellman problem and multiple-key encryption"],"prefix":"10.1007","volume":"11","author":[{"given":"Liqun","family":"Chen","sequence":"first","affiliation":[]},{"given":"Yu","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,8,4]]},"reference":[{"key":"171_CR1","doi-asserted-by":"crossref","unstructured":"Abdalla, M., Bellare, M., Rogaway, P.: The oracle Diffie\u2013Hellman assumptions and an analysis of DHIES. In: Topics in Cryptology\u2014CT-RSA 2001. LNCS, vol. 2020, pp. 143\u2013158 (2001)","DOI":"10.1007\/3-540-45353-9_12"},{"key":"171_CR2","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: The 1st ACM Conference on Computer and Communications Security, pp. 62\u201373. ACM Press, New York (1993)","DOI":"10.1145\/168588.168596"},{"key":"171_CR3","doi-asserted-by":"crossref","unstructured":"Bethencourt, J., Sahai, A., Waters, B.: Ciphertext-policy attribute-based encryption. IEEE Symposium on Security and Privacy 2007 (SP\u2019 2007), pp. 321\u2013334 (2007)","DOI":"10.1109\/SP.2007.11"},{"key":"171_CR4","doi-asserted-by":"crossref","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Advances in Cryptology\u2014CRYPTO 2001. LNCS, vol. 2139, pp. 213\u2013229 (2001)","DOI":"10.1007\/3-540-44647-8_13"},{"key":"171_CR5","doi-asserted-by":"crossref","unstructured":"Boneh, D., Gentry, C., Waters, B.: Collusion resistant broadcast encryption with short ciphertexts and private keys. In: Advances in Cryptology\u2014CRYPTO 2005. LNCS, vol. 3621, pp. 258\u2013275. Springer, Berlin (2005)","DOI":"10.1007\/11535218_16"},{"key":"171_CR6","doi-asserted-by":"crossref","unstructured":"Cash, D., Kiltz, E., Shoup, V.: The twin Diffie\u2013Hellman problem and applications. In: Advances in Cryptology\u2014EUROCRYPT 2008. LNCS, vol. 4965, pp. 127\u2013145 (2008)","DOI":"10.1007\/978-3-540-78967-3_8"},{"key":"171_CR7","unstructured":"Chen, L.: An interpretation of identity-based cryptography. In: Foundations of Security Analysis and Design IV, FOSAD 2006\/2007 Tutorial Lectures. LNCS, vol. 4677, pp. 183\u2013208 (2007)"},{"key":"171_CR8","doi-asserted-by":"crossref","unstructured":"Chen, L., Chen, Y.: The n-Diffie\u2013Hellman problem and its applications. In: Information Security, 14th International Conference, ISC 2011. Lecture notes in computer science, vol. 7001, pp. 119\u2013134. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-24861-0_9"},{"key":"171_CR9","doi-asserted-by":"crossref","unstructured":"Chen, L., Cheng, Z.: Security proof of sakai-kasahara\u2019s identity-based encryption scheme. In: Cryptography and Coding, 10th IMA International Conference. LNCS, vol. 3796, pp. 442\u2013459 (2005)","DOI":"10.1007\/11586821_29"},{"key":"171_CR10","unstructured":"Chen, L., Harrison, K.: Multiple trusted authorities in identifier based cryptography from pairings on elliptic curves. HP Labs Technical Reports, HPL-2003-48 (2003). http:\/\/www.hpl.hp.com\/techreports\/2003\/HPL-2003-48.pdf"},{"key":"171_CR11","doi-asserted-by":"crossref","unstructured":"Chen, L., Harrison, K., Soldera, D., Smart, N.: Applications of multiple trust authorities in pairing based cryptosystems. In: Proceedings of Infrastructure Security Conference 2002. LNCS, vol. 2437, pp. 260\u2013275 (2003)","DOI":"10.1007\/3-540-45831-X_18"},{"key":"171_CR12","doi-asserted-by":"crossref","unstructured":"Chen, Y., Chen, L.: Twin bilinear Diffie\u2013Hellman inversion problem and its application. In: The 13th Annual International Conference on Information Security and Cryptology, ICISC 2010. LNCS, Springer, Berlin (2010) (to appear)","DOI":"10.1007\/978-3-642-24209-0_8"},{"key":"171_CR13","doi-asserted-by":"crossref","unstructured":"Cramer, R., Shoup, V.: A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack. In: Advances in Cryptology\u2014CRYPTO 1998. LNCS, vol. 1462, pp. 13\u201325 (1998)","DOI":"10.1007\/BFb0055717"},{"key":"171_CR14","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/S0097539702403773","volume":"33","author":"R. Cramer","year":"2001","unstructured":"Cramer R., Shoup V.: Design and analysis of practical public-key encryption schemes secure against adaptive chosen ciphertext attack. SIAM J. Comput. 33, 167\u2013226 (2001)","journal-title":"SIAM J. Comput."},{"key":"171_CR15","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Jurik, M.: A length-flexible threshold cryptosystem with applications. In: Information Security and Privacy, 8th Australasian Conference, ACISP 2003. LNCS, vol. 2727, pp. 350\u2013364. Springer, Berlin (2003)","DOI":"10.1007\/3-540-45067-X_30"},{"key":"171_CR16","doi-asserted-by":"crossref","unstructured":"Delerabl\u00e9e, C., Paillier, P., Pointcheval, D.: Fully collusion secure dynamic broadcast encryption with constant-size ciphertexts or decryption keys. In: Pairing-Based Cryptography\u2014Pairing 2007. LNCS, vol. 4575, pp. 39\u201359 (2007)","DOI":"10.1007\/978-3-540-73489-5_4"},{"issue":"6","key":"171_CR17","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W. Diffie","year":"1976","unstructured":"Diffie W., Hellman M.E.: New directions in cryptograpgy. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"171_CR18","doi-asserted-by":"crossref","unstructured":"Fujisaki, E., Okamoto, T.: Secure integration of asymmetric and symmetric encryption schemes. In: Advances in Cryptology\u2014CRYPTO 1999. LNCS, vol. 1666, pp. 537\u2013554 (1999)","DOI":"10.1007\/3-540-48405-1_34"},{"issue":"16","key":"171_CR19","doi-asserted-by":"crossref","first-page":"3113","DOI":"10.1016\/j.dam.2007.12.010","volume":"156","author":"S. Galbraith","year":"2008","unstructured":"Galbraith S., Paterson K., Smart N.P.: Pairings for cryptographers. Discret. Appl. Math. 156(16), 3113\u20133121 (2008)","journal-title":"Discret. Appl. Math."},{"key":"171_CR20","doi-asserted-by":"crossref","unstructured":"Goyal, V., Pandey, O., Sahai, A., Waters, B.: Attribute-based encryption for fine-grained access control of encrypted data. In: ACM Conference on Computer and Communications Security, ACM CCS 2006, pp. 89\u201398. ACM, New York (2006)","DOI":"10.1145\/1180405.1180418"},{"key":"171_CR21","unstructured":"Halevi, S., Rogaway, P.: A tweakable enciphering mode. In: Advances in Cryptology -CRYPTO 2003. LNCS, vol. 2729, pp. 482\u2013499 (2003)"},{"key":"171_CR22","unstructured":"Halevi, S., Rogaway, P.: A parallelizable enciphering mode. In: CT-RSA 2004. LNCS, vol. 2964, pp. 292\u2013304 (2004)"},{"key":"171_CR23","doi-asserted-by":"crossref","unstructured":"Libert, B., Quisquater, J.J.: Identity based encryption without redundancy. In: ACNS 2005. LNCS, vol. 3531, pp. 285\u2013300","DOI":"10.1007\/11496137_20"},{"key":"171_CR24","doi-asserted-by":"crossref","unstructured":"Rackoff, C., Simon, D.R.: Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack. In: Advances in Cryptology\u2014CRYPTO 1991. LNCS, vol. 576, pp. 433\u2013444 (1991)","DOI":"10.1007\/3-540-46766-1_35"},{"key":"171_CR25","unstructured":"Sakai, R., Kasahara, M.: Id based cryptosystems with pairing on elliptic curve. Cryptology ePrint Archive, Report 2003\/054 (2003). http:\/\/eprint.iacr.org\/"},{"issue":"11","key":"171_CR26","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-012-0171-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-012-0171-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-012-0171-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,2]],"date-time":"2019-07-02T09:01:01Z","timestamp":1562058061000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-012-0171-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,4]]},"references-count":26,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2012,10]]}},"alternative-id":["171"],"URL":"https:\/\/doi.org\/10.1007\/s10207-012-0171-8","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"type":"print","value":"1615-5262"},{"type":"electronic","value":"1615-5270"}],"subject":[],"published":{"date-parts":[[2012,8,4]]}}}