{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:34:59Z","timestamp":1757615699529,"version":"3.44.0"},"reference-count":7,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCR-9009936"],"award-info":[{"award-number":["CCR-9009936"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1992,12]]},"DOI":"10.1016\/0020-0190(92)90104-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:45:40Z","timestamp":1027640740000},"page":"303-306","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the power of two-local random reductions"],"prefix":"10.1016","volume":"44","author":[{"given":"Lance","family":"Fortnow","sequence":"first","affiliation":[]},{"given":"Mario","family":"Szegedy","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90104-4_BIB1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0022-0000(89)90018-4","article-title":"On hiding information from an oracle","volume":"39","author":"Abadi","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(92)90104-4_BIB2","first-page":"37","article-title":"Hiding instances in multi-oracle queries","volume":"415","author":"Beaver","year":"1990"},{"key":"10.1016\/0020-0190(92)90104-4_BIB3","first-page":"62","article-title":"Security with low communication overhead","volume":"537","author":"Beaver","year":"1991"},{"key":"10.1016\/0020-0190(92)90104-4_BIB4","series-title":"Proc. 6th IEEE Structure in Complexity Theory Conf.","first-page":"124","article-title":"On the random-self-reducibility of complete sets","author":"Feigenbaum","year":"1991"},{"key":"10.1016\/0020-0190(92)90104-4_BIB5","series-title":"Proc. 5th IEEE Structure in Complexity Theory Conf.","first-page":"100","article-title":"Lower bounds on random-self-reducibility","author":"Feigenbaum","year":"1990"},{"key":"10.1016\/0020-0190(92)90104-4_BIB6","article-title":"An application of communication complexity to crytography","author":"Yao","year":"1990","journal-title":"Lecture at DIMACS Workshop on Structural Complexity and Crytography"},{"key":"10.1016\/0020-0190(92)90104-4_BIB7","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/0304-3975(83)90020-8","article-title":"Some consequences of nonuniform conditions on uniform classes","volume":"26","author":"Yap","year":"1983","journal-title":"Theoret. Comput. Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019092901044?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019092901044?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T14:58:39Z","timestamp":1757084319000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019092901044"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":7,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["0020019092901044"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90104-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[1992,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On the power of two-local random reductions","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0020-0190(92)90104-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1992 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}