{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:12:38Z","timestamp":1725541958935},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642108679"},{"type":"electronic","value":"9783642108686"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10868-6_19","type":"book-chapter","created":{"date-parts":[[2009,12,2]],"date-time":"2009-12-02T05:17:15Z","timestamp":1259731035000},"page":"326-335","source":"Crossref","is-referenced-by-count":2,"title":["Comparing with RSA"],"prefix":"10.1007","author":[{"given":"Julien","family":"Cathalo","sequence":"first","affiliation":[]},{"given":"David","family":"Naccache","sequence":"additional","affiliation":[]},{"given":"Jean-Jacques","family":"Quisquater","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume-title":"Advances in Cryptology - EUROCRYPT \u201996","author":"M. Bellare","year":"1996","unstructured":"Bellare, M., Rogaway, P.: The exact security of digital signatures - How to sign with RSA and Rabin. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol.\u00a01070, pp. 399\u2013416. Springer, Heidelberg (1996)"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/800061.808735","volume-title":"STOC 1983 - Proceedings of the fifteenth annual ACM symposium on the Theory of Computing","author":"M. Ben-Or","year":"1983","unstructured":"Ben-Or, M.: Lower bounds for algebraic computation trees. In: STOC 1983 - Proceedings of the fifteenth annual ACM symposium on the Theory of Computing, pp. 80\u201386. ACM, New York (1983)"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short Signatures from the Weil Pairing. Journal of Cryptology\u00a017, 297\u2013319 (2004)","journal-title":"Journal of Cryptology"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/978-3-540-30580-4_16","volume-title":"Public Key Cryptography - PKC 2005","author":"J. Cathalo","year":"2005","unstructured":"Cathalo, J., Coron, J.-S., Naccache, D.: From fixed-length to arbitrary-length RSA encoding schemes revisited. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol.\u00a03386, pp. 234\u2013243. Springer, Heidelberg (2005)"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1007\/978-3-540-40061-5_12","volume-title":"Advances in Cryptology - ASIACRYPT 2003","author":"D. Clarke","year":"2003","unstructured":"Clarke, D., Devadas, S., van Dijk, M., Gassend, B., Suh, G.: Incremental multiset hash functions and their application to memory integrity checking. In: Laih, C.-S. (ed.) ASIACRYPT 2003. LNCS, vol.\u00a02894, pp. 188\u2013207. Springer, Heidelberg (2003)"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-44448-3_8","volume-title":"Advances in Cryptology - ASIACRYPT 2000","author":"J.-S. Coron","year":"2000","unstructured":"Coron, J.-S., Koeune, F., Naccache, D.: From fixed-length to arbitrary-length RSA padding schemes. In: Okamoto, T. (ed.) ASIACRYPT 2000. LNCS, vol.\u00a01976, pp. 90\u201396. Springer, Heidelberg (2000)"},{"issue":"4","key":"19_CR7","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. Journal of the ACM\u00a033(4), 210\u2013217 (1986)","journal-title":"Journal of the ACM"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"Goldwasser, S., Micali, S., Rivest, R.: A Digital signature scheme secure against adaptive chosen-message attacks. SIAM Journal of computing\u00a017, 281\u2013308 (1988)","journal-title":"SIAM Journal of computing"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/j.ipl.2004.07.006","volume":"92","author":"I. Katriel","year":"2004","unstructured":"Katriel, I.: On the algebraic complexity of set equality and inclusion. Information Processing Letters\u00a092, 175\u2013178 (2004)","journal-title":"Information Processing Letters"},{"issue":"2","key":"19_CR10","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R. Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM\u00a021(2), 120\u2013126 (1978)","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10868-6_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:42:56Z","timestamp":1619782976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10868-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108679","9783642108686"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10868-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}