{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:39:30Z","timestamp":1787337570749,"version":"build-2736575974"},"reference-count":56,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2016,1]]},"abstract":"<jats:p>We construct the first general secure computation protocols that require no trusted infrastructure other than authenticated communication, and that satisfy a meaningful notion of security that is preserved under universal composition---assuming only the existence of enhanced trapdoor permutations. The notion of security fits within a generalization of the \u201cangel-based\u201d framework of Prabhakaran and Sahai [STOC'04, ACM, New York, 2004, pp. 242--251] and implies superpolynomial-time simulation security. Security notions of this kind are currently known to be realizable only under strong and specific hardness assumptions. A key element in our construction is a commitment scheme that satisfies a new and strong notion of security. The notion, security against chosen-commitment attacks (CCA security), means that security holds even if the attacker has access to an extraction oracle that gives the adversary decommitment information to commitments of the adversary's choice. This notion is stronger than concurrent nonmalleability and is of independent interest. We construct CCA-secure commitments based on standard one-way functions, and with no trusted setup. To the best of our knowledge, this provides the first construction of a natural cryptographic primitive having adaptive hardness from standard hardness assumptions, using no trusted setup or public keys.<\/jats:p>","DOI":"10.1137\/110847196","type":"journal-article","created":{"date-parts":[[2016,9,22]],"date-time":"2016-09-22T11:38:14Z","timestamp":1474544294000},"page":"1793-1834","source":"Crossref","is-referenced-by-count":7,"title":["Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions"],"prefix":"10.1137","volume":"45","author":[{"given":"Ran","family":"Canetti","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huijia","family":"Lin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rafael","family":"Pass","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2016,9,22]]},"reference":[{"key":"atypb1","doi-asserted-by":"crossref","unstructured":"B. Barak and A. Sahai,\n                      How to play almost any mental game over the net - concurrent composition via super-polynomial simulation\n                      , in FOCS, IEEE Computer Society, Los Alamitos, CA, 2005, pp. 543-552, http:\/\/dx.doi.org\/10.1109\/SFCS.2005.43 doi:10.1109\/SFCS.2005.43.","DOI":"10.1109\/SFCS.2005.43"},{"key":"atypb2","first-page":"377","author":"Beaver D.","year":"1991","journal-title":"Berlin"},{"key":"atypb3","first-page":"503","author":"Beaver D.","year":"1990","journal-title":"New York"},{"key":"atypb4","first-page":"1","author":"Ben-Or M.","year":"1988","journal-title":"New York"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90005-0"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1007\/s001459910006"},{"key":"atypb7","doi-asserted-by":"crossref","unstructured":"R. Canetti,\n                      Universally composable security: A new paradigm for cryptographic protocols\n                      , in FOCS, IEEE Computer Society, Los Alamitos, CA, 2001, pp. 136-145.","DOI":"10.1109\/SFCS.2001.959888"},{"key":"atypb8","doi-asserted-by":"crossref","unstructured":"R. Canetti,\n                      Universally composable signature, certification, and authentication\n                      , in Proceedings of the 17th IEEE Computer Security Foundations Workshop, 2004, pp. 219-233.","DOI":"10.1109\/CSFW.2004.1310743"},{"key":"atypb9","first-page":"61","author":"Canetti R.","year":"2007","journal-title":"Berlin"},{"key":"atypb10","first-page":"19","author":"Canetti R.","year":"2001","journal-title":"Berlin"},{"key":"atypb11","first-page":"235","author":"Canetti R.","year":"2000","journal-title":"New York"},{"key":"atypb12","first-page":"68","author":"Canetti R.","year":"2003","journal-title":"Berlin"},{"key":"atypb13","first-page":"494","author":"Canetti R.","year":"2002","journal-title":"New York"},{"key":"atypb14","doi-asserted-by":"crossref","unstructured":"Y. Deng, V. Goyal, and A. Sahai,\n                      Resolving the simultaneous resettability conjecture and a new non-black-box simulation strategy\n                      , in FOCS, IEEE Computer Society, Los Alamitos, CA, 2009, pp. 251-260.","DOI":"10.1109\/FOCS.2009.59"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795291562"},{"key":"atypb16","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039489"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1145\/3812.3818"},{"key":"atypb18","first-page":"416","author":"Feige U.","year":"1990","journal-title":"New York"},{"key":"atypb19","first-page":"99","author":"Garg S.","year":"2012","journal-title":"Heidelberg"},{"key":"atypb20","doi-asserted-by":"crossref","unstructured":"O. Goldreich,\n                      Foundations of Cryptography-Basic Tools\n                      , Cambridge University Press, Cambridge, 2001.","DOI":"10.1017\/CBO9780511546891"},{"key":"atypb21","doi-asserted-by":"crossref","unstructured":"O. Goldreich,\n                      Foundations of Cryptography-Basic Applications\n                      , Cambridge University Press, Cambridge, 2004.","DOI":"10.1017\/CBO9780511721656"},{"key":"atypb22","doi-asserted-by":"publisher","DOI":"10.1145\/6490.6503"},{"key":"atypb23","first-page":"218","author":"Goldreich O.","year":"1987","journal-title":"New York"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1145\/116825.116852"},{"key":"atypb25","first-page":"77","author":"Goldwasser S.","year":"1990","journal-title":"New York"},{"key":"atypb26","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"atypb28","first-page":"260","author":"Goyal V.","year":"2015","journal-title":"Heidelberg"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793244708"},{"key":"atypb30","first-page":"572","author":"Ishai Y.","year":"2008","journal-title":"Berlin"},{"key":"atypb31","first-page":"723","author":"Kilian J.","year":"1992","journal-title":"New York"},{"key":"atypb32","first-page":"560","author":"Kilian J.","year":"2001","journal-title":"New York"},{"key":"atypb33","doi-asserted-by":"crossref","unstructured":"S. Kiyoshima,\n                      Round-efficient black-box construction of composable multi-party computation\n                      , in Crypto, Springer, New York, 2014.","DOI":"10.1007\/978-3-662-44381-1_20"},{"key":"atypb34","first-page":"343","author":"Kiyoshima S.","year":"2014","journal-title":"Heidelberg"},{"key":"atypb36","first-page":"189","author":"Lin H.","year":"2009","journal-title":"New York"},{"key":"atypb37","first-page":"461","author":"Lin H.","year":"2012","journal-title":"Berlin"},{"key":"atypb38","first-page":"571","author":"Lin H.","year":"2008","journal-title":"Berlin"},{"key":"atypb39","first-page":"179","author":"Lin H.","year":"2009","journal-title":"New York"},{"key":"atypb40","first-page":"203","author":"Lindell Y.","year":"2004","journal-title":"New York"},{"key":"atypb41","first-page":"343","author":"Malkin T.","year":"2006","journal-title":"Berlin"},{"key":"atypb42","first-page":"392","author":"Micali S.","year":"1991","journal-title":"Berlin"},{"key":"atypb43","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196774"},{"key":"atypb44","first-page":"57","author":"Pandey O.","year":"2008","journal-title":"Berlin"},{"key":"atypb45","first-page":"160","author":"Pass R.","year":"2003","journal-title":"Berlin"},{"key":"atypb46","first-page":"699","author":"Pass R.","year":"2012","journal-title":"Heidelberg"},{"key":"atypb47","unstructured":"R. Pass and A. Rosen,\n                      Bounded-concurrent secure two-party computation in a constant number of rounds\n                      , in FOCS, IEEE Computer Society, Los Alamitos, CA, 2003, pp. 404-413."},{"key":"atypb48","doi-asserted-by":"crossref","unstructured":"R. Pass and A. Rosen,\n                      Concurrent non-malleable commitments\n                      , in FOCS, IEEE Computer Society, Los Alamitos, CA, 2005, pp. 563-572.","DOI":"10.1109\/SFCS.2005.27"},{"key":"atypb49","first-page":"553","author":"Pass R.","year":"2008","journal-title":"Berlin"},{"key":"atypb50","doi-asserted-by":"crossref","unstructured":"B. Pfitzmann and M. Waidner,\n                      A model for asynchronous reactive systems and its application to secure message transmission\n                      , in IEEE Symposium on Security and Privacy, IEEE Computer Society, Los Alamitos, CA, 2001, pp. 184-200.","DOI":"10.1109\/SECPRI.2001.924298"},{"key":"atypb51","doi-asserted-by":"crossref","unstructured":"M. Prabhakaran, A. Rosen, and A. Sahai,\n                      Concurrent zero knowledge with logarithmic round-complexity\n                      , in FOCS, IEEE Computer Society, Los Alamitos, CA, 2002, pp. 366-375.","DOI":"10.1109\/SFCS.2002.1181961"},{"key":"atypb52","first-page":"242","author":"Prabhakaran M.","year":"2004","journal-title":"New York"},{"key":"atypb53","unstructured":"M. O. Rabin,\n                      How to Exchange Secrets with Oblivious Transfer\n                      , Technical report, Harvard University, Cambridge, MA, 1981."},{"key":"atypb54","first-page":"433","author":"Rackoff C.","year":"1991","journal-title":"Berlin"},{"key":"atypb55","first-page":"415","author":"Richardson R.","year":"1999","journal-title":"Berlin"},{"key":"atypb56","first-page":"387","author":"Rompel J.","year":"1990","journal-title":"New York"},{"key":"atypb57","doi-asserted-by":"crossref","unstructured":"A. C.C. Yao,\n                      How to generate and exchange secrets (extended abstract)\n                      , in FOCS, IEEE Computer Society, Los Alamitos, CA, 1986, pp. 162-167.","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/110847196","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:18:02Z","timestamp":1787336282000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/110847196"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1]]},"references-count":56,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["10.1137\/110847196"],"URL":"https:\/\/doi.org\/10.1137\/110847196","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1]]}}}