{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:20:20Z","timestamp":1725488420227},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540611868"},{"type":"electronic","value":"9783540683391"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-68339-9_6","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:31:14Z","timestamp":1186363874000},"page":"60-71","source":"Crossref","is-referenced-by-count":1,"title":["Public Key Encryption and Signature Schemes Based on Polynomials over \u2124n"],"prefix":"10.1007","author":[{"given":"J\u00f6rg","family":"Schwenk","sequence":"first","affiliation":[]},{"given":"J\u00f6rg","family":"Eisfeld","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,13]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"M. Ben-Or, Probabilistic Algorithms in Finite Fields. Proc. IEEE FOCS 1981, pp. 394\u2013398.","key":"6_CR1","DOI":"10.1109\/SFCS.1981.37"},{"unstructured":"A. Fiat and M. Naor, Broadcast Encryption. Pre-Proceedings of CRYPTO\u2019 93, 39.1\u201339.10.","key":"6_CR2"},{"issue":"2","key":"6_CR3","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali and R. L. Rivest, A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks. SIAM J. Comput. Vol. 17 No. 2 (1988), pp. 281\u2013308.","journal-title":"SIAM J. Comput."},{"unstructured":"M. O. Rabin, Digital Signatures and Public-Key Functions as Intractable as Factorization. MIT\/LCS\/TR-212, Jan 1979. Cited after B. Schneier.","key":"6_CR4"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1137\/0209024","volume":"9","author":"M. O. Rabin","year":"1980","unstructured":"M. O. Rabin, Probabilistic Algorithms in Finite Fields. SIAM J. Comput. 9(1980), pp. 273\u2013280.","journal-title":"SIAM J. Comput."},{"unstructured":"A. Shamir, On the Generation of Multivariate Polynomials which are Hard to Factor. Preprint.","key":"6_CR6"},{"unstructured":"B. Schneier, Applied Cryptography. Wiley 1993.","key":"6_CR7"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201996"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-68339-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,20]],"date-time":"2019-02-20T22:37:12Z","timestamp":1550702232000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-68339-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540611868","9783540683391"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-68339-9_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1996]]}}}