{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T05:30:35Z","timestamp":1746595835545},"publisher-location":"New York, NY","reference-count":2,"publisher":"Springer New York","isbn-type":[{"type":"print","value":"9780387973173"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-387-34805-0_55","type":"book-chapter","created":{"date-parts":[[2007,11,9]],"date-time":"2007-11-09T02:05:53Z","timestamp":1194573953000},"page":"610-611","source":"Crossref","is-referenced-by-count":13,"title":["An Efficient Software Protection Scheme"],"prefix":"10.1007","author":[{"given":"Rafail","family":"Ostrovsky","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"55_CR1","unstructured":"Goldreich, O. \u201cTowards a Theory of Software Protection and simulation by Oblivious RAMs\u201d STOC 87."},{"issue":"2","key":"55_CR2","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, \u201cRelations Among Complexity Measures\u201d JACM, Vol 26, No. 2, 1979, pp. 361\u2013381.","journal-title":"JACM"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 CRYPTO\u2019 89 Proceedings"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-387-34805-0_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T05:28:31Z","timestamp":1619501311000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-387-34805-0_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9780387973173"],"references-count":2,"URL":"https:\/\/doi.org\/10.1007\/0-387-34805-0_55","relation":{},"subject":[]}}