{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T17:12:05Z","timestamp":1658337125988},"reference-count":0,"publisher":"Privacy Enhancing Technologies Symposium Advisory Board","issue":"2","license":[{"start":{"date-parts":[[2015,6,1]],"date-time":"2015-06-01T00:00:00Z","timestamp":1433116800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,6,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Confidential Content-Based Publish\/Subscribe (C-CBPS) is an interaction model that allows parties to exchange content while protecting their security and privacy interests. In this paper we advance the state of the art in C-CBPS by showing how all predicate circuits in NC<jats:sup>1<\/jats:sup> (logarithmic-depth, bounded fan-in) can be confidentially computed by a broker while guaranteeing perfect information-theoretic security. Previous work could handle only strictly shallower circuits (e.g. those with depth <jats:italic>O<\/jats:italic>(\u2111)). We present three protocols\u2014UGP-Match, FSGP-Match and OFSGP-Match\u2014based on 2-decomposable randomized encodings of group programs for circuits in NC<jats:sup>1<\/jats:sup>. UGP-Match is conceptually simple and has a clean proof of correctness but its running time is a polynomial with a high exponent and hence impractical. FSGP-Match uses a \u201cfixed structure\u201d construction that reduces the exponent drastically and achieves efficiency and scalability. OFSGP-Match optimizes the group programs further to shave off a linear factor.<\/jats:p>","DOI":"10.1515\/popets-2015-0013","type":"journal-article","created":{"date-parts":[[2015,6,24]],"date-time":"2015-06-24T17:02:48Z","timestamp":1435165368000},"page":"244-262","source":"Crossref","is-referenced-by-count":0,"title":["Secure and scalable match: overcoming the universal circuit bottleneck using group programs"],"prefix":"10.56553","volume":"2015","author":[{"given":"Rajesh","family":"Krishnan","sequence":"first","affiliation":[{"name":"Cosocket LLC"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravi","family":"Sundaram","sequence":"additional","affiliation":[{"name":"Northeastern University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"35752","published-online":{"date-parts":[[2015,6,22]]},"container-title":["Proceedings on Privacy Enhancing Technologies"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/content.sciendo.com\/view\/journals\/popets\/2015\/2\/article-p244.xml","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.sciendo.com\/article\/10.1515\/popets-2015-0013","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T16:29:11Z","timestamp":1658334551000},"score":1,"resource":{"primary":{"URL":"https:\/\/petsymposium.org\/popets\/2015\/popets-2015-0013.php"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6,1]]},"references-count":0,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2015,6,22]]},"published-print":{"date-parts":[[2015,6,1]]}},"alternative-id":["10.1515\/popets-2015-0013"],"URL":"https:\/\/doi.org\/10.1515\/popets-2015-0013","relation":{},"ISSN":["2299-0984"],"issn-type":[{"value":"2299-0984","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,6,1]]}}}