{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:59:50Z","timestamp":1725490790541},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540535874"},{"type":"electronic","value":"9783540468776"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-46877-3_8","type":"book-chapter","created":{"date-parts":[[2007,9,2]],"date-time":"2007-09-02T21:34:21Z","timestamp":1188768861000},"page":"83-97","source":"Crossref","is-referenced-by-count":4,"title":["Which new RSA signatures can be computed from some given RSA signatures?"],"prefix":"10.1007","author":[{"given":"Jan-Hendrik","family":"Evertse","sequence":"first","affiliation":[]},{"given":"Eug\u00e8ne","family":"van Heyst","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,5,18]]},"reference":[{"key":"8_CR1","series-title":"Lect Notes Comput Sci","volume-title":"Efficient Offline Electronic Checks","author":"D. Chaum","year":"1989","unstructured":"David Chaum, Bert den Boer, Eug\u00e8ne van Heyst, Stig Mj\u00f8lsnes and Adri Steenbeek, \u201cEfficient Offline Electronic Checks\u201d, to appear in Advances in Cryptology-EUROCRYPT\u2019 89, Lecture Notes in Computer Science, Springer-Verlag."},{"key":"8_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/3-540-47721-7_10","volume-title":"Advances in Cryptology-CRYPTO\u2019 86","author":"D. Chaum","year":"1986","unstructured":"David Chaum and Jan-Hendrik Evertse, \u201cA secure and privacy-protecting protocol for transmitting personal information between organizations\u201d, Advances in Cryptology-CRYPTO\u2019 86, A.M. Odlyzko ed., Lecture Notes in Computer Science 263, Springer-Verlag,. pp 118\u2013167."},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1137\/0206049","volume":"6","author":"J. Gill","year":"1977","unstructured":"John Gill, \u201cComputational Complexity of Probabilistic Turing Machines\u201d, SIAM L. Comp.\n                  6 (1977) pp. 675\u2013695.","journal-title":"SIAM L. Comp."},{"key":"8_CR4","series-title":"Lect Notes Comput Sci","first-page":"403","volume-title":"Advances in Cryptology-CRYPTO\u2019 85","author":"J. Hastad","year":"1985","unstructured":"Johan Hastad, \u201cOn using RSA with low exponent in a public key network\u201d, Advances in Cryptology-CRYPTO\u2019 85, H.C. Williams ed., Lecture Notes in Computer Science 218, Springer-Verlag,.pp403\u2013408."},{"key":"8_CR5","first-page":"1","volume":"14","author":"I. Heger","year":"1858","unstructured":"I. Heger, \u201c\u00dcber die Aufl\u00f6sung eines Systemes von mehreren unbestimmten Gleichungen des ersten Grades in ganzen Zahlen\u201d, Denkschriften der K\u00f6niglichen Akademie der Wissenschaften (Wien), Mathematischnaturwissenschaftliche Klasse\n                  14 (2. Abth.) (1858) pp1\u2013122.","journal-title":"Denkschriften der K\u00f6niglichen Akademie der Wissenschaften (Wien), Mathematischnaturwissenschaftliche Klasse"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/0208040","volume":"8","author":"R. Kannan","year":"1979","unstructured":"R. Kannan and A. Bachem, \u201cPolynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix\u201d, SIAM Journal on Computing, 8 (1979) pp 499\u2013507.","journal-title":"SIAM Journal on Computing"},{"key":"8_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash","author":"T. Okamoto","year":"1989","unstructured":"Tatsuaki Okamoto and Kazuo Ohta, \u201cDisposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash\u201d, to appear in Advances in Cryptology-CRYPTO\u2019 89, Lecture Notes in Computer Science, Springer-Verlag."},{"key":"8_CR8","doi-asserted-by":"publisher","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 for Obtaining Digital Signatures and Public Key Cryptosystems\u201d, Comm. of the ACM\n                  21 (1978) pp 120\u2013126.","journal-title":"Comm. of the ACM"},{"key":"8_CR9","unstructured":"Alexander Schrijver, Theory of Linear and Integer Programming, John Wiley & Sons, 1986."},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1145\/357353.357357","volume":"1","author":"A. Shamir","year":"1983","unstructured":"Adi Shamir, \u201cOn the Generation of Cryptographically Strong Pseudorandom Sequences\u201d, ACM Trans. on Computer Systems, 1 (1983) pp 38\u201344.","journal-title":"ACM Trans. on Computer Systems"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201990"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46877-3_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T05:39:23Z","timestamp":1550900363000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46877-3_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540535874","9783540468776"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-46877-3_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}