{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T02:26:09Z","timestamp":1784255169871,"version":"3.55.0"},"reference-count":30,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[2014,12,3]],"date-time":"2014-12-03T00:00:00Z","timestamp":1417564800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer Security"],"published-print":{"date-parts":[[2016,3,1]]},"abstract":"<jats:p>We introduce a variant of the Universal Composability framework (UC; Canetti, FOCS 2001) that uses symbolic cryptography. Two salient properties of the UC framework are secure composition and the possibility of easily defining security by giving an ideal functionality as specification. These advantages are now also available in a symbolic modeling of cryptography, allowing for a modular analysis of complex protocols.<\/jats:p>\n                  <jats:p>We furthermore introduce a new technique for modular design of protocols that uses UC but avoids the need for powerful cryptographic primitives that often comes with UC protocols; this \u201cvirtual primitives\u201d approach is unique to the symbolic setting and has no counterpart in the original computational UC framework.<\/jats:p>","DOI":"10.3233\/jcs-140523","type":"journal-article","created":{"date-parts":[[2016,3,4]],"date-time":"2016-03-04T09:39:36Z","timestamp":1457084376000},"page":"1-38","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":3,"title":["Symbolic universal composability"],"prefix":"10.1177","volume":"24","author":[{"given":"Florian","family":"B\u00f6hl","sequence":"first","affiliation":[{"name":"Karlsruhe Institute of Technology, Karlsruhe, Germany"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dominique","family":"Unruh","sequence":"additional","affiliation":[{"name":"University of Tartu, Tartu, Estonia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"179","published-online":{"date-parts":[[2014,12,3]]},"reference":[{"key":"ref001","doi-asserted-by":"crossref","unstructured":"[1]M.\u00a0Arapinis, T.\u00a0Chothia, E.\u00a0Ritter and M.\u00a0Ryan, Analysing unlinkability and anonymity using the applied pi calculus, in: CSF 2010, 23rd IEEE Computer Security Foundations Symposium, IEEE, 2010, pp.\u00a0107\u2013121.","DOI":"10.1109\/CSF.2010.15"},{"key":"ref002","doi-asserted-by":"crossref","unstructured":"[2]M.\u00a0Backes, B.\u00a0Pfitzmann and M.\u00a0Waidner, A composable cryptographic library with nested operations, in: Proceedings of the 10th ACM CCS, 2003, pp.\u00a0220\u2013230.","DOI":"10.1145\/948109.948140"},{"key":"ref003","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2007.05.002"},{"key":"ref004","unstructured":"[4]B.\u00a0Barak and A.\u00a0Sahai, How to play almost any mental game over the net \u2013 Concurrent composition via super-polynomial simulation, in: Proceedings of the 46th IEEE Symposium on Foundations of Computer Science (FOCS), 2005, pp.\u00a0543\u2013552."},{"key":"ref005","doi-asserted-by":"crossref","unstructured":"[5]J.\u00a0Bengtson, K.\u00a0Bhargavan, C.\u00a0Fournet, A.D.\u00a0Gordon and S.\u00a0Maffeis, Refinement types for secure implementations, ACM Transactions on Programming Languages and Systems (TOPLAS) 33 (2011), 8.","DOI":"10.1145\/1890028.1890031"},{"key":"ref006","doi-asserted-by":"publisher","DOI":"10.3233\/JCS-2009-0339"},{"key":"ref007","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2007.06.002"},{"key":"ref008","doi-asserted-by":"crossref","unstructured":"[8]E.F.\u00a0Brickell, J.\u00a0Camenisch and L.\u00a0Chen, Direct anonymous attestation, in: Proceedings of the 11th ACM Conference on Computer and Communications Security, ACM Press, 2004, pp.\u00a0132\u2013145.","DOI":"10.1145\/1030083.1030103"},{"key":"ref009","doi-asserted-by":"crossref","unstructured":"[9]R.\u00a0Canetti, Universally composable security: A new paradigm for cryptographic protocols, in: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS), 2001, pp.\u00a0136\u2013145.","DOI":"10.1109\/SFCS.2001.959888"},{"key":"ref010","unstructured":"[10]R.\u00a0Canetti, L.\u00a0Cheung, D.\u00a0Kaynar, M.\u00a0Liskov, N.\u00a0Lynch, O.\u00a0Pereira and R.\u00a0Segala, Task-structured probabilistic I\/O automata, Technical Report MIT-CSAIL-TR-2006-060, MIT CSAIL, 2006, available at: http:\/\/dspace.mit.edu\/handle\/1721.1\/33964."},{"key":"ref011","doi-asserted-by":"crossref","unstructured":"[11]R.\u00a0Canetti, L.\u00a0Cheung, D.\u00a0Kirli Kaynar, M.\u00a0Liskov, N.A.\u00a0Lynch, O.\u00a0Pereira and R.\u00a0Segala, Time-bounded task-PIOAs: A\u00a0framework for analyzing security protocols, in: DISC, 2006, pp.\u00a0238\u2013253.","DOI":"10.1007\/11864219_17"},{"key":"ref012","doi-asserted-by":"crossref","unstructured":"[12]R.\u00a0Canetti, Y.\u00a0Dodis, R.\u00a0Pass and S.\u00a0Walfish, Universally composable security with global setup, in: Proceedings of the 4th Theory of Cryptography Conference (TCC), 2007, pp.\u00a061\u201385.","DOI":"10.1007\/978-3-540-70936-7_4"},{"key":"ref013","doi-asserted-by":"crossref","unstructured":"[13]R.\u00a0Canetti and M.\u00a0Fischlin, Universally composable commitments, in: Advances in Cryptology, Proceedings of CRYPTO 2001, J.\u00a0Kilian, ed. LNCS, Vol.\u00a02139, Springer, 2001, pp.\u00a019\u201340, Full version available at: http:\/\/eprint.iacr.org\/2001\/055.ps.","DOI":"10.1007\/3-540-44647-8_2"},{"key":"ref014","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-009-9055-0"},{"key":"ref015","doi-asserted-by":"crossref","unstructured":"[15]R.\u00a0Canetti and T.\u00a0Rabin, Universal composition with joint state, in: Proceedings of CRYPTO 2003, LNCS, Vol.\u00a02729, Springer, 2003, pp.\u00a0265\u2013281.","DOI":"10.1007\/978-3-540-45146-4_16"},{"key":"ref016","doi-asserted-by":"crossref","unstructured":"[16]R.\u00a0Canetti and M.\u00a0Vald, Universally composable security with local adversaries, in: SCN 2012, I.\u00a0Visconti and R.\u00a0De\u00a0Prisco, eds, LNCS, Vol.\u00a07485, Springer, 2012, pp.\u00a0281\u2013301.","DOI":"10.1007\/978-3-642-32928-9_16"},{"key":"ref017","unstructured":"[17]Cher, Bang bang (my baby shot me down). 7\u201d single, 1966, Written by Sonny Bono, sound sample, available at: http:\/\/en.wikipedia.org\/wiki\/File:Cher-_Bang_Bang_My_Baby_Shot_Me_Down.ogg."},{"key":"ref018","doi-asserted-by":"crossref","unstructured":"[18]V.\u00a0Cheval and B.\u00a0Blanchet, Proving more observational equivalences with ProVerif, in: POST 2013, D.\u00a0Basin and J.\u00a0Mitchell, eds, LNCS, Vol.\u00a07796, Springer, 2013, pp.\u00a0226\u2013246.","DOI":"10.1007\/978-3-642-36830-1_12"},{"key":"ref019","doi-asserted-by":"crossref","unstructured":"[19]A.\u00a0Datta, R.\u00a0K\u00fcsters, J.C.\u00a0Mitchell and A.\u00a0Ramanathan, On the relationships between notions of simulation-based security, in: Theory of Cryptography, Proceedings of TCC 2005, J.\u00a0Kilian, ed. LNCS, Springer, 2005, pp.\u00a0476\u2013494.","DOI":"10.1007\/978-3-540-30576-7_26"},{"key":"ref020","unstructured":"[20]S.\u00a0Delaune, S.\u00a0Kremer and O.\u00a0Pereira, Simulation based security in the applied pi calculus, in: FSTTCS, R.\u00a0Kannan and K.\u00a0Narayan Kumar, eds, LIPIcs, Vol.\u00a04, Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, 2009, pp.\u00a0169\u2013180."},{"key":"ref021","doi-asserted-by":"crossref","unstructured":"[21]D.\u00a0Dolev and A.C.C.\u00a0Yao, On the security of public key protocols (extended abstract), in: FOCS, IEEE, 1981, pp.\u00a0350\u2013357.","DOI":"10.1109\/SFCS.1981.32"},{"key":"ref022","unstructured":"[22]D.\u00a0Hofheinz and V.\u00a0Shoup, GNUC: A new universal composability framework, 2011, Cryptology ePrint Archive: Report 2011\/303."},{"key":"ref023","doi-asserted-by":"crossref","unstructured":"[23]R.\u00a0K\u00fcsters, Simulation-based security with inexhaustible interactive Turing machines, in: CSFW 2006, Computer Security Foundations Workshop, IEEE Computer Society, 2006, pp.\u00a0309\u2013320, Long version available at: Cryptology ePrint Archive: Report 2006\/151.","DOI":"10.1109\/CSFW.2006.30"},{"key":"ref024","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9019-9"},{"key":"ref025","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(95)00144-2"},{"key":"ref026","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-010-9068-8"},{"key":"ref027","doi-asserted-by":"crossref","unstructured":"[27]M.\u00a0Prabhakaran and A.\u00a0Sahai, New notions of security: Achieving universal composability without trusted setup, in: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC), 2004, pp.\u00a0242\u2013251.","DOI":"10.1145\/1007352.1007394"},{"key":"ref028","doi-asserted-by":"crossref","unstructured":"[28]D.\u00a0Unruh, Universally composable quantum multi-party computation, in: Eurocrypt 2010, LNCS, Springer, 2010, pp.\u00a0486\u2013505.","DOI":"10.1007\/978-3-642-13190-5_25"},{"key":"ref029","doi-asserted-by":"crossref","unstructured":"[29]D.\u00a0Unruh, Concurrent composition in the bounded quantum storage model, in: Eurocrypt 2011, May 2011, LNCS, Vol.\u00a06632, Springer, 2011, pp.\u00a0467\u2013486.","DOI":"10.1007\/978-3-642-20465-4_26"},{"key":"ref030","doi-asserted-by":"crossref","unstructured":"[30]D.\u00a0Unruh and J.\u00a0M\u00fcller-Quade, Universally composable incoercibility, in: Crypto 2010, August 2010, LNCS, Vol.\u00a06223, Springer, 2010, pp.\u00a0411\u2013428.","DOI":"10.1007\/978-3-642-14623-7_22"}],"container-title":["Journal of Computer Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JCS-140523","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.3233\/JCS-140523","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JCS-140523","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T20:44:56Z","timestamp":1777495496000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JCS-140523"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,3]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,3,1]]}},"alternative-id":["10.3233\/JCS-140523"],"URL":"https:\/\/doi.org\/10.3233\/jcs-140523","relation":{},"ISSN":["0926-227X","1875-8924"],"issn-type":[{"value":"0926-227X","type":"print"},{"value":"1875-8924","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,3]]}}}