{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T04:15:41Z","timestamp":1778040941080,"version":"3.51.4"},"reference-count":14,"publisher":"International Association for Cryptologic Research","issue":"1","license":[{"start":{"date-parts":[[2026,1,4]],"date-time":"2026-01-04T00:00:00Z","timestamp":1767484800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IACR CiC"],"accepted":{"date-parts":[[2026,4,24]]},"abstract":"<jats:p>Abstract removed due to JATS parsing error<\/jats:p>","DOI":"10.62056\/a69qgy10k","type":"journal-article","created":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T18:09:08Z","timestamp":1777918148000},"update-policy":"https:\/\/doi.org\/10.62056\/adfjwm02dj","source":"Crossref","is-referenced-by-count":0,"title":["Building Hard Problems by Combining Easy Ones, Revisited"],"prefix":"10.62056","volume":"3","author":[{"given":"Yael","family":"Eisenberg","sequence":"first","affiliation":[{"id":[{"id":"https:\/\/ror.org\/05bnh6r87","id-type":"ROR","asserted-by":"publisher"}],"name":"Cornell University","place":["300 Day Hall, 10 East Avenue, Ithaca, 14853, USA"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher","family":"Havens","sequence":"additional","affiliation":[{"name":"Department of Computer Science, UCLA; Washington Corrections Center; and Prison Mathematics Project","place":["USA"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6888-5296","authenticated-orcid":false,"given":"Alexis","family":"Korb","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/046rm7j60","id-type":"ROR","asserted-by":"publisher"}],"name":"UCLA","place":["405 Hilgard Avenue, Los Angeles, 90095, USA"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elio","family":"Merolle","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/046rm7j60","id-type":"ROR","asserted-by":"publisher"}],"name":"UCLA","place":["405 Hilgard Avenue, Los Angeles, 90095, USA"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2216-9600","authenticated-orcid":false,"given":"Amit","family":"Sahai","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/046rm7j60","id-type":"ROR","asserted-by":"publisher"}],"name":"UCLA","place":["405 Hilgard Avenue, Los Angeles, 90095, USA"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"48349","published-online":{"date-parts":[[2026,5,4]]},"reference":[{"key":"ref1:goldwasser2019probabilistic","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1145\/3335741.3335749","article-title":"Probabilistic encryption & how to play mental poker keeping\n  secret all partial information","author":"Shafi Goldwasser","year":"2019"},{"key":"ref2:yao1982protocols","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1109\/SFCS.1982.38","article-title":"Protocols for secure computations","author":"Andrew C Yao","year":"1982"},{"key":"ref3:blummicali1984","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","article-title":"How to Generate Cryptographically Strong Sequences of\n  Pseudorandom Bits","volume":"13","author":"Manuel Blum","year":"1984","journal-title":"SIAM Journal on Computing"},{"key":"ref4:shannon1949synthesis","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/j.1538-7305.1949.tb03624.x","article-title":"The synthesis of two-terminal switching circuits","volume":"28","author":"Claude E Shannon","year":"1949","journal-title":"The Bell System Technical Journal"},{"key":"ref5:goldreich2001foundations","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546891","volume-title":"Foundations of Cryptology: Basic Tools","author":"Oded Goldreich","year":"2001"},{"key":"ref6:ISIT:GhosalS23","doi-asserted-by":"publisher","first-page":"1770","DOI":"10.1109\/ISIT54713.2023.10206689","article-title":"Building Hard Problems by Combining Easy Ones","author":"Riddhi Ghosal","year":"2023"},{"key":"ref7:C:GBJMS23","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"628","DOI":"10.1007\/978-3-031-38548-3_21","article-title":"Revisiting the Indifferentiability of the Sum of\n  Permutations","volume":"14083","author":"Aldo Gunsing","year":"2023"},{"key":"ref8:C:Gunsing22","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-031-15985-5_8","article-title":"Block-Cipher-Based Tree Hashing","volume":"13510","author":"Aldo Gunsing","year":"2022"},{"key":"ref9:EC:BhaNan18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-319-78381-9_15","article-title":"Full Indifferentiable Security of the Xor of Two or More\n  Random Permutations Using the $\\chi^2$ Method","volume":"10820","author":"Srimanta Bhattacharya","year":"2018"},{"key":"ref10:ACNS:MenPre15","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/978-3-319-28166-7_30","article-title":"On the XOR of Multiple Random Permutations","volume":"9092","author":"Bart Mennink","year":"2015"},{"key":"ref11:INDOCRYPT:ManPatNac10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-642-17401-8_6","article-title":"Indifferentiability beyond the Birthday Bound for the Xor of\n  Two Public Random Permutations","volume":"6498","author":"Avradip Mandal","year":"2010"},{"key":"ref12:TCC:MauRenHol04","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/978-3-540-24638-1_2","article-title":"Indifferentiability, Impossibility Results on Reductions,\n  and Applications to the Random Oracle Methodology","volume":"2951","author":"Ueli M. Maurer","year":"2004"},{"key":"ref13:EC:DacKatThi16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/978-3-662-49896-5_23","article-title":"10-Round Feistel is Indifferentiable from an Ideal\n  Cipher","volume":"9666","author":"Dana Dachman-Soled","year":"2016"},{"key":"ref14:mitzenmacher2005probability","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing: Randomized Algorithms and\n  Probabilistic Analysis","author":"Michael Mitzenmacher","year":"2005"}],"container-title":["IACR Communications in Cryptology"],"original-title":[],"language":"en","deposited":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T04:01:46Z","timestamp":1778040106000},"score":1,"resource":{"primary":{"URL":"https:\/\/cic.iacr.org\/p\/3\/1\/9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,4]]},"references-count":14,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,5,4]]}},"URL":"https:\/\/doi.org\/10.62056\/a69qgy10k","archive":["Internet Archive","Internet Archive"],"relation":{},"ISSN":["3006-5496"],"issn-type":[{"value":"3006-5496","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,4]]},"assertion":[{"value":"2026-01-04","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-04-24","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"cc3-1-10"}}