{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:36:33Z","timestamp":1773376593518,"version":"3.50.1"},"reference-count":32,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206689","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"1770-1775","source":"Crossref","is-referenced-by-count":0,"title":["Building Hard Problems by Combining Easy Ones"],"prefix":"10.1109","author":[{"given":"Riddhi","family":"Ghosal","sequence":"first","affiliation":[{"name":"UCLA"}]},{"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[{"name":"UCLA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46447-2_33"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237838"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/sfcs.2003.1238204"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44647-8_1"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/168588.168596"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48329-2_24"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3335741.3335751"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28628-8_3"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19571-6_16"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_23"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3549993.3550007"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(80)90134-9"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374407"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40041-4_5"},{"key":"ref15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptology: Basic Tools.","author":"Goldreich","year":"2001"},{"key":"ref16","article-title":"How to prove all NP-statements in zero-knowledge, and a methodology of cryptographic protocol design","volume-title":"Advances in Cryptology - CRYPTO\u201986, volume 263 of Lecture Notes in Computer Science, pages 171-185, Santa Barbara, CA, USA","author":"Goldreich","year":"1987"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3335741.3335749"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451093"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_43"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24638-1_2"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055737"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26948-7_4"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1944-08111-1"},{"key":"ref24","article-title":"Digitalized signatures and public-key functions as intractable as factorization","author":"Rabin","year":"1979","journal-title":"Technical report, Massachusetts Inst of Tech Cambridge Lab for Computer Science"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1568318.1568324"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/359340.359342"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1949.tb03624.x"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365700"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02460-7"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1112\/plms\/s2-45.1.161"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64375-1_8"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206689.pdf?arnumber=10206689","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:26:45Z","timestamp":1773347205000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206689\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206689","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}