{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T09:36:51Z","timestamp":1773653811987,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540572206","type":"print"},{"value":"9783540479765","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57220-1_71","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:21:28Z","timestamp":1330240888000},"page":"308-323","source":"Crossref","is-referenced-by-count":24,"title":["Modified Maurer-Yacobi's scheme and its applications"],"prefix":"10.1007","author":[{"given":"Chae Hoon","family":"Lim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pil Joong","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/BF01933190","volume":"20","author":"R. Brent","year":"1980","unstructured":"R.Brent, \u201cAn improved Monte Carlo factoring algorithm,\u201d BIT, 20, 1980, pp.176\u2013184.","journal-title":"BIT"},{"issue":"3","key":"25_CR2","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF00196726","volume":"4","author":"S. Bengio","year":"1991","unstructured":"S.Bengio, G.Brassard, T.G.Desmedt, C.Goutier and J.J.Quisquater, \u201cSecure implementation of identification systems,\u201d J. Cryptology, 4, 3, 1991, pp.175\u2013183.","journal-title":"J. Cryptology"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"J.Boyar, D.Chaum, I.Damgard and T.Pedersen, \u201cConvertible undeniable signatures,\u201d Advances in Cryptology \u2014 Crypto'90, Lecture Notes in Computer Science (LNCS), Vol.537, Springer-Verlag, 1991.","DOI":"10.1007\/3-540-38424-3_14"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"D.Chaum, \u201cZero-knowledge undeniable signatures,\u201d Advances in Cryptology \u2014 Eurocrypt'90, LNCS, Vol.473, Springer-Verlag, 1991, pp.458\u2013464.","DOI":"10.1007\/3-540-46877-3_41"},{"key":"25_CR5","unstructured":"-, \u201cSome weaknesses of \u2018Weaknesses of undeniable signatures',\u201d Advances in Cryptology \u2014 Eurocrypt'91, LNCS, Vol.547, 1991, pp.554\u2013556."},{"key":"25_CR6","doi-asserted-by":"crossref","unstructured":"D.Chaum and H.Antwerpen, \u201cUndeniable signatures,\u201d Advances in Cryptology \u2014 Crypto'89, LNCS, Vol.435, Springer-Verlag, 1990, pp.212\u2013216.","DOI":"10.1007\/0-387-34805-0_20"},{"key":"25_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01840433","volume":"1","author":"D. Coppersmith","year":"1986","unstructured":"D.Coppersmith, A.M.Odlyzko and R.Schroeppel, \u201cDiscrete logarithms in GF(p),\u201d Algorithmica, Vol.1, 1986, pp.1\u201315.","journal-title":"Algorithmica"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Y.Desmedt, C.Goutier and S.Bengio, \u201cSpecial uses and abuses of the Fiat-Shamir passport protocol,\u201d Advances in Cryptology \u2014 Crypto'87, LNCS, Vol.293, Springer-Verlag, 1988, pp.21\u201339.","DOI":"10.1007\/3-540-48184-2_3"},{"issue":"6","key":"25_CR9","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"W.Diffie and M.E.Hellman, \u201cNew directions in cryptography,\u201d IEEE Trans. Inform. Theory, IT-22, 6, 1976, pp.644\u2013654.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"25_CR10","first-page":"205","volume":"547","author":"Y. Desmedt","year":"1991","unstructured":"Y.Desmedt and M.Yung, \u201cWeaknesses of undeniable signature schemes,\u201d Advances in Cryptology \u2014 Eurocrypt'91, LNCS, Vol.547, 1991, pp.205\u2013220.","journal-title":"LNCS"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"L.S.Guillou and J.J.Quisquater, \u201cA practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory,\u201d Advances in Cryptology \u2014 Eurocrypt'88, LNCS, Vol.330, Springer-Verlag, 1988, pp.123\u2013128.","DOI":"10.1007\/3-540-45961-8_11"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"-, \u201cA paradoxical identity-based signature scheme resulting from zeroknowledge,\u201d Advances in Cryptology \u2014 Crypto'88, LNCS, Vol.403, Springer-Verlag, 1989, pp.216\u2013231.","DOI":"10.1007\/0-387-34799-2_16"},{"key":"25_CR13","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"IT-31","author":"T. ElGamal","year":"1985","unstructured":"T.ElGamal, \u201cA public key cryptosystem and a signature scheme based on discrete logarithm,\u201d IEEE Trans. Inform. Theory, IT-31, 1985, pp.469\u2013472.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"25_CR14","doi-asserted-by":"crossref","first-page":"649","DOI":"10.2307\/1971363","volume":"126","author":"H.W. Lenstra","year":"1987","unstructured":"H.W.Lenstra, \u201cFactoring integers with elliptic curves,\u201d Ann. Math., Vol.126, 1987, pp.649\u2013673.","journal-title":"Ann. Math."},{"key":"25_CR15","first-page":"498","volume":"547","author":"U.M. Maurer","year":"1991","unstructured":"U.M.Maurer and Y.Yacobi, \u201cNon-interactive public key cryptography,\u201d Advances in Cryptology \u2014 Eurocrypt'91, LNCS, Vol.547, 1991, pp.498\u2013507.","journal-title":"LNCS"},{"key":"25_CR16","unstructured":"T.Okamoto and K.Otha, \u201cHow to utilize the randomness of the zero-knowledge proofs,\u201d Advances in Cryptology \u2014 Crypto'90, LNCS, Vol.537, Springer-Verlag, 1991."},{"key":"25_CR17","unstructured":"-, \u201cDivertible zero-knowledge interactive proofs and commutative random self-reducibility,\u201d Advances in Cryptology \u2014 Eurocrypt'89, LNCS, Vol.434, Springer-Verlag, 1990, pp.134\u2013149."},{"key":"25_CR18","unstructured":"K.Ohta, T.Okamoto and A.Fujioka, \u201cSecure bit commitment function against divertibility,\u201d Proc. Eurocrypt'92."},{"issue":"No.2","key":"25_CR19","first-page":"290","volume":"7","author":"E. Okamoto","year":"1989","unstructured":"E.Okamoto and K.Tanaka, \u201cIdentity-based information security management system for personal computer networks,\u201d IEEE JSAC, Vol.7, No.2, 1989, pp.290\u2013294.","journal-title":"IEEE JSAC"},{"key":"25_CR20","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1017\/S0305004100049252","volume":"76","author":"J.M. Pollard","year":"1974","unstructured":"J.M.Pollard, \u201cTheorems on factorization and primality testing,\u201d Proc. Cambridge Philos. Soc., Vol.76, 1974, pp.521\u2013528.","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"25_CR21","first-page":"918","volume":"32","author":"J.M. Pollard","year":"1978","unstructured":"-, \u201cMonte Carlo methods for index computation (mod p),\u201d Math. Comp., 32, 1978, pp.918\u2013924.","journal-title":"Math. Comp."},{"key":"25_CR22","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"IT-24","author":"S.C. Pohlig","year":"1978","unstructured":"S.C.Pohlig and M.E.Hellman, \u201cAn improved algorithm for computing logarithms over GF(p) and its cryptographic significance,\u201d IEEE Trans. Inform. Theory, Vol.IT-24, 1978, pp.106\u2013110.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"No.1","key":"25_CR23","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1080\/0161-117891852785","volume":"2","author":"R.L. Rivest","year":"1978","unstructured":"R.L.Rivest, \u201cRemarks on a proposed cryptanalytic attack on the M.I.T. public key cryptosystem,\u201d Cryptologia, Vol.2, No.1, 1978, pp.62\u201365.","journal-title":"Cryptologia"},{"issue":"2","key":"25_CR24","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.L. Rivest","year":"1978","unstructured":"R.L.Rivest, A.Shamir and L.Adleman, \u201cA method of obtaining digital signatures and public key cryptosystem,\u201d Comm. ACM, 21, 2, 1978, pp.120\u2013126.","journal-title":"Comm. ACM"},{"key":"25_CR25","doi-asserted-by":"crossref","unstructured":"C.P.Schnorr, \u201cEfficient identification and signatures for smart cards,\u201d Advances in Cryptology \u2014 Crypto'89, LNCS, Vol.435, Springer-Verlag, 1990, pp.239\u2013252.","DOI":"10.1007\/0-387-34805-0_22"},{"issue":"No.4","key":"25_CR26","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1080\/0161-117791833219","volume":"1","author":"G.J. Simmons","year":"1977","unstructured":"G.J.Simmons and M.J.Norris, \u201cPreliminary comments on the M.I.T. public key cryptosystem,\u201d Cryptologia, Vol.1, No.4, 1977, pp.406\u2013414.","journal-title":"Cryptologia"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 AUSCRYPT '92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57220-1_71.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:00:51Z","timestamp":1619557251000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57220-1_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540572206","9783540479765"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-57220-1_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}