{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:12:39Z","timestamp":1725484359857},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540438618"},{"type":"electronic","value":"9783540454502"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45450-0_28","type":"book-chapter","created":{"date-parts":[[2007,5,19]],"date-time":"2007-05-19T20:53:10Z","timestamp":1179607990000},"page":"362-378","source":"Crossref","is-referenced-by-count":9,"title":["A New Identification Scheme Based on the Bilinear Diffie-Hellman Problem"],"prefix":"10.1007","author":[{"given":"Myungsun","family":"Kim","sequence":"first","affiliation":[]},{"given":"Kwangjo","family":"Kim","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,6,21]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway, \u201cRandom Oracles are Practical: A Paradigm for Designing Efficient Protocols\u201d, ACM Conference on Computer and Communications Security, pp. 62\u201373, 1993.","DOI":"10.1145\/168588.168596"},{"key":"28_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology-Crypto\u2019 2001","author":"D. Boneh","year":"2001","unstructured":"D. Boneh and M. Franklin, \u201cID-based encryption from the Weil-pairing\u201d, Advances in Cryptology-Crypto\u2019 2001, LNCS 2139, Springer-Verlag, pp. 213\u2013229, 2001."},{"key":"28_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology-Asiacrypt\u2019 2001","author":"D. Boneh","year":"2001","unstructured":"D. Boneh, H. Shacham, and B. Lynn, \u201cShort signatures from the Weil-pairing\u201d, Advances in Cryptology-Asiacrypt\u2019 2001, LNCS 2248, Springer-Verlag, pp. 514\u2013532, 2001."},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"I. Blake, G. Seroussi and N. Smart, \u201cElliptic curves in cryptography\u201d, Cambridge University Prress, LNS 265, 1999.","DOI":"10.1017\/CBO9781107360211"},{"key":"28_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-44598-6_14","volume-title":"Advances in Cryptology-Crypto\u2019 2000","author":"J.-S. Coron","year":"2000","unstructured":"J.-S. Coron, \u201cOn the security of full domain hash\u201d, Advances in Cryptology-Crypto\u2019 2000, LNCS 1880, Springer-Verlag, pp. 229\u2013235, 2000."},{"key":"28_CR6","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, 1: 77\u201394, 1988.","journal-title":"J. Cryptology"},{"key":"28_CR7","series-title":"Lect Notes Comput Sci","first-page":"186","volume-title":"Advances in Cryptology \u2014 Crypto\u2019 86","author":"A. Fiat","year":"1987","unstructured":"A. Fiat and A. Shamir, \u201cHow to prove yourself: pratical solutions to identification and signature problems\u201d, Advances in Cryptology \u2014 Crypto\u2019 86, LNCS 263, Springer-Verlag, pp. 186\u2013194, 1987."},{"key":"28_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/BFb0032038","volume-title":"Proceedings of the 17th ICALP","author":"O. Goldreich","year":"1990","unstructured":"O. Goldreich and H. Krawczyk, \u201cOn the composition of zero-knowledge proof systems\u201d, In Proceedings of the 17th ICALP, LNCS 443, Springer-Verlag, pp. 268\u2013282, 1990."},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali, and C. Rackoff, \u201cThe knowledge complexity of interactive proof systems\u201d, SIAM J. Comput., 18: 186\u2013208, 1989.","journal-title":"SIAM J. Comput."},{"key":"28_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-45961-8_11","volume-title":"Advances in Cryptology \u2014 Eurocrypt\u2019 88","author":"L. Guillou","year":"1989","unstructured":"L. Guillou and J. Quisquater, \u201cA practical zero-knowledge protocol fitted to security microprocessors minimizing both transmission and memory\u201d, Advances in Cryptology \u2014 Eurocrypt\u2019 88, LNCS 330, Springer-Verlag, pp. 123\u2013128, 1989."},{"key":"28_CR11","unstructured":"A. Joux and K. Nguyen, \u201cSeperating decision Diffie-Hellman from Diffie-Hellman in cryptographic groups\u201d, available from eprint.iacr.org ."},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"A. J. Menezes, \u201cElliptic curve public key cryptosystems\u201d, Kluwer Academic Publishers, 1993.","DOI":"10.1007\/978-1-4615-3198-2"},{"key":"28_CR13","doi-asserted-by":"publisher","first-page":"1639","DOI":"10.1109\/18.259647","volume":"39","author":"A. J. Menezes","year":"1993","unstructured":"A. J. Menezes, T. Okamoto, and S. A. Vanstone, \u201cReducing elliptic curve logarithms to logarithms in a finite field\u201d, IEEE Trans. Inform. Theory, 39(1993), pp. 1639\u20131646.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"28_CR14","unstructured":"V. Miller, \u201cShort programs for functions on curves\u201d, unpublished manuscript, 1986."},{"key":"28_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-48071-4_3","volume-title":"Advances in Cryptology \u2014 Crypto\u2019 92","author":"T. Okamoto","year":"1993","unstructured":"T. Okamoto, \u201cProvably secure and practical identification schemes and corresponding signature schemes\u201d, Advances in Cryptology \u2014 Crypto\u2019 92, LNCS 740, Springer-Verlag, pp. 31\u201353, 1993."},{"key":"28_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-44586-2_8","volume-title":"PKC 2001","author":"T. Okamoto","year":"2001","unstructured":"T. Okamoto and D. Pointcheval, \u201cThe gap-problem: a new class of problems for the security of cryptographic schemes\u201d, PKC 2001, LNCS 1992, Springer-Verlag, pp. 104\u2013118, 2001."},{"key":"28_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/0-387-34799-2_17","volume-title":"Advances in Cryptology-Crypto\u2019 88","author":"K. Ohta","year":"1990","unstructured":"K. Ohta and T. Okamoto, \u201cA modification of the Fiat-Shamir scheme\u201d, Advances in Cryptology-Crypto\u2019 88, LNCS 403, Springer-Verlag, pp. 232\u2013243, 1990."},{"key":"28_CR18","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1109\/HPC.2000.843508","volume":"2","author":"C. Popescu","year":"2000","unstructured":"C. Popescu, \u201cAn identification scheme based on the elliptic curve discrete logarithm problem\u201d, IEEE High Performance Computing in the Asia-Pacific Region, Volume: 2, pp. 624\u2013625, 2000.","journal-title":"IEEE High Performance Computing in the Asia-Pacific Region"},{"key":"28_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/3-540-48184-2_5","volume-title":"Advances in Cryptology \u2014 Crypto\u2019 87","author":"A.D. Santis","year":"1988","unstructured":"A.D. Santis, S. Micali, and G. Persiano, \u201cNon-interactive zero-knowledge proof systems\u201d, Advances in Cryptology \u2014 Crypto\u2019 87, LNCS 293, pp. 52\u201372, 1988."},{"key":"28_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/3-540-68697-5_12","volume-title":"Advances in Cryptology \u2014 Crypto\u2019 96","author":"C. Schnorr","year":"1996","unstructured":"C. Schnorr, \u201cSecurity of 2t-root identification and signatures\u201d, Advances in Cryptology \u2014 Crypto\u2019 96, LNCS 1109, Springer-Verlag, pp. 143\u2013156, 1996."},{"key":"28_CR21","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s001459900056","volume":"12","author":"V. Shoup","year":"1999","unstructured":"V. Shoup, \u201cOn the security of a practical identification scheme\u201d, J. Cryptology 12: 247\u2013260, 1999.","journal-title":"J. Cryptology"},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"J. H. Silverman, \u201cThe arithmetic of elliptic curves\u201d, Springer-Verlag, GTM 106, 1986.","DOI":"10.1007\/978-1-4757-1920-8"},{"key":"28_CR23","first-page":"236","volume-title":"Cryptography: Theory and Practice","author":"D.R. Stinson","year":"1995","unstructured":"D.R. Stinson, \u201cCryptography: Theory and Practice\u201d, CRC Press, Boca Raton, Florida, pp. 236, 1995."},{"key":"28_CR24","unstructured":"T. Yamanaka, R. Sakai, and M. Kasahara, \u201cFast computation of pairings over elliptic curves\u201d, Proc. of SCIS 2002, pp. 709\u2013714, Jan. 29\u2013Feb. 1, 2002, Shirahama, Japan."}],"container-title":["Lecture Notes in Computer Science","Information Security and Privacy"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45450-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T05:39:32Z","timestamp":1556429972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45450-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540438618","9783540454502"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45450-0_28","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}