{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:14:29Z","timestamp":1725488069600},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540006466"},{"type":"electronic","value":"9783540365044"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36504-4_12","type":"book-chapter","created":{"date-parts":[[2007,7,20]],"date-time":"2007-07-20T18:48:45Z","timestamp":1184957325000},"page":"152-167","source":"Crossref","is-referenced-by-count":4,"title":["An Improved Fast Signature Scheme without Online Multiplication"],"prefix":"10.1007","author":[{"given":"Takeshi","family":"Okamoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mitsuru","family":"Tada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atsuko","family":"Miyaji","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lect Notes Comput Sci","first-page":"311","volume-title":"Advances in cryptology-Crypto\u201986","author":"P. Barrett","year":"1987","unstructured":"P. Barrett: \u201cImplementing of the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor\u201d, Advances in cryptology-Crypto\u201986, Lecture Notes in Computer Science 263, Springer-Verlag, pp. 311\u2013323, 1987."},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"M. Bellare and P. Rogaway: \u201cRandom oracles are practical: a paradigm for designing efficient protocols\u201d, Proceedings of the 1st ACM Conference on Computer and Communications Security (CCS), 1993.","DOI":"10.1145\/168588.168596"},{"key":"12_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/3-540-39118-5_19","volume-title":"Advances in cryptology-Eurocrypt\u201987","author":"I. Damg\u00e5rd","year":"1988","unstructured":"I. Damg\u00e5rd: \u201cCollision free hash functions and public key signature schemes\u201d, Advances in cryptology-Eurocrypt\u201987, Lecture Notes in Computer Science 304, Springer-Verlag, pp. 203\u2013216, 1988."},{"key":"12_CR4","series-title":"Lect Notes Comput Sci","first-page":"186","volume-title":"Advances in cryptology-Crypto\u201986","author":"A. Fiat","year":"1987","unstructured":"A. Fiat and A. Shamir: \u201cHow to Prove Yourself: practical solutions of identification and signature problems\u201d, Advances in cryptology-Crypto\u201986, Lecture Notes in Computer Science 263, Springer-Verlag, pp. 186\u2013194, 1987."},{"key":"12_CR5","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, Journal of cryptology, vol.1, pp. 77\u201395, 1988.","journal-title":"Journal of cryptology"},{"key":"12_CR6","series-title":"Lect Notes Comput Sci","first-page":"490","volume-title":"Advances in cryptology-Eurocrypt\u201991","author":"M. Girault","year":"1992","unstructured":"M. Girault: \u201cSelf-certified public keys\u201d, Advances in cryptology-Eurocrypt\u201991, Lecture Notes in Computer Science 547, Springer-Verlag, pp. 490\u2013497, 1992."},{"key":"12_CR7","series-title":"Lect Notes Comput Sci","first-page":"216","volume-title":"Advances in cryptology-Crypto\u201988","author":"L. C. Guillou","year":"1989","unstructured":"L. C. Guillou and J. J. Quisquater: \u201cA\u2019 paradoxal\u2019 identity-based signature scheme resulting from zero-knowledge\u201d, Advances in cryptology-Crypto\u201988, Lecture Notes in Computer Science 403, Springer-Verlag, pp. 216\u2013231, 1989."},{"key":"12_CR8","first-page":"595","volume":"7","author":"A. Karatsuba","year":"1963","unstructured":"A. Karatsuba and Yu. Ofman: \u201cMultiplication of multidigit numbers on automata\u201d, Soviet Physics-Koklady, vol.7, pp. 595\u2013596, 1963.","journal-title":"Soviet Physics-Koklady"},{"key":"12_CR9","unstructured":"D. E. Knuth: \u201cSeminumerical Algorithms\u201d, The art of computer programming, vol.2, Second edition, Addison-Wesley, 1981."},{"key":"12_CR10","unstructured":"D. E. Knuth: \u201cSorting and Searching\u201d, The art of computer programming, vol.3, Second edition, Addison-Wesley, 1998."},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"519","DOI":"10.2307\/2007970","volume":"44","author":"P. Montgomery","year":"1985","unstructured":"P. Montgomery: \u201cModular multiplication without trial division\u201d, Mathematics of computation, vol.44, pp. 519\u2013521, 1985.","journal-title":"Mathematics of computation"},{"key":"12_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0053426","volume-title":"Advances in cryptology-Eurocrypt\u201994","author":"D. Naccache","year":"1995","unstructured":"D. Naccache, D. M\u2019raihi, S. Vaudenay and D. Raphaeli: \u201cCan DSA be improved?\u201d, Advances in cryptology-Eurocrypt\u201994, Lecture Notes in Computer Science 950, 1995."},{"key":"12_CR13","unstructured":"National Institute of Standards and Technology (NIST): \u201cSecure hash standards (SHS)\u201d, Federal Information Processing Standards, 1995."},{"key":"12_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/BFb0055741","volume-title":"Advances in cryptology-Crypto\u2019 98","author":"K. Ohta","year":"1998","unstructured":"K. Ohta and T. Okamoto: \u201cOn Concrete Security Treatment of Signatures Derived from Identification\u201d, Advances in cryptology-Crypto\u2019 98, Lecture Notes in Computer Science 1462, pp. 354\u2013369, 1998."},{"issue":"8","key":"12_CR15","first-page":"2123","volume":"42","author":"T. Okamoto","year":"2001","unstructured":"T. Okamoto, M. Tada and A. Miyaji \u201cProposal of Efficient Signature Schemes based on Factoring\u201d, Trans. IPSJ, Vol.42 No. 8, pp. 2123\u20132133, 2001.","journal-title":"Trans. IPSJ"},{"key":"12_CR16","series-title":"Lect Notes Comput Sci","volume-title":"Advances in cryptology-PKC\u201900","author":"D. Pointcheval","year":"2000","unstructured":"D. Pointcheval: \u201cThe Composite Discrete Logarithm and Secure Authentication\u201d, Advances in cryptology-PKC\u201900, Lecture Notes in Computer Science 1751, 2000."},{"issue":"3","key":"12_CR17","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s001450010003","volume":"13","author":"D. Pointcheval","year":"2000","unstructured":"D. Pointcheval and J. Stern: \u201cSecurity arguments for digital signatures and blind signatures\u201d, Journal of cryptology, vol.13, no.3, Springer-Verlag, pp. 361\u2013396, 2000.","journal-title":"Journal of cryptology"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"918","DOI":"10.2307\/2006496","volume":"32","author":"J. Pollard","year":"1978","unstructured":"J. Pollard: \u201cMonte Carlo methods for index computation mod p\u201d, Mathematics of Computation, vol 32, pp. 918\u2013924, 1978.","journal-title":"Mathematics of Computation"},{"key":"12_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/BFb0054143","volume-title":"Advances in cryptology-Eurocrypt\u201998","author":"G. Poupard","year":"1998","unstructured":"G. Poupard and J. Stern: \u201cSecurity analysis of a practical\u2019 on the fly\u2019 authentication and signature generation\u201d, Advances in cryptology-Eurocrypt\u201998, Lecture Notes in Computer Science 1403, Springer-Verlag, pp. 422\u2013436, 1998."},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"G. Poupard and J. Stern: \u201cOn the fly signatures based on factoring\u201d, Proceedings of the 6th ACM Conference on Computer and Communications Security (CCS), pp. 48\u201357, 1999.","DOI":"10.1145\/319709.319715"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"R. L. Rivest: \u201cThe MD5 message-digest algorithm\u201d, Internet Request for Comments, RFC 1321, 1992.","DOI":"10.17487\/rfc1321"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C. P. Schnorr","year":"1991","unstructured":"C. P. Schnorr: \u201cEfficient signature generation by smart cards\u201d, Journal of cryptology, vol.4, Springer-Verlag, pp. 161\u2013174, 1991.","journal-title":"Journal of cryptology"}],"container-title":["Lecture Notes in Computer Science","Financial Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36504-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T11:00:46Z","timestamp":1556708446000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36504-4_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540006466","9783540365044"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-36504-4_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}