{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T22:43:55Z","timestamp":1776465835888,"version":"3.51.2"},"reference-count":26,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1984,4,1]],"date-time":"1984-04-01T00:00:00Z","timestamp":449625600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10699,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1984,4]]},"DOI":"10.1016\/0022-0000(84)90070-9","type":"journal-article","created":{"date-parts":[[2003,12,3]],"date-time":"2003-12-03T11:59:35Z","timestamp":1070452775000},"page":"270-299","source":"Crossref","is-referenced-by-count":2309,"title":["Probabilistic encryption"],"prefix":"10.1016","volume":"28","author":[{"given":"Shafi","family":"Goldwasser","sequence":"first","affiliation":[]},{"given":"Silvio","family":"Micali","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(84)90070-9_BIB1","series-title":"Proceedings of the 18th Annual IEEE Symposium on Foundations of Computer Science","first-page":"175","article-title":"On taking roots in finite fields","author":"Adleman","year":"1977"},{"key":"10.1016\/0022-0000(84)90070-9_BIB2","series-title":"Proceedings of the 21st IEEE Symposium on the Foundations of Computer Science","first-page":"387","article-title":"On distinguishing prime numbers from composite numbers","author":"Adleman","year":"1980"},{"key":"10.1016\/0022-0000(84)90070-9_BIB3","series-title":"Proceedings of the IEEE, Spring Comp-Con","first-page":"133","article-title":"Coin flipping by telephone","author":"Blum","year":"1982"},{"key":"10.1016\/0022-0000(84)90070-9_BIB4","series-title":"A Simple Secure Pseudo-Random Number Generator","author":"Blum","year":"1982"},{"key":"10.1016\/0022-0000(84)90070-9_BIB5","series-title":"Proceedings of the 23rd IEEE on the Foundations of Computer Science","article-title":"How to generate cryptographically strong sequences of pseudo random bits","author":"Blum","year":"1982"},{"key":"10.1016\/0022-0000(84)90070-9_BIB6","series-title":"Proceedings of the 20th IEEE Symposium on the Foundations of Computer Science","first-page":"383","article-title":"Relativized cryptography","author":"Brassard","year":"1979"},{"key":"10.1016\/0022-0000(84)90070-9_BIB7","series-title":"On computationally secure authentication tags requiring short secret shared keys","author":"Brassard","year":"1982"},{"key":"10.1016\/0022-0000(84)90070-9_BIB8","series-title":"Disquisitiones Arithmeticae","author":"Gauss","year":"1966"},{"issue":"6","key":"10.1016\/0022-0000(84)90070-9_BIB9","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","article-title":"New direction in cryptography","volume":"IT-22","author":"Diffie","year":"1976","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0022-0000(84)90070-9_BIB10","article-title":"A Bit by Bit Secure Public Key Cryptosystem","author":"Goldwasser","year":"1981"},{"key":"10.1016\/0022-0000(84)90070-9_BIB11","series-title":"Proceeding of 14th STOC Conference","article-title":"Probabilistic encryption & how to play mental poker, keeping secret all partial information","author":"Goldwasser","year":"1982"},{"key":"10.1016\/0022-0000(84)90070-9_BIB12","series-title":"Proceedings of the 23rd Symposium on Foundations of Computer Science","article-title":"Why and how to establish a private code in a public network","author":"Goldwasser","year":"1982"},{"key":"10.1016\/0022-0000(84)90070-9_BIB13","article-title":"Probabilistic Encryption: Theory and Applications","author":"Goldwasser","year":"1983"},{"key":"10.1016\/0022-0000(84)90070-9_BIB14","series-title":"Proceedings, 15th STOC","article-title":"Strong signature schemes and authentication","author":"Goldwasser","year":"1983"},{"key":"10.1016\/0022-0000(84)90070-9_BIB15","series-title":"Proceedings of Fifth Manitoba Conference on Numerical Math.","first-page":"49","article-title":"How to factor a number","author":"Guy","year":"1975"},{"key":"10.1016\/0022-0000(84)90070-9_BIB16","volume":"Vol. 2","author":"Knuth","year":"1981"},{"key":"10.1016\/0022-0000(84)90070-9_BIB17","series-title":"Proceeding of the AMS Short Course on Cryptology","article-title":"How to cheat at mental poker","author":"Lipton","year":"1981"},{"key":"10.1016\/0022-0000(84)90070-9_BIB18","doi-asserted-by":"crossref","DOI":"10.1145\/800116.803773","article-title":"Riemann's hypothesis and tests for primality","author":"Miller","year":"1975"},{"key":"10.1016\/0022-0000(84)90070-9_BIB19","series-title":"How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin","author":"Luby","year":"1983"},{"key":"10.1016\/0022-0000(84)90070-9_BIB20","article-title":"Digitalized signatures and public-key functions as intractable as factorization","author":"Rabin","year":"1979","journal-title":"MIT\/ LCS\/TR-212, Technical Memo MIT"},{"key":"10.1016\/0022-0000(84)90070-9_BIB21","doi-asserted-by":"crossref","DOI":"10.1145\/359340.359342","article-title":"A method for obtaining digital signatures and public key cryptosystems","author":"Rivest","year":"1978","journal-title":"Communications of the ACM"},{"key":"10.1016\/0022-0000(84)90070-9_BIB22","article-title":"Mental Poker","author":"Shamir","year":"1978","journal-title":"MIT Technical Report"},{"key":"10.1016\/0022-0000(84)90070-9_BIB23","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","article-title":"Communication theory of secrecy systems","volume":"28","author":"Shannon","year":"1949","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0022-0000(84)90070-9_BIB24","series-title":"Solved and Unsolved Problems in Number Theory","author":"Shanks","year":"1978"},{"key":"10.1016\/0022-0000(84)90070-9_BIB25","series-title":"Proceedings, FOCS","article-title":"Secure one-bit disclosures using a pseudo random number generator","author":"Vazirani","year":"1983"},{"key":"10.1016\/0022-0000(84)90070-9_BIB26","series-title":"Proceedings of the 23rd Symposium on the Foundations of Computer Science","article-title":"On the theory and application of trapdoor functions","author":"Yao","year":"1982"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900709?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900709?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T15:53:51Z","timestamp":1550332431000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000084900709"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,4]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,4]]}},"alternative-id":["0022000084900709"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(84)90070-9","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1984,4]]}}}