{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T19:16:47Z","timestamp":1772911007819,"version":"3.50.1"},"reference-count":49,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T00:00:00Z","timestamp":1579132800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>We show that random oblivious transfer protocols that are statistically secure according to a definition based on a list of information-theoretical properties are also statistically universally composable. That is, they are simulatable secure with an unlimited adversary, an unlimited simulator, and an unlimited environment machine. Our result implies that several previous oblivious transfer protocols in the literature that were proven secure under weaker, non-composable definitions of security can actually be used in arbitrary statistically secure applications without lowering the security.<\/jats:p>","DOI":"10.3390\/e22010107","type":"journal-article","created":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T07:39:02Z","timestamp":1579246742000},"page":"107","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["On the Composability of Statistically Secure Random Oblivious Transfer"],"prefix":"10.3390","volume":"22","author":[{"given":"Rafael","family":"Dowsley","sequence":"first","affiliation":[{"name":"Department of Computer Science, Bar-Ilan University, Ramat Gan 5290002, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rn","family":"M\u00fcller-Quade","sequence":"additional","affiliation":[{"name":"Institute of Theoretical Informatics, Karlsruhe Institute of Technology, 76131 Karlsruhe, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anderson C. A.","family":"Nascimento","sequence":"additional","affiliation":[{"name":"School of Engineering &amp; Technology, University of Washington Tacoma, Tacoma, WA 98402, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2020,1,16]]},"reference":[{"key":"ref_1","unstructured":"Rabin, M.O. (1981). How to Exchange Secrets by Oblivious Transfer, Aiken Computation Laboratory, Harvard University. Technical Report Technical Memo TR-81."},{"key":"ref_2","unstructured":"Aho, A. (1987, January 25\u201327). How to Play any Mental Game or A Completeness Theorem for Protocols with Honest Majority. Proceedings of the 19th Annual ACM Symposium on Theory of Computing, New York, NY, USA."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Kilian, J. (1988, January 2\u20134). Founding Cryptography on Oblivious Transfer. Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA.","DOI":"10.1145\/62212.62215"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1007\/3-540-48184-2_30","article-title":"Equivalence Between Two Flavours of Oblivious Transfers","volume":"Volume 293","author":"Pomerance","year":"1988","journal-title":"Proceedings of the Advances in Cryptology\u2013CRYPTO\u201987"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","article-title":"The Knowledge Complexity of Interactive Proof Systems","volume":"18","author":"Goldwasser","year":"1989","journal-title":"SIAM J. Comput."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/3-540-46766-1_31","article-title":"Foundations of Secure Interactive Computing","volume":"Volume 576","author":"Feigenbaum","year":"1992","journal-title":"Proceedings of the Advances in Cryptology\u2014CRYPTO\u201991"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s001459910006","article-title":"Security and Composition of Multiparty Cryptographic Protocols","volume":"13","author":"Canetti","year":"2000","journal-title":"J. Cryptol."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Canetti, R. (2001, January 8\u201311). Universally Composable Security: A New Paradigm for Cryptographic Protocols. Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, Newport Beach, CA, USA.","DOI":"10.1109\/SFCS.2001.959888"},{"key":"ref_9","unstructured":"Kleinberg, J.M. (2006, January 21\u201323). Information-theoretically secure protocols and security under composition. Proceedings of the 38th Annual ACM Symposium on Theory of Computing, Seattle, WA, USA."},{"key":"ref_10","first-page":"157","article-title":"On the Necessity of Rewinding in Secure Multiparty Computation","volume":"Volume 4392","author":"Vadhan","year":"2007","journal-title":"Proceedings of the TCC 2007: 4th Theory of Cryptography Conference"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Beaver, D. (1997, January 4\u20136). Commodity-Based Cryptography (Extended Abstract). Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, USA.","DOI":"10.1145\/258533.258637"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1007\/11761679_14","article-title":"Oblivious Transfer Is Symmetric","volume":"Volume 4004","author":"Vaudenay","year":"2006","journal-title":"Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2006"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Cr\u00e9peau, C., and Kilian, J. (1988, January 24\u201326). Achieving Oblivious Transfer Using Weakened Security Assumptions (Extended Abstract). Proceedings of the 29th Annual Symposium on Foundations of Computer Science, White Plains, NY, USA.","DOI":"10.1109\/SFCS.1988.21920"},{"key":"ref_14","first-page":"306","article-title":"Efficient Cryptographic Protocols Based on Noisy Channels","volume":"Volume 1233","author":"Fumy","year":"1997","journal-title":"Proceedings of the Advances in Cryptology\u2014EUROCRYPT\u201997"},{"key":"ref_15","first-page":"56","article-title":"On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions","volume":"Volume 1592","author":"Stern","year":"1999","journal-title":"Proceedings of the Advances in Cryptology\u2014EUROCRYPT\u201999"},{"key":"ref_16","unstructured":"Stebila, D., and Wolf, S. (July, January 30). Efficient oblivious transfer from any non-trivial binary-symmetric channel. Proceedings of the IEEE International Symposium on Information Theory, Lausanne, Switzerland."},{"key":"ref_17","first-page":"47","article-title":"Efficient Unconditional Oblivious Transfer from Almost Any Noisy Channel","volume":"Volume 3352","author":"Blundo","year":"2004","journal-title":"Proceedings of the SCN 04: 4th International Conference on Security in Communication Networks"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"2572","DOI":"10.1109\/TIT.2008.921856","article-title":"On the Oblivious-Transfer Capacity of Noisy Resources","volume":"54","author":"Nascimento","year":"2008","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"5566","DOI":"10.1109\/TIT.2011.2158898","article-title":"Achieving Oblivious Transfer Capacity of Generalized Erasure Channels in the Malicious Model","volume":"57","author":"Pinto","year":"2011","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/978-3-642-36899-8_6","article-title":"On Oblivious Transfer Capacity","volume":"Volume 7777","author":"Aydinian","year":"2013","journal-title":"Information Theory, Combinatorics, and Search Theory"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"6819","DOI":"10.1109\/TIT.2017.2735423","article-title":"On the Oblivious Transfer Capacity of Generalized Erasure Channels Against Malicious Adversaries: The Case of Low Erasure Probability","volume":"63","author":"Dowsley","year":"2017","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Kilian, J. (2000, January 21\u201323). More general completeness theorems for secure two-party computation. Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, Portland, OR, USA.","DOI":"10.1145\/335305.335342"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/3-540-48405-1_6","article-title":"The All-or-Nothing Nature of Two-Party Secure Computation","volume":"Volume 1666","author":"Wiener","year":"1999","journal-title":"Proceedings of the Advances in Cryptology\u2014CRYPTO\u201999"},{"key":"ref_24","unstructured":"Rivest, R.L. (2019, October 01). Unconditionally Secure Commitment and Oblivious Transfer Schemes Using Private Channels and a Trusted Initializer. Available online: http:\/\/people.csail.mit.edu\/rivest\/Rivest-commitment.pdf."},{"key":"ref_25","first-page":"164","article-title":"Unconditional and Composable Security Using a Single Stateful Tamper-Proof Hardware Token","volume":"Volume 6597","author":"Ishai","year":"2011","journal-title":"Proceedings of the TCC 2011: 8th Theory of Cryptography Conference"},{"key":"ref_26","first-page":"197","article-title":"Weakening the Isolation Assumption of Tamper-Proof Hardware Tokens","volume":"Volume 9063","author":"Lehmann","year":"2015","journal-title":"Proceedings of the ICITS 15: 8th International Conference on Information Theoretic Security"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1145\/3812.3818","article-title":"A Randomized Protocol for Signing Contracts","volume":"28","author":"Even","year":"1985","journal-title":"Commun. ACM"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Goldreich, O. (2004). Foundations of Cryptography: Basic Applications, Cambridge University Press.","DOI":"10.1017\/CBO9780511721656"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/0-387-34805-0_48","article-title":"Non-Interactive Oblivious Transfer and Spplications","volume":"Volume 435","author":"Brassard","year":"1990","journal-title":"Proceedings of the Advances in Cryptology\u2014CRYPTO\u201989"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Kosaraju, S.R. (2001, January 7\u20139). Efficient Oblivious Transfer Protocols. Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, Washington, DC, USA.","DOI":"10.1137\/1.9780898714906"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1007\/978-3-540-85174-5_31","article-title":"A Framework for Efficient and Composable Oblivious Transfer","volume":"Volume 5157","author":"Wagner","year":"2008","journal-title":"Proceedings of the Advances in Cryptology\u2014CRYPTO 2008"},{"key":"ref_32","first-page":"143","article-title":"Universally Composable Oblivious Transfer Based on a Variant of LPN","volume":"Volume 8813","author":"Gritzalis","year":"2014","journal-title":"Proceedings of the CANS 14: 13th International Conference on Cryptology and Network Security"},{"key":"ref_33","first-page":"107","article-title":"Oblivious Transfer Based on the McEliece Assumptions","volume":"Volume 5155","year":"2008","journal-title":"Proceedings of the ICITS 08: 3rd International Conference on Information Theoretic Security"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1587\/transfun.E95.A.567","article-title":"Oblivious Transfer Based on the McEliece Assumptions","volume":"E95-A","author":"Dowsley","year":"2012","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"ref_35","unstructured":"Cachin, C., Cr\u00e9peau, C., and Marcil, J. (1998, January 8\u201311). Oblivious Transfer with a Memory-Bounded Receiver. Proceedings of the 39th Annual Symposium on Foundations of Computer Science, Palo Alto, CA, USA."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Dowsley, R., Lacerda, F., and Nascimento, A.C.A. (July, January 29). Oblivious transfer in the bounded storage model with errors. Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA.","DOI":"10.1109\/ISIT.2014.6875108"},{"key":"ref_37","first-page":"446","article-title":"Constant-Round Oblivious Transfer in the Bounded Storage Model","volume":"Volume 2951","author":"Naor","year":"2004","journal-title":"Proceedings of the TCC 2004: 1st Theory of Cryptography Conference"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"5970","DOI":"10.1109\/TIT.2018.2796128","article-title":"Commitment and Oblivious Transfer in the Bounded Storage Model With Errors","volume":"64","author":"Dowsley","year":"2018","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/3-540-44647-8_2","article-title":"Universally Composable Commitments","volume":"Volume 2139","author":"Kilian","year":"2001","journal-title":"Proceedings of the Advances in Cryptology\u2014CRYPTO 2001"},{"key":"ref_40","doi-asserted-by":"crossref","unstructured":"Canetti, R., Lindell, Y., Ostrovsky, R., and Sahai, A. (2002, January 19\u201321). Universally composable two-party and multi-party secure computation. Proceedings of the 34th Annual ACM Symposium on Theory of Computing, Montreal, QC, Canada.","DOI":"10.1145\/509907.509980"},{"key":"ref_41","first-page":"297","article-title":"Efficient and Universally Composable Committed Oblivious Transfer and Applications","volume":"Volume 2951","author":"Naor","year":"2004","journal-title":"Proceedings of the TCC 2004: 1st Theory of Cryptography Conference"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/978-3-540-45146-4_15","article-title":"Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption","volume":"Volume 2729","author":"Boneh","year":"2003","journal-title":"Proceedings of the Advances in Cryptology\u2013CRYPTO 2003"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/978-3-540-72540-4_7","article-title":"Universally Composable Multi-party Computation Using Tamper-Proof Hardware","volume":"Volume 4515","author":"Naor","year":"2007","journal-title":"Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2007"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1007\/11761679_32","article-title":"Information-Theoretic Conditions for Two-Party Secure Function Evaluation","volume":"Volume 4004","author":"Vaudenay","year":"2006","journal-title":"Proceedings of the Advances in Cryptology\u2014EUROCRYPT 2006"},{"key":"ref_45","first-page":"86","article-title":"Statistical Security Conditions for Two-Party Secure Function Evaluation","volume":"Volume 5155","year":"2008","journal-title":"Proceedings of the ICITS 08: 3rd International Conference on Information Theoretic Security"},{"key":"ref_46","first-page":"509","article-title":"On the Composability of Statistically Secure Bit Commitments","volume":"14","author":"Dowsley","year":"2013","journal-title":"J. Internet Technol."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/978-3-662-49896-5_8","article-title":"All Complete Functionalities are Reversible","volume":"Volume 9666","author":"Fischlin","year":"2016","journal-title":"Proceedings of the Advances in Cryptology\u2013EUROCRYPT 2016"},{"key":"ref_48","doi-asserted-by":"crossref","unstructured":"Maji, H.K., Prabhakaran, M., and Rosulek, M. (2012, January 9\u201312). A unified characterization of completeness and triviality for secure function evaluation. Proceedings of the International Conference on Cryptology in India, Kolkata, India.","DOI":"10.1007\/978-3-642-34931-7_4"},{"key":"ref_49","doi-asserted-by":"crossref","unstructured":"Kraschewski, D., Maji, H.K., Prabhakaran, M., and Sahai, A. (2014, January 11\u201315). A full characterization of completeness for two-party randomized function evaluation. Proceedings of the Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark.","DOI":"10.1007\/978-3-642-55220-5_36"}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/22\/1\/107\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T14:26:45Z","timestamp":1760365605000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/22\/1\/107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,16]]},"references-count":49,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2020,1]]}},"alternative-id":["e22010107"],"URL":"https:\/\/doi.org\/10.3390\/e22010107","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,16]]}}}