{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,19]],"date-time":"2026-05-19T16:13:32Z","timestamp":1779207212054,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424567","type":"print"},{"value":"9783540446477","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44647-8_13","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T19:28:14Z","timestamp":1194982094000},"page":"213-229","source":"Crossref","is-referenced-by-count":3599,"title":["Identity-Based Encryption from the Weil Pairing"],"prefix":"10.1007","author":[{"given":"Dan","family":"Boneh","sequence":"first","affiliation":[]},{"given":"Matt","family":"Franklin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,2]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"M. Bellare, A. Desai, D. Pointcheval, P. Rogaway, \u201cRelations among notions of security for public-key encryption schemes\u201d, Proc. Crypto\u2019 98, pp. 26\u201345, 1998.","DOI":"10.1007\/BFb0055718"},{"key":"13_CR2","unstructured":"D. Boneh, M. Franklin, \u201cIdentity based encryption from the Weil pairing\u201d, Full version available at http:\/\/crypto.stanford.edu\/ibe"},{"key":"13_CR3","unstructured":"D. Boneh, B. Lynn, H. Shacham, \u201cShort signatures from the Weil pairing\u201d, manuscript."},{"key":"13_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-44598-6","volume-title":"Proc. Eurocrypt 2000","author":"M. Bellare","year":"2000","unstructured":"M. Bellare, A. Boldyreva, S. Micali, \u201cPublic-key Encryption in a Multi-User Setting: Security Proofs and Improvements\u201d, Proc. Eurocrypt 2000, LNCS 1807, 2000."},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"J. Coron, \u201cOn the exact security of Full-Domain-Hash\u201d, Proc. of Crypto 2000.","DOI":"10.1007\/3-540-44598-6_14"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"R. Cramer and V. Shoup, \u201cA practical public key cryptosystem provably secure against adaptive chosen ciphertext attack\u201d, in proc. Crypto\u2019 98, pp. 13\u201325.","DOI":"10.1007\/BFb0055717"},{"key":"13_CR7","unstructured":"Y. Desmedt and J. Quisquater, \u201cPublic-key systems based on the difficulty of tampering\u201d, Proc. Crypto\u2019 86, pp. 111\u2013117, 1986."},{"key":"13_CR8","unstructured":"G. Di Crescenzo, R. Ostrovsky, and S. Rajagopalan, \u201cConditional Oblivious Transfer and Timed-Release Encryption\u201d, Proc. of Eurocrypt\u2019 99."},{"issue":"2","key":"13_CR9","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1137\/S0097539795291562","volume":"30","author":"D. Dolev","year":"2000","unstructured":"D. Dolev, C. Dwork, M. Naor, \u201cNon-malleable cryptography\u201d, SIAM J. of Computing, Vol. 30(2), pp. 391\u2013437, 2000.","journal-title":"SIAM J. of Computing"},{"key":"13_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U. Feige","year":"1988","unstructured":"U. Feige, A. Fiat and A. Shamir, \u201cZero-knowledge proofs of identity\u201d, J. Cryptology, vol. 1, pp. 77\u201394, 1988.","journal-title":"J. Cryptology"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"A. Fiat and A. Shamir, \u201cHow to prove yourself: Practical solutions to identification and signature problems\u201d, Proc. Crypto\u2019 86, pp. 186\u2013194, 1986.","DOI":"10.1007\/3-540-47721-7_12"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"E. Fujisaki and T. Okamoto, \u201cSecure integration of asymmetric and symmetric encryption schemes\u201d, Proc. Crypto\u2019 99, pp. 537\u2013554, 1999.","DOI":"10.1007\/3-540-48405-1_34"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"1717","DOI":"10.1109\/18.771254","volume":"45","author":"G. Frey","year":"1999","unstructured":"G. Frey, M. M\u00fcller, H. R\u00fcck, \u201cThe Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems\u201d, IEEE Tran. on Info. Th., Vol. 45, pp. 1717\u20131718, 1999.","journal-title":"IEEE Tran. on Info. Th."},{"key":"13_CR14","unstructured":"P. Gemmell, \u201cAn introduction to threshold cryptography\u201d, in CryptoBytes, a technical newsletter of RSA Laboratories, Vol. 2, No. 7, 1997."},{"key":"13_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/3-540-48910-X_21","volume-title":"Advances in Cryptology-Eurocrypt\u2019 99","author":"R. Gennaro","year":"1999","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk, T. Rabin, \u201cSecure Distributed Key Generation for Discrete-Log Based Cryptosystems\u201d, Advances in Cryptology-Eurocrypt\u2019 99, Springer-Verlag LNCS 1592, pp. 295\u2013310, 1999."},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"O. Goldreich, B. Pfitzmann and R. Rivest, \u201cSelf-delegation with controlled propagation-or-What if you lose your laptop\u201d, proc. Crypto\u2019 98, pp. 153\u2013168, 1998.","DOI":"10.1007\/BFb0055726"},{"key":"13_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/10722028_23","volume-title":"Proc of ANTS 4","author":"A. Joux","year":"2000","unstructured":"A. Joux, \u201cA one round protocol for tripartite Diffie-Hellman\u201d, Proc of ANTS 4, LNCS 1838, pp. 385\u2013394, 2000."},{"key":"13_CR18","unstructured":"A. Joux, K. Nguyen, \u201cSeparating Decision Diffie-Hellman from Diffie-Hellman in cryptographic groups\u201d, available from eprint.iacr.org ."},{"key":"13_CR19","volume-title":"Elliptic functions","author":"S. Lang","year":"1973","unstructured":"S. Lang, \u201cElliptic functions\u201d, Addison-Wesley, Reading, 1973."},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"U. Maurer, \u201cTowards proving the equivalence of breaking the Diffie-Hellman protocol and computing discrete logarithms\u201d, Proc. Crypto\u2019 94, pp. 271\u2013281.","DOI":"10.1007\/3-540-48658-5_26"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"U. Maurer and Y. Yacobi, \u201cNon-interactive public-key cryptography\u201d, proc. Eurocrypt\u2019 91, pp. 498\u2013507.","DOI":"10.1007\/3-540-46416-6_43"},{"key":"13_CR22","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1109\/18.259647","volume":"39","author":"A. Menezes","year":"1993","unstructured":"A. Menezes, T. Okamoto, S. Vanstone, \u201cReducing elliptic curve logarithms to logarithms in a finite field\u201d, IEEE Tran. on Info. Th., Vol. 39, pp. 1639\u20131646, 1993.","journal-title":"IEEE Tran. on Info. Th."},{"key":"13_CR23","unstructured":"V. Miller, \u201cShort programs for functions on curves\u201d, unpublished manuscript."},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"P. Paillier and M. Yung, \u201cSelf-escrowed public-key infrastructures\u201d in Proc. ICISC, pp. 257\u2013268, 1999.","DOI":"10.1007\/10719994_20"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"C. Rackoff, D. Simon, \u201cNoninteractive zero-knowledge proof of knowledge and chosen ciphertext attack\u201d, in proc. Crypto\u2019 91, pp. 433\u2013444, 1991.","DOI":"10.1007\/3-540-46766-1_35"},{"key":"13_CR26","unstructured":"R. Rivest, A. Shamir and D. Wagner, \u201cTime lock puzzles and timed release cryptography,\u201d Technical report, MIT\/LCS\/TR-684"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"A. Shamir, \u201cIdentity-based cryptosystems and signature schemes\u201d, Proc. Crypto\u2019 84, pp. 47\u201353.","DOI":"10.1007\/3-540-39568-7_5"},{"issue":"4","key":"13_CR28","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1109\/49.17709","volume":"7","author":"S. Tsuji","year":"1989","unstructured":"S. Tsuji and T. Itoh, \u201cAn ID-based cryptosystem based on the discrete logarithm problem\u201d, IEEE Journal on Selected Areas in Communication, vol. 7, no. 4, pp. 467\u2013473, 1989.","journal-title":"IEEE Journal on Selected Areas in Communication"},{"key":"13_CR29","doi-asserted-by":"crossref","unstructured":"H. Tanaka, \u201cA realization scheme for the identity-based cryptosystem\u201d, Proc. Crypto\u2019 87, pp. 341\u2013349, 1987.","DOI":"10.1007\/3-540-48184-2_29"},{"key":"13_CR30","doi-asserted-by":"crossref","unstructured":"E. Verheul, \u201cEvidence that XTR is more secure than supersingular elliptic curve cryptosystems\u201d, Proc. Eurocrypt 2001.","DOI":"10.1007\/3-540-44987-6_13"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44647-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T10:22:39Z","timestamp":1556965359000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44647-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424567","9783540446477"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/3-540-44647-8_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}