{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T08:37:19Z","timestamp":1773218239536,"version":"3.50.1"},"publisher-location":"Cham","reference-count":70,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030992521","type":"print"},{"value":"9783030992538","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T00:00:00Z","timestamp":1648512000000},"content-version":"vor","delay-in-days":87,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We formalize the simulation paradigm of cryptography in terms of category theory and show that protocols secure against abstract attacks form a symmetric monoidal category, thus giving an abstract model of composable security definitions in cryptography. Our model is able to incorporate computational security, set-up assumptions and various attack models such as colluding or independently acting subsets of adversaries in a modular, flexible fashion. We conclude by using string diagrams to rederive the security of the one-time pad and no-go results concerning the limits of bipartite and tripartite cryptography, ruling out e.g., composable commitments and broadcasting.<\/jats:p>","DOI":"10.1007\/978-3-030-99253-8_9","type":"book-chapter","created":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T20:02:48Z","timestamp":1648497768000},"page":"161-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Categorical composable cryptography"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1911-0093","authenticated-orcid":false,"given":"Anne","family":"Broadbent","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8919-343X","authenticated-orcid":false,"given":"Martti","family":"Karvonen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,29]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","unstructured":"Abramsky, S., Barbosa, R.S., Karvonen, M., Mansfield, S.: A comonadic view of simulation and quantum resources. In: 2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS). IEEE (2019). https:\/\/doi.org\/10.1109\/LICS.2019.8785677","DOI":"10.1109\/LICS.2019.8785677"},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: A general composition theorem for secure reactive systems. In: 1st Theory of Cryptography Conference\u2014TCC 2004. pp. 336\u2013354 (2004). https:\/\/doi.org\/10.1007\/978-3-540-24638-1_19","DOI":"10.1007\/978-3-540-24638-1_19"},{"key":"9_CR3","doi-asserted-by":"publisher","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: The reactive simulatability (RSIM) framework for asynchronous systems. Information and Computation 205(12), 1685\u20131720 (2007). https:\/\/doi.org\/10.1016\/j.ic.2007.05.002","DOI":"10.1016\/j.ic.2007.05.002"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous secure computation. In: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing. pp. 52\u201361 (1993). https:\/\/doi.org\/10.1145\/167088.167109","DOI":"10.1145\/167088.167109"},{"key":"9_CR5","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., Horodecki, M., Leung, D.W., Mayers, D., Oppenheim, J.: The universal composable security of quantum key distribution. In: 2nd Theory of Cryptography Conference\u2014TCC 2005. pp. 386\u2013406 (2005). https:\/\/doi.org\/10.1007\/978-3-540-30576-7_21","DOI":"10.1007\/978-3-540-30576-7_21"},{"key":"9_CR6","unstructured":"Ben-Or, M., Mayers, D.: General security definition and composability for quantum & classical protocols (2004), https:\/\/arxiv.org\/abs\/quant-ph\/0409062"},{"key":"9_CR7","unstructured":"Bennett, C.H., Brassard, G.: Quantum cryptography: Public key distribution and coin tossing. In: International Conference on Computers, Systems and Signal Processing. pp. 175\u2013179 (1984)"},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Biham, E., Boyer, M., Boykin, P.O., Mor, T., Roychowdhury, V.: A proof of the security of quantum key distribution (extended abstract). In: 32nd Annual ACM Symposium on Theory of Computing\u2014STOC 2000. pp. 715 \u2013 724 (2000). https:\/\/doi.org\/10.1145\/335305.335406","DOI":"10.1145\/335305.335406"},{"key":"9_CR9","doi-asserted-by":"publisher","unstructured":"Breiner, S., Kalev, A., Miller, C.A.: Parallel self-testing of the GHZ state with a proof by diagrams. In: Proceedings of QPL 2018. Electronic Proceedings in Theoretical Computer Science, vol.\u00a0287, pp. 43\u201366 (2018). https:\/\/doi.org\/10.4204\/eptcs.287.3","DOI":"10.4204\/eptcs.287.3"},{"key":"9_CR10","doi-asserted-by":"publisher","unstructured":"Breiner, S., Miller, C.A., Ross, N.J.: Graphical methods in device-independent quantum cryptography. Quantum 3, \u00a0146 (2019). https:\/\/doi.org\/10.22331\/q-2019-05-27-146","DOI":"10.22331\/q-2019-05-27-146"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Broadbent, A., Fitzsimons, J., Kashefi, E.: Universal blind quantum computation. In: 50th Annual Symposium on Foundations of Computer Science\u2014FOCS 2009. pp. 517\u2013526 (2009). https:\/\/doi.org\/10.1109\/FOCS.2009.36","DOI":"10.1109\/FOCS.2009.36"},{"key":"9_CR12","doi-asserted-by":"publisher","unstructured":"Camenisch, J., K\u00fcsters, R., Lysyanskaya, A., Scafuro, A.: Practical Yet Composably Secure Cryptographic Protocols (Dagstuhl Seminar 19042). Dagstuhl Reports 9(1), 88\u2013103 (2019). https:\/\/doi.org\/10.4230\/DagRep.9.1.88","DOI":"10.4230\/DagRep.9.1.88"},{"key":"9_CR13","doi-asserted-by":"publisher","unstructured":"Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. In: 42nd Annual Symposium on Foundations of Computer Science\u2014FOCS 2001. pp. 136\u2013145 (2001). https:\/\/doi.org\/10.1109\/SFCS.2001.959888","DOI":"10.1109\/SFCS.2001.959888"},{"key":"9_CR14","doi-asserted-by":"publisher","unstructured":"Canetti, R., Fischlin, M.: Universally composable commitments. In: Advances in cryptology\u2014CRYPTO 2001. pp. 19\u201340. Springer (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_2","DOI":"10.1007\/3-540-44647-8_2"},{"key":"9_CR15","doi-asserted-by":"publisher","unstructured":"Chiribella, G., D\u2019Ariano, G.M., Perinotti, P.: Probabilistic theories with purification. Physical Review A 81(6) (Jun 2010). https:\/\/doi.org\/10.1103\/physreva.81.062348","DOI":"10.1103\/physreva.81.062348"},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Chitambar, E., Gour, G.: Quantum resource theories. Reviews of Modern Physics 91(2), 025001 (2019). https:\/\/doi.org\/10.1103\/revmodphys.91.025001","DOI":"10.1103\/revmodphys.91.025001"},{"key":"9_CR17","doi-asserted-by":"publisher","unstructured":"Chitambar, E., Leung, D., Man\u010dinska, L., Ozols, M., Winter, A.: Everything you always wanted to know about LOCC (but were afraid to ask). Communications in Mathematical Physics 328(1), 303\u2013326 (2014). https:\/\/doi.org\/10.1007\/s00220-014-1953-9","DOI":"10.1007\/s00220-014-1953-9"},{"key":"9_CR18","doi-asserted-by":"publisher","unstructured":"Clairambault, P., De\u00a0Visme, M., Winskel, G.: Game semantics for quantum programming. Proceedings of the ACM on Programming Languages 3(POPL), 1\u201329 (2019). https:\/\/doi.org\/10.1145\/3290345","DOI":"10.1145\/3290345"},{"key":"9_CR19","doi-asserted-by":"publisher","unstructured":"Clairambault, P., de\u00a0Visme, M., Winskel, G.: Concurrent quantum strategies. In: International Conference on Reversible Computation. pp. 3\u201319. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-21500-2_1","DOI":"10.1007\/978-3-030-21500-2_1"},{"key":"9_CR20","doi-asserted-by":"publisher","unstructured":"Coecke, B., Fritz, T., Spekkens, R.W.: A mathematical theory of resources. Information and Computation 250, 59\u201386 (2016). https:\/\/doi.org\/10.1016\/j.ic.2016.02.008","DOI":"10.1016\/j.ic.2016.02.008"},{"key":"9_CR21","doi-asserted-by":"publisher","unstructured":"Coecke, B., Perdrix, S.: Environment and classical channels in categorical quantum mechanics. Logical Methods in Computer Science Volume 8, Issue 4 (2012). https:\/\/doi.org\/10.2168\/LMCS-8(4:14)2012","DOI":"10.2168\/LMCS-8(4:14)2012"},{"key":"9_CR22","doi-asserted-by":"publisher","unstructured":"Coecke, B., Wang, Q., Wang, B., Wang, Y., Zhang, Q.: Graphical calculus for quantum key distribution (extended abstract). Electronic Notes in Theoretical Computer Science 270(2), 231\u2013249 (2011). https:\/\/doi.org\/10.1016\/j.entcs.2011.01.034","DOI":"10.1016\/j.entcs.2011.01.034"},{"key":"9_CR23","unstructured":"Cruttwell, G., Gavranovi\u0107, B., Ghani, N., Wilson, P., Zanasi, F.: Categorical foundations of gradient-based learning (2021), https:\/\/arxiv.org\/abs\/2103.01931"},{"key":"9_CR24","doi-asserted-by":"publisher","unstructured":"Cunningham, O., Heunen, C.: Purity through factorisation. In: Proceedings of QPL 2017. Electronic Proceedings in Theoretical Computer Science, vol.\u00a0266, pp. 315\u2013328 (2017). https:\/\/doi.org\/10.4204\/EPTCS.266.20","DOI":"10.4204\/EPTCS.266.20"},{"key":"9_CR25","doi-asserted-by":"publisher","unstructured":"Datta, A., Derek, A., Mitchell, J.C., Pavlovic, D.: A derivation system for security protocols and its logical formalization. In: 16th IEEE Computer Security Foundations Workshop, 2003. Proceedings. pp. 109\u2013125. IEEE (2003). https:\/\/doi.org\/10.1109\/csfw.2003.1212708","DOI":"10.1109\/csfw.2003.1212708"},{"key":"9_CR26","doi-asserted-by":"publisher","unstructured":"Datta, A., Derek, A., Mitchell, J.C., Pavlovic, D.: Secure protocol composition. Electronic Notes in Theoretical Computer Science 83, 201\u2013226 (2003). https:\/\/doi.org\/10.1016\/s1571-0661(03)50011-1","DOI":"10.1016\/s1571-0661(03)50011-1"},{"key":"9_CR27","doi-asserted-by":"publisher","unstructured":"Datta, A., Derek, A., Mitchell, J.C., Pavlovic, D.: A derivation system and compositional logic for security protocols. Journal of Computer Security 13(3), 423\u2013482 (Aug 2005). https:\/\/doi.org\/10.3233\/JCS-2005-13304","DOI":"10.3233\/JCS-2005-13304"},{"key":"9_CR28","doi-asserted-by":"publisher","unstructured":"Datta, A., Derek, A., Mitchell, J.C., Roy, A.: Protocol composition logic (PCL). Electronic Notes in Theoretical Computer Science 172, 311\u2013358 (Apr 2007). https:\/\/doi.org\/10.1016\/j.entcs.2007.02.012","DOI":"10.1016\/j.entcs.2007.02.012"},{"key":"9_CR29","doi-asserted-by":"publisher","unstructured":"Durgin, N., Mitchell, J., Pavlovic, D.: A compositional logic for protocol correctness. In: Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001. IEEE (2001). https:\/\/doi.org\/10.1109\/csfw.2001.930150","DOI":"10.1109\/csfw.2001.930150"},{"key":"9_CR30","doi-asserted-by":"publisher","unstructured":"Durgin, N., Mitchell, J., Pavlovic, D.: A compositional logic for proving security properties of protocols. Journal of Computer Security 11(4), 677\u2013721 (Oct 2003). https:\/\/doi.org\/10.3233\/JCS-2003-11407","DOI":"10.3233\/JCS-2003-11407"},{"key":"9_CR31","doi-asserted-by":"publisher","unstructured":"Fong, B., Spivak, D., Tuyeras, R.: Backprop as functor: A compositional perspective on supervised learning. In: 2019 34th Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS) (2019). https:\/\/doi.org\/10.1109\/lics.2019.8785665","DOI":"10.1109\/lics.2019.8785665"},{"key":"9_CR32","doi-asserted-by":"publisher","unstructured":"Fritz, T.: Resource convertibility and ordered commutative monoids. Mathematical Structures in Computer Science 27(6), 850\u2013938 (2015). https:\/\/doi.org\/10.1017\/s0960129515000444","DOI":"10.1017\/s0960129515000444"},{"key":"9_CR33","unstructured":"Gavranovi\u0107, B.: Compositional deep learning (2019), https:\/\/arxiv.org\/abs\/1907.08292"},{"key":"9_CR34","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System Sciences 28(2), 270\u2013299 (1984). https:\/\/doi.org\/10.1016\/0022-0000(84)90070-9","DOI":"10.1016\/0022-0000(84)90070-9"},{"key":"9_CR35","doi-asserted-by":"publisher","unstructured":"Heunen, C.: Compactly accessible categories and quantum key distribution. Logical Methods in Computer Science 4(4) (2008). https:\/\/doi.org\/10.2168\/lmcs-4(4:9)2008","DOI":"10.2168\/lmcs-4(4:9)2008"},{"key":"9_CR36","doi-asserted-by":"publisher","unstructured":"Hillebrand, A.: Superdense coding with GHZ and quantum key distribution with W in the ZX-calculus. In: Proceedings of QPL 2011. Electronic Proceedings in Theoretical Computer Science, vol.\u00a095, pp. 103\u2013121 (2011). https:\/\/doi.org\/10.4204\/EPTCS.95.10","DOI":"10.4204\/EPTCS.95.10"},{"key":"9_CR37","doi-asserted-by":"publisher","unstructured":"Hines, P.M.: A diagrammatic approach to information flow in encrypted communication (2020). https:\/\/doi.org\/10.1007\/978-3-030-62230-5_9","DOI":"10.1007\/978-3-030-62230-5_9"},{"key":"9_CR38","doi-asserted-by":"publisher","unstructured":"Hofheinz, D., Shoup, V.: GNUC: A new universal composability framework. Journal of Cryptology 28(3), 423\u2013508 (2015). https:\/\/doi.org\/10.1007\/s00145-013-9160-y","DOI":"10.1007\/s00145-013-9160-y"},{"key":"9_CR39","doi-asserted-by":"publisher","unstructured":"Horodecki, M., Oppenheim, J.: (Quantumness in the context of) Resource Theories. International Journal of Modern Physics B 27(01n03), 1345019 (2013). https:\/\/doi.org\/10.1142\/s0217979213450197","DOI":"10.1142\/s0217979213450197"},{"key":"9_CR40","doi-asserted-by":"publisher","unstructured":"Katz, J., Maurer, U., Tackmann, B., Zikas, V.: Universally composable synchronous computation. In: Theory of Cryptography, pp. 477\u2013498. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-36594-2_27","DOI":"10.1007\/978-3-642-36594-2_27"},{"key":"9_CR41","unstructured":"Kissinger, A., Tull, S., Westerbaan, B.: Picture-perfect quantum key distribution (2017), https:\/\/arxiv.org\/abs\/1704.08668"},{"key":"9_CR42","doi-asserted-by":"publisher","unstructured":"K\u00f6nig, R., Renner, R., Bariska, A., Maurer, U.: Small accessible quantum information does not imply security. Physical Review Letters 98(14), 140502 (2007). https:\/\/doi.org\/10.1103\/PhysRevLett.98.140502","DOI":"10.1103\/PhysRevLett.98.140502"},{"key":"9_CR43","doi-asserted-by":"publisher","unstructured":"K\u00fcsters, R., Tuengerthal, M., Rausch, D.: The IITM model: a simple and expressive model for universal composability. Journal of Cryptology 33(4), 1461\u20131584 (2020). https:\/\/doi.org\/10.1007\/s00145-020-09352-1","DOI":"10.1007\/s00145-020-09352-1"},{"key":"9_CR44","doi-asserted-by":"publisher","unstructured":"Liao, K., Hammer, M.A., Miller, A.: ILC: a calculus for composable, computational cryptography. In: Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation. pp. 640\u2013654. ACM (Jun 2019). https:\/\/doi.org\/10.1145\/3314221.3314607","DOI":"10.1145\/3314221.3314607"},{"key":"9_CR45","doi-asserted-by":"publisher","unstructured":"Lo, H.K., Chau, H.F.: Is quantum bit commitment really possible? Physical Review Letters 78(17), 3410\u20133413 (1997). https:\/\/doi.org\/10.1103\/PhysRevLett.78.3410","DOI":"10.1103\/PhysRevLett.78.3410"},{"key":"9_CR46","doi-asserted-by":"publisher","unstructured":"Matt, C., Maurer, U., Portmann, C., Renner, R., Tackmann, B.: Toward an algebraic theory of systems. Theoretical Computer Science 747, 1\u201325 (2018). https:\/\/doi.org\/10.1016\/j.tcs.2018.06.001","DOI":"10.1016\/j.tcs.2018.06.001"},{"key":"9_CR47","doi-asserted-by":"publisher","unstructured":"Maurer, U.: Constructive cryptography\u2013a new paradigm for security definitions and proofs. In: Joint Workshop on Theory of Security and Applications\u2014TOSCA 2011. pp. 33\u201356 (2011). https:\/\/doi.org\/10.1007\/978-3-642-27375-9_3","DOI":"10.1007\/978-3-642-27375-9_3"},{"key":"9_CR48","unstructured":"Maurer, U., Renner, R.: Abstract cryptography. In: Innovations in Computer Science\u2014ICS 2011 (2011)"},{"key":"9_CR49","unstructured":"Mayers, D.: The trouble with quantum bit commitment (1996), http:\/\/arxiv.org\/abs\/quant-ph\/9603015"},{"key":"9_CR50","doi-asserted-by":"publisher","unstructured":"Mayers, D.: Unconditional security in quantum cryptography. Journal of the ACM 48(3), 351\u2013406 (2001). https:\/\/doi.org\/10.1145\/382780.382781","DOI":"10.1145\/382780.382781"},{"key":"9_CR51","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Tessaro, S.: An equational approach to secure multi-party computation. In: 4th Conference on Innovations in Theoretical Computer Science\u2014ITCS 2013. pp. 355\u2013372 (2013). https:\/\/doi.org\/10.1145\/2422436.2422478","DOI":"10.1145\/2422436.2422478"},{"key":"9_CR52","doi-asserted-by":"publisher","unstructured":"Mifsud, A., Milner, R., Power, J.: Control structures. In: Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science. pp. 188\u2013198. IEEE (1995). https:\/\/doi.org\/10.1109\/lics.1995.523256","DOI":"10.1109\/lics.1995.523256"},{"key":"9_CR53","unstructured":"Moeller, J., Vasilakopoulou, C.: Monoidal Grothendieck construction. Theory and Applications of Categories 35(31), 1159\u20131207 (2020)"},{"key":"9_CR54","doi-asserted-by":"publisher","unstructured":"M\u00fcller-Quade, J., Renner, R.: Composability in quantum cryptography. New Journal of Physics 11(8), 085006 (2009). https:\/\/doi.org\/10.1088\/1367-2630\/11\/8\/085006","DOI":"10.1088\/1367-2630\/11\/8\/085006"},{"key":"9_CR55","doi-asserted-by":"publisher","unstructured":"Pavlovic, D.: Categorical logic of names and abstraction in action calculi. Mathematical Structures in Computer Science 7(6), 619\u2013637 (1997). https:\/\/doi.org\/10.1017\/S0960129597002296","DOI":"10.1017\/S0960129597002296"},{"key":"9_CR56","doi-asserted-by":"publisher","unstructured":"Pavlovic, D.: Tracing the man in the middle in monoidal categories. In: Coalgebraic Methods in Computer Science. pp. 191\u2013217. Springer (2012). https:\/\/doi.org\/10.1007\/978-3-642-32784-1_11","DOI":"10.1007\/978-3-642-32784-1_11"},{"key":"9_CR57","doi-asserted-by":"publisher","unstructured":"Pavlovic, D.: Chasing diagrams in cryptography. In: Casadio, C., Coecke, B., Moortgat, M., Scott, P. (eds.) Categories and Types in Logic, Language, and Physics: Essays Dedicated to Jim Lambek on the Occasion of His 90th Birthday, pp. 353\u2013367. Springer Berlin Heidelberg, Berlin, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54789-8_19","DOI":"10.1007\/978-3-642-54789-8_19"},{"key":"9_CR58","doi-asserted-by":"publisher","unstructured":"Pfitzmann, B., Waidner, M.: A model for asynchronous reactive systems and its application to secure message transmission. In: 2001 IEEE Symposium on Security and Privacy\u2014S&P 2001. pp. 184\u2013200 (2000). https:\/\/doi.org\/10.1109\/SECPRI.2001.924298","DOI":"10.1109\/SECPRI.2001.924298"},{"key":"9_CR59","doi-asserted-by":"publisher","unstructured":"Portmann, C., Matt, C., Maurer, U., Renner, R., Tackmann, B.: Causal boxes: quantum information-processing systems closed under composition. IEEE Transactions on Information Theory 63(5), 3277\u20133305 (2017). https:\/\/doi.org\/10.1109\/TIT.2017.2676805","DOI":"10.1109\/TIT.2017.2676805"},{"key":"9_CR60","unstructured":"Portmann, C., Renner, R.: Cryptographic security of quantum key distribution (2014), https:\/\/arxiv.org\/abs\/1409.3525"},{"key":"9_CR61","doi-asserted-by":"publisher","unstructured":"Prabhakaran, M., Rosulek, M.: Cryptographic complexity of multi-party computation problems: Classifications and separations. In: Advances in Cryptology\u2014CRYPTO 2008. pp. 262\u2013279 (2008). https:\/\/doi.org\/10.1007\/978-3-540-85174-5_15","DOI":"10.1007\/978-3-540-85174-5_15"},{"key":"9_CR62","doi-asserted-by":"publisher","unstructured":"Renner, R.: Security of quantum key distribution. International Journal of Quantum Information 06(01), 1\u2013127 (2005). https:\/\/doi.org\/10.1142\/S0219749908003256","DOI":"10.1142\/S0219749908003256"},{"key":"9_CR63","doi-asserted-by":"publisher","unstructured":"Selinger, P.: A survey of graphical languages for monoidal categories. In: New structures for physics, pp. 289\u2013355. Springer (2010). https:\/\/doi.org\/10.1007\/978-3-642-12821-9_4","DOI":"10.1007\/978-3-642-12821-9_4"},{"key":"9_CR64","doi-asserted-by":"publisher","unstructured":"Shor, P.W., Preskill, J.: Simple proof of security of the BB84 quantum key distribution protocol. Physical Review Letters 85(2), 441\u2013444 (2000). https:\/\/doi.org\/10.1103\/physrevlett.85.441","DOI":"10.1103\/physrevlett.85.441"},{"key":"9_CR65","doi-asserted-by":"publisher","unstructured":"Stay, M., Vicary, J.: Bicategorical semantics for nondeterministic computation. In: Proceedings of the Twenty-ninth Conference on the Mathematical Foundations of Programming Semantics, MFPS XXIX. Electronic Notes in Theoretical Computer Science, vol.\u00a0298, pp. 367 \u2013 382 (2013). https:\/\/doi.org\/10.1016\/j.entcs.2013.09.022","DOI":"10.1016\/j.entcs.2013.09.022"},{"key":"9_CR66","doi-asserted-by":"publisher","unstructured":"Sun, X., He, F., Wang, Q.: Impossibility of quantum bit commitment, a categorical perspective. Axioms 9(1), \u00a028 (2020). https:\/\/doi.org\/10.3390\/axioms9010028","DOI":"10.3390\/axioms9010028"},{"key":"9_CR67","doi-asserted-by":"publisher","unstructured":"Tomamichel, M., Lim, C.C.W., Gisin, N., Renner, R.: Tight finite-key analysis for quantum cryptography. Nature Communications 3, \u00a0634 (2012). https:\/\/doi.org\/10.1038\/ncomms1631","DOI":"10.1038\/ncomms1631"},{"key":"9_CR68","doi-asserted-by":"publisher","unstructured":"Unruh, D.: Universally composable quantum multi-party computation. In: Advances in Cryptology\u2014EUROCRYPT 2010. pp. 486\u2013505 (2010). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_25","DOI":"10.1007\/978-3-642-13190-5_25"},{"key":"9_CR69","doi-asserted-by":"publisher","unstructured":"Winskel, G.: Distributed probabilistic and quantum strategies. Electronic Notes in Theoretical Computer Science 298, 403\u2013425 (2013). https:\/\/doi.org\/10.1016\/j.entcs.2013.09.024","DOI":"10.1016\/j.entcs.2013.09.024"},{"key":"9_CR70","doi-asserted-by":"publisher","unstructured":"Wolf, S., Wullschleger, J.: New monotones and lower bounds in unconditional two-party computation. IEEE Transactions on Information Theory 54(6), 2792\u20132797 (2008). https:\/\/doi.org\/10.1109\/tit.2008.921674","DOI":"10.1109\/tit.2008.921674"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-99253-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T20:06:25Z","timestamp":1648497985000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-99253-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030992521","9783030992538"],"references-count":70,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-99253-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 March 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FoSSaCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Foundations of Software Science and Computation Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fossacs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/etaps.org\/2022\/fossacs","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"77","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"30% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}