{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,15]],"date-time":"2023-08-15T19:51:52Z","timestamp":1692129112602},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Cryptology"],"published-print":{"date-parts":[[1992,1]]},"DOI":"10.1007\/bf00191320","type":"journal-article","created":{"date-parts":[[2004,8,28]],"date-time":"2004-08-28T00:49:27Z","timestamp":1093654167000},"page":"41-52","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Which new RSA-signatures can be computed from certain given RSA-signatures?"],"prefix":"10.1007","volume":"5","author":[{"given":"Jan-Hendrik","family":"Evertse","sequence":"first","affiliation":[]},{"given":"Eug\u00e8ne","family":"van Heyst","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF00191320_CR1","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1145\/357369.357372","volume":"1","author":"S. Akl","year":"1983","unstructured":"S. Akl and P. Taylor, Cryptographic solution to a problem of access control in a hierarchy, ACM Trans. Comput. Systems\n1 (1983), pp. 239\u2013248.","journal-title":"ACM Trans. Comput. Systems"},{"key":"BF00191320_CR2","doi-asserted-by":"crossref","unstructured":"D. Chaum, H. den Boer, E. van Heyst, S. Mj\u00f8lsnes, and A. Steenbeek, Efficient offline electronic checks, Advances in Cryptology\u2014Eurocrypt '89 (J.-J. Quisquater and J. Vandewalle, eds.), Lecture Notes in Computer Science, vol. 434, Springer-Verlag, Berlin, pp. 294\u2013301.","DOI":"10.1007\/3-540-46885-4_31"},{"key":"BF00191320_CR3","doi-asserted-by":"crossref","unstructured":"D. Chaum and J.-H. Evertse, A secure and privacy-protecting protocol for transmitting personal information between organizations, Advances in Cryptology\u2014Crypto '86 (A. M. Odlyzko, ed.), Lecture Notes in Computer Science, vol. 263, Springer-Verlag, Berlin, pp. 118\u2013167.","DOI":"10.1007\/3-540-47721-7_10"},{"key":"BF00191320_CR4","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","volume":"6","author":"J. Gill","year":"1977","unstructured":"J. Gill, Computational complexity of probabilistic Turing machines, SIAM J. Comput.\n6 (1977), pp. 675\u2013695.","journal-title":"SIAM J. Comput."},{"key":"BF00191320_CR5","doi-asserted-by":"crossref","unstructured":"J. Hastad, On using RSA with low exponent in a public key network, 4Advances in Cryptology\u2014Crypto '85 (H. C. Williams, ed.), Lecture Notes in Computer Science, vol. 218, Springer-Verlag, Berlin, pp. 403\u2013408.","DOI":"10.1007\/3-540-39799-X_29"},{"key":"BF00191320_CR6","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/0208040","volume":"8","author":"R. Kannan","year":"1979","unstructured":"R. Kannan and A. Bachem, Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix, SIAM J. Comput.\n8 (1979), pp. 499\u2013507.","journal-title":"SIAM J. Comput."},{"key":"BF00191320_CR7","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1090\/S0025-5718-1975-0366796-6","volume":"29","author":"J. C. P. Miller","year":"1975","unstructured":"J. C. P. Miller, On factorization, with a suggested new approach, Math. Comp.\n29 (1975), pp. 155\u2013172.","journal-title":"Math. Comp."},{"key":"BF00191320_CR8","doi-asserted-by":"crossref","unstructured":"T. Okamoto and K. Ohta, Disposable zero-knowledge authentications and their applications to untraceable electronic cash, Advances in Cryptology\u2014Crypto '89 (G. Brassard, ed.), Lecture Notes in Computer Science, vol. 435, Springer-Verlag, Berlin, pp. 481\u2013497.","DOI":"10.1007\/0-387-34805-0_43"},{"key":"BF00191320_CR9","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, A method for obtaining digital signatures and public key cryptosystems, Comm. ACM\n21 (1978), pp. 120\u2013126.","journal-title":"Comm. ACM"},{"key":"BF00191320_CR10","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1215\/ijm\/1255631807","volume":"6","author":"J. Rosser","year":"1962","unstructured":"J. Rosser and L. Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois J. Math.\n6 (1962), pp. 64\u201394.","journal-title":"Illinois J. Math."},{"key":"BF00191320_CR11","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/357353.357357","volume":"1","author":"A. Shamir","year":"1983","unstructured":"A. Shamir, On the generation of cryptographically strong pseudorandom sequences, ACM Trans. Computer Systems\n1 (1983), pp. 38\u201344.","journal-title":"ACM Trans. Computer Systems"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00191320.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00191320\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00191320","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00191320.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:23:35Z","timestamp":1586334215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00191320"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,1]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,1]]}},"alternative-id":["BF00191320"],"URL":"https:\/\/doi.org\/10.1007\/bf00191320","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,1]]},"assertion":[{"value":"5 September 1990","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 April 1991","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}