{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T14:23:18Z","timestamp":1785421398819,"version":"3.56.0"},"reference-count":50,"publisher":"International Association for Cryptologic Research","issue":"4","license":[{"start":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T00:00:00Z","timestamp":1757635200000},"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":[[2025,12,2]]},"abstract":"<jats:p>Abstract removed due to JATS parsing error<\/jats:p>","DOI":"10.62056\/ahebnja5","type":"journal-article","created":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T23:39:47Z","timestamp":1767915587000},"update-policy":"https:\/\/doi.org\/10.62056\/adfjwm02dj","source":"Crossref","is-referenced-by-count":0,"title":["Relating Definitions of Computational Differential Privacy in Wider Parameter Regimes"],"prefix":"10.62056","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-7316-9341","authenticated-orcid":false,"given":"Fredrik","family":"Meisingseth","sequence":"first","affiliation":[{"id":[{"id":"https:\/\/ror.org\/00d7xrm67","id-type":"ROR","asserted-by":"publisher"}],"name":"Graz University of Technology","place":["Rechbauerstra\u00dfe 12, Graz, 8010, Austria"]}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1280-6020","authenticated-orcid":false,"given":"Christian","family":"Rechberger","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/00d7xrm67","id-type":"ROR","asserted-by":"publisher"}],"name":"Graz University of Technology","place":["Rechbauerstra\u00dfe 12, Graz, 8010, Austria"]}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"48349","published-online":{"date-parts":[[2026,1,8]]},"reference":[{"key":"ref1:BNO08","isbn-type":"print","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-540-85174-5_25","article-title":"Distributed Private Data Analysis: Simultaneously Solving\n  How and What","author":"Amos Beimel","year":"2008","ISBN":"https:\/\/id.crossref.org\/isbn\/9783540851745"},{"key":"ref2:MPRV09","isbn-type":"print","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-03356-8_8","article-title":"Computational Differential Privacy","author":"Ilya Mironov","year":"2009","ISBN":"https:\/\/id.crossref.org\/isbn\/9783642033568"},{"key":"ref3:GKY11","isbn-type":"print","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-642-19571-6_25","article-title":"Limits of Computational Differential Privacy in the\n  Client\/Server Setting","author":"Adam Groce","year":"2011","ISBN":"https:\/\/id.crossref.org\/isbn\/9783642195716"},{"key":"ref4:BCV16","isbn-type":"print","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1007\/978-3-662-53641-4_23","article-title":"Separating Computational and Statistical Differential\n  Privacy in the Client-Server Model","author":"Mark Bun","year":"2016","ISBN":"https:\/\/id.crossref.org\/isbn\/9783662536414"},{"key":"ref5:Vadhan2017","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-319-57048-8_7","volume-title":"Tutorials on the Foundations of Cryptography: Dedicated to\n  Oded Goldreich","author":"Salil Vadhan","year":"2017"},{"key":"ref6:GIKKM22","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1109\/FOCS57990.2023.00042","article-title":"Towards Separating Computational and Statistical\n  Differential Privacy","author":"Badih Ghazi","year":"2023"},{"key":"ref7:MR24","doi-asserted-by":"publisher","first-page":"420","DOI":"10.56553\/popets-2025-0023","article-title":"SoK: Computational and Distributed Differential Privacy for\n  MPC","author":"Fredrik Meisingseth","year":"2025"},{"key":"ref8:HMSTY25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-032-01884-7_6","article-title":"Computationally Differentially Private Inner-Product\n  Protocols Imply Oblivious Transfer","volume":"16003","author":"Iftach Haitner","year":"2025"},{"key":"ref9:Goldreich04","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"The Foundations of Cryptography - Volume 2: Basic\n  Applications","author":"Oded Goldreich","year":"2004","ISBN":"https:\/\/id.crossref.org\/isbn\/0521830842"},{"key":"ref10:CDN15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107337756","volume-title":"Secure Multiparty Computation and Secret Sharing","author":"Ronald Cramer","year":"2015"},{"key":"ref11:MMPRTV11_Long","article-title":"The Limits of Two-Party Differential Privacy","volume":"TR11-106","author":"Andrew McGregor","year":"2011","journal-title":"Electron. Colloquium Comput. Complex."},{"key":"ref12:KAACLMSZ22","volume-title":"Bayesian and Frequentist Semantics for Common Variations of\n  Differential Privacy: Applications to the 2020 Census","author":"Daniel Kifer","year":"2022"},{"key":"ref13:Apple17","volume-title":"Learning with Privacy at Scale","author":"Apple's Differential Privacy Team","year":"2017"},{"key":"ref14:Rappor","series-title":"CCS '14","isbn-type":"print","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1145\/2660267.2660348","article-title":"RAPPOR: Randomized Aggregatable Privacy-Preserving Ordinal\n  Response","author":"\u00dalfar Erlingsson","year":"2014","ISBN":"https:\/\/id.crossref.org\/isbn\/9781450329576"},{"key":"ref15:HK23","volume-title":"Distributed differential privacy for federated learning","author":"Florian Hartmann","year":"2023"},{"key":"ref16:KMSTTX21","series-title":"Proceedings of Machine Learning Research","first-page":"5213","article-title":"Practical and Private (Deep) Learning Without Sampling or\n  Shuffling","volume":"139","author":"Peter Kairouz","year":"2021"},{"key":"ref17:RSPDLKSA21","doi-asserted-by":"publisher","DOI":"10.29012\/jpc.782","article-title":"LinkedIn\u2019s Audience Engagements API: A Privacy Preserving\n  Data Analytics System at Scale","volume":"11","author":"Ryan Rogers","year":"2021","journal-title":"Journal of Privacy and Confidentiality"},{"key":"ref18:DR16","volume-title":"Concentrated Differential Privacy","author":"Cynthia Dwork","year":"2016"},{"key":"ref19:BS16","isbn-type":"print","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/978-3-662-53641-4_24","article-title":"Concentrated Differential Privacy: Simplifications,\n  Extensions, and Lower Bounds","author":"Mark Bun","year":"2016","ISBN":"https:\/\/id.crossref.org\/isbn\/9783662536414"},{"key":"ref20:ODO","series-title":"EUROCRYPT'06","isbn-type":"print","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/11761679_29","article-title":"Our Data, Ourselves: Privacy via Distributed Noise\n  Generation","author":"Cynthia Dwork","year":"2006","ISBN":"https:\/\/id.crossref.org\/isbn\/3540345469"},{"key":"ref21:MRS24","doi-asserted-by":"publisher","first-page":"341","DOI":"10.56553\/popets-2025-0019","article-title":"Practical Two-party Computational Differential Privacy with\n  Active Security","author":"Fredrik Meisingseth","year":"2025"},{"key":"ref22:KIM25","doi-asserted-by":"publisher","DOI":"10.56553\/popets-2025-0003","article-title":"Lightweight Two-Party Secure Sampling Protocol for\n  Differential Privacy","author":"Masanobu Kii","year":"2025","journal-title":"PoPETS"},{"key":"ref23:LUTSamplingCCS","doi-asserted-by":"publisher","first-page":"4649","DOI":"10.1145\/3719027.3744834","article-title":"Secure Noise Sampling for Differentially Private\n  Collaborative Learning","author":"Olive Franzese","year":"2025"},{"key":"ref24:MRS25_LUT","volume-title":"Accelerating Multiparty Noise Generation Using Lookups","author":"Fredrik Meisingseth","year":"2025"},{"key":"ref25:ECLP24","doi-asserted-by":"publisher","first-page":"583","DOI":"10.56553\/POPETS-2024-0131","article-title":"Computational Differential Privacy for Encrypted Databases\n  Supporting Linear Queries","volume":"2024","author":"Ferran Alborch Escobar","year":"2024","journal-title":"Proceedings on Privacy Enhancing Technologies"},{"key":"ref26:ZAS24","doi-asserted-by":"publisher","first-page":"509","DOI":"10.56553\/popets-2024-0061","article-title":"Differentially Private Functional Encryption","volume":"2024","author":"Jasmin Zalonis","year":"2024","journal-title":"Proceedings on Privacy Enhancing Technologies"},{"key":"ref27:BC22","series-title":"CCS '23","isbn-type":"print","doi-asserted-by":"publisher","first-page":"1919","DOI":"10.1145\/3576915.3616681","article-title":"Interactive Proofs For Differentially Private Counting","author":"Ari Biswas","year":"2023","ISBN":"https:\/\/id.crossref.org\/isbn\/9798400700507"},{"key":"ref28:BGKW24","isbn-type":"print","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/978-3-031-68391-6_11","article-title":"Certifying Private Probabilistic Mechanisms","author":"Zo\u00eb Ruha Bell","year":"2024","ISBN":"https:\/\/id.crossref.org\/isbn\/9783031683916"},{"key":"ref29:EIKN23","doi-asserted-by":"publisher","first-page":"4486","DOI":"10.1109\/TDSC.2022.3227568","article-title":"Efficient Noise Generation Protocols for Differentially\n  Private Multiparty Computation","volume":"20","author":"Reo Eriguchi","year":"2023","journal-title":"IEEE Transactions on Dependable and Secure Computing"},{"key":"ref30:BGGKMRS22","series-title":"CCS '22","isbn-type":"print","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1145\/3548606.3559383","article-title":"Distributed, Private, Sparse Histograms in the Two-Server\n  Model","author":"James Bell","year":"2022","ISBN":"https:\/\/id.crossref.org\/isbn\/9781450394505"},{"key":"ref31:Warner65","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1080\/01621459.1965.10480775","article-title":"Randomized Response: A Survey Technique for Eliminating\n  Evasive Answer Bias","volume":"60","author":"Stanley L. Warner","year":"1965","journal-title":"Journal of the American Statistical Association"},{"key":"ref32:RTTV08","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1109\/FOCS.2008.38","article-title":"Dense Subsets of Pseudorandom Sets","author":"Omer Reingold","year":"2008"},{"key":"ref33:GT08","doi-asserted-by":"crossref","first-page":"481","DOI":"10.4007\/annals.2008.167.481","article-title":"The Primes Contain Arbitrarily Long Arithmetic\n  Progressions","volume":"167","author":"Ben Green","year":"2008","journal-title":"Annals of Mathematics","ISSN":"https:\/\/id.crossref.org\/issn\/0003-486X","issn-type":"electronic"},{"key":"ref34:BSW03","isbn-type":"print","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-45198-3_18","article-title":"Computational Analogues of Entropy","author":"Boaz Barak","year":"2003","ISBN":"https:\/\/id.crossref.org\/isbn\/9783540451983"},{"key":"ref35:BG24","isbn-type":"print","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/978-3-031-68400-5_11","article-title":"Amplification of\u00a0Non-interactive Zero Knowledge,\n  Revisited","author":"Nir Bitansky","year":"2024","ISBN":"https:\/\/id.crossref.org\/isbn\/9783031684005"},{"key":"ref36:DP_org","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11681878_14","article-title":"Calibrating Noise to Sensitivity in Private Data Analysis","volume":"3876","author":"Cynthia Dwork","year":"2006"},{"key":"ref37:Dwork06","series-title":"ICALP'06","isbn-type":"print","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11787006_1","article-title":"Differential privacy","author":"Cynthia Dwork","year":"2006","ISBN":"https:\/\/id.crossref.org\/isbn\/3540359079"},{"key":"ref38:DP20","doi-asserted-by":"publisher","first-page":"288","DOI":"10.2478\/popets-2020-0028","article-title":"SoK: Differential privacies","volume":"2020","author":"Damien Desfontaines","year":"2020","journal-title":"Proceedings on Privacy Enhancing Technologies"},{"key":"ref39:IM21","series-title":"Leibniz International Proceedings in Informatics (LIPIcs)","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITCS.2021.2","article-title":"Comparing Computational Entropies Below Majority (Or: When\n  Is the Dense Model Theorem False?)","volume":"185","author":"Russell Impagliazzo","year":"2021","ISBN":"https:\/\/id.crossref.org\/isbn\/9783959771771","ISSN":"https:\/\/id.crossref.org\/issn\/1868-8969","issn-type":"electronic"},{"key":"ref40:HMST22","series-title":"STOC 2022","isbn-type":"print","doi-asserted-by":"publisher","first-page":"1392","DOI":"10.1145\/3519935.3519982","article-title":"On the Complexity of Two-Party Differential Privacy","author":"Iftach Haitner","year":"2022","ISBN":"https:\/\/id.crossref.org\/isbn\/9781450392648"},{"key":"ref41:CKS22","doi-asserted-by":"publisher","DOI":"10.29012\/jpc.784","article-title":"The Discrete Gaussian for Differential Privacy","volume":"12","author":"Clement Canonne","year":"2022","journal-title":"Journal of Privacy and Confidentiality"},{"key":"ref42:JP14","isbn-type":"print","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-642-54242-8_24","article-title":"How to Fake Auxiliary Input","author":"Dimitar Jetchev","year":"2014","ISBN":"https:\/\/id.crossref.org\/isbn\/9783642542428"},{"key":"ref43:Casacuberta_thesis","volume-title":"Finding Simple Models of Complex Objects: From Regularity\n  Lemmas to Algorithmic Fairness (Bachelor's Thesis)","author":"Silvia Casacuberta Puig","year":"2023"},{"key":"ref44:Bellare02","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s00145-002-0116-x","article-title":"A Note on Negligible Functions","volume":"15","author":"Bellare","year":"2002","journal-title":"J. Cryptol.","ISSN":"https:\/\/id.crossref.org\/issn\/0933-2790","issn-type":"electronic"},{"key":"ref45:BU07","volume-title":"On the Security of Protocols with Logarithmic Communication\n  Complexity","author":"Michael Backes","year":"2007"},{"key":"ref46:GIK12","volume-title":"Hardcore Measures , Dense Models and Low Complexity\n  Approximations","author":"Sitanshu Gakkhar","year":"2012"},{"key":"ref47:Zhang11","article-title":"On the query complexity for Showing Dense Model","volume":"TR11-038","author":"Jiapeng Zhang","year":"2011","journal-title":"Electron. Colloquium Comput. Complex."},{"key":"ref48:Watson13","series-title":"ITCS '13","isbn-type":"print","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1145\/2422436.2422484","article-title":"Time hierarchies for sampling distributions","author":"Thomas Watson","year":"2013","ISBN":"https:\/\/id.crossref.org\/isbn\/9781450318594"},{"key":"ref49:RTV04","isbn-type":"print","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24638-1_1","article-title":"Notions of Reducibility between Cryptographic Primitives","author":"Omer Reingold","year":"2004","ISBN":"https:\/\/id.crossref.org\/isbn\/9783540246381"},{"key":"ref50:GGKT05","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/S0097539704443276","article-title":"Bounds on the Efficiency of Generic Cryptographic\n  Constructions","volume":"35","author":"Rosario Gennaro","year":"2005","journal-title":"SIAM Journal on Computing"}],"container-title":["IACR Communications in Cryptology"],"original-title":[],"language":"en","deposited":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T23:41:27Z","timestamp":1767915687000},"score":1,"resource":{"primary":{"URL":"https:\/\/cic.iacr.org\/p\/2\/4\/7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,8]]},"references-count":50,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2026,1,8]]}},"URL":"https:\/\/doi.org\/10.62056\/ahebnja5","archive":["Internet Archive","Internet Archive"],"relation":{},"ISSN":["3006-5496"],"issn-type":[{"value":"3006-5496","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,8]]},"assertion":[{"value":"2025-09-12","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-12-02","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"cc2-4-5"}}