{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T05:30:52Z","timestamp":1737005452005,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540180470"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-47721-7_31","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T10:32:57Z","timestamp":1175769177000},"page":"426-439","source":"Crossref","is-referenced-by-count":5,"title":["Towards a Theory of Software Protection (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Oded","family":"Goldreich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","unstructured":"Aho, A.V., J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley Publ. Co., 1974."},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Ajtai, M., J. Komlos, and E. Szemeredi, \u201cAn O(n\u00b7log n) Sorting Network\u201d, Proc. 15th STOC, 1983, pp. 1\u20139.","DOI":"10.1145\/800061.808726"},{"key":"31_CR3","unstructured":"Alexi, W., B. Chor, O. Goldreich, and C.P. Schnorr, \u201cRSA and Rabin Functions: Certain Parts Are As Hard As The Whole\u201d, to appear in SIAM Jour. on Computing. Extended Abstract in Proc. 25th FOCS, 1984."},{"key":"31_CR4","first-page":"307","volume":"32","author":"K. Batcher","year":"1968","unstructured":"Batcher, K., \u201cSorting Networks and their Applications\u201d, AFIPS Spring Joint Computer Conference, 32, 1968, pp. 307\u2013314.","journal-title":"AFIPS Spring Joint Computer Conference"},{"key":"31_CR5","unstructured":"Best, R., \u201cMicroprocessor for Executing Encrypted Programs\u201d, US Patent 4,168,396. Issued September 1979."},{"key":"31_CR6","unstructured":"Blum, M., unpublished manuscript, 1983."},{"key":"31_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/3-540-39568-7_23","volume-title":"Advances in Cryptology: Proceedings of CRYPTO 84","author":"M. Blum","year":"1985","unstructured":"Blum, M., and S. Goldwasser, \u201cAn Efficient Probabilistic Public-Key Encryption Scheme which Hides All Partial Information\u201d, Advances in Cryptology: Proceedings of CRYPTO 84, Springer Verlag, Lecture Notes in Computer Science (196), 1985, pp. 289\u2013299."},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"Blum, M., and Micali, S., \u201cHow to Generate Cryptographically Strong Sequences of Pseudo-Random Bits\u201d, SIAM Jour. on Computing, Vol. 13, 1984, pp. 850\u2013864.","journal-title":"SIAM Jour. on Computing"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Goldreich, O., S. Goldwasser, and S. Micali, \u201cHow to Construct Random Functions\u201d, Proc. of 25th Symp. on Foundation of Computer Science, 1984, pp. 464\u2013479. To appear in Jour. of ACM.","DOI":"10.1109\/SFCS.1984.715949"},{"issue":"2","key":"31_CR10","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser S., and S. Micali, \u201cProbabilistic Encryption\u201d, Jour. of Computer and System Science, Vol. 28, No. 2, 1984, pp. 270\u2013299.","journal-title":"Jour. of Computer and System Science"},{"key":"31_CR11","unstructured":"Kent, S.T., \u201cProtecting Externally Supplied Software in Small Computers\u201d, Ph.D. Thesis, MIT\/LCS\/TR-255, 1980."},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Luby, M., and C. Rackoff, \u201cPseudo-random Permutation Generators and Cryptographic Composition\u201d, Proc. of 18th STOC, 1986, pp. 356\u2013363.","DOI":"10.1145\/12130.12167"},{"issue":"2","key":"31_CR13","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1145\/322123.322138","volume":"26","author":"N. Pippenger","year":"1979","unstructured":"Pippenger, N., and M.J. Fischer, \u201cRelation Among Complexity Measures\u201d, Jour. of ACM, Vol. 26, No. 2, 1979, pp. 361\u2013381.","journal-title":"Jour. of ACM"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Yao, A.C., \u201cTheory and Applications of Trapdoor Functions\u201d, Proc. of the 23rd IEEE Symp. on Foundation of Computer Science, 1982, pp. 80\u201391.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 86"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47721-7_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T14:26:34Z","timestamp":1736951194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47721-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540180470"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-47721-7_31","relation":{},"subject":[]}}