{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:18:01Z","timestamp":1725488281414},"publisher-location":"New York, NY","reference-count":12,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9780387971964"},{"type":"electronic","value":"9780387347998"}],"license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"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":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/0-387-34799-2_19","type":"book-chapter","created":{"date-parts":[[2007,8,6]],"date-time":"2007-08-06T01:17:36Z","timestamp":1186363056000},"page":"249-255","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Basic Theory of Public and Private Cryptosystems"],"prefix":"10.1007","author":[{"given":"Charles","family":"Rackoff","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,12,1]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0217014","volume":"17","author":"C. H. Bennett","year":"1988","unstructured":"C. H. Bennett, G. Brassard, J. Robert, \u201cPrivacy amplification by public discussion\u201d, SIAM J. on Comput., 17, 1988, 210\u2013229.","journal-title":"SIAM J. on Comput."},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"IT-22","author":"W. Diffie","year":"1976","unstructured":"W. Diffie, M. E. Hellman, \u201cNew directions in cryptography\u201d, IEEE Trans. Informat. Theory, IT-22, 1976, 644\u2013654.","journal-title":"IEEE Trans. Informat. Theory"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser, S. Micali, \u201cHow to construct random functions\u201d, JACM, 33, 1986, 792\u2013807.","journal-title":"JACM"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"S. Goldwasser, S. Micali, \u201cProbabilistic encryption\u201d, J. Comput. System Sci., 28, 1984, 270\u2013299.","journal-title":"J. Comput. System Sci."},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1137\/0217017","volume":"17","author":"S. Goldwasser","year":"1988","unstructured":"S. Goldwasser, S. Micali, R. Rivest, \u201cA digital signature scheme secure against adaptive chosen-message attacks\u201d, SIAM J. on Comput., 17, 1988, 281\u2013308.","journal-title":"SIAM J. on Comput."},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"S. Goldwasser, S. Micali, P. Tong, \u201cWhy and how to establish a private code on a public network\u201d, Proc. 23 IEEE Symp. on Foundations of Computer Science, 1982, 134\u2013144.","DOI":"10.1109\/SFCS.1982.100"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1137\/0217025","volume":"17","author":"S. Micali","year":"1988","unstructured":"S. Micali, C. Rackoff, B Sloan, \u201cThe notion of security for probabilistic cryptosystems\u201d, SIAM J. on Comput., 17, 1988, 412\u2013426.","journal-title":"SIAM J. on Comput."},{"key":"19_CR8","unstructured":"C. Rackoff, Class notes on Cryptography, 1985."},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R.S.A.R. Rivest","year":"1978","unstructured":"[RSA]R. Rivest, A. Shamir, L. Adleman, \u201cA method for obtaining digital signatures and public-key cryptosystems\u201d, Comm. ACM, 21, 1978, 120\u2013126.","journal-title":"Comm. ACM"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"C. E. Shannon","year":"1949","unstructured":"C. E. Shannon, \u201cCommunication theory of secrecy systems\u201d, Bell Syst. Tech. J., vol.28, 1949, 656\u2013715.","journal-title":"Bell Syst. Tech. J."},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"M. Sipser, \u201cA complexity theoretic approach to randomness\u201d, Proc. 15 ACM Symp. on Theory of Computing, 1983, 330\u2013335.","DOI":"10.1145\/800061.808762"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"L. Stockmeyer, \u201cOn approximation algorithms for #P\u201d, SIAM J. on Comput., 14, 1985.","DOI":"10.1137\/0214060"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 88"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-34799-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,12]],"date-time":"2019-12-12T15:27:04Z","timestamp":1576164424000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-34799-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9780387971964","9780387347998"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/0-387-34799-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]},"assertion":[{"value":"1 December 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}