Next Article in Journal
Entropy-Based Effect Evaluation of Delineators in Tunnels on Drivers’ Gaze Behavior
Previous Article in Journal
Fast and Efficient Image Encryption Algorithm Based on Modular Addition and SPD
Open AccessArticle

On the Composability of Statistically Secure Random Oblivious Transfer

1
Department of Computer Science, Bar-Ilan University, Ramat Gan 5290002, Israel
2
Institute of Theoretical Informatics, Karlsruhe Institute of Technology, 76131 Karlsruhe, Germany
3
School of Engineering & Technology, University of Washington Tacoma, Tacoma, WA 98402, USA
*
Authors to whom correspondence should be addressed.
Entropy 2020, 22(1), 107; https://doi.org/10.3390/e22010107
Received: 11 December 2019 / Revised: 10 January 2020 / Accepted: 10 January 2020 / Published: 16 January 2020
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. View Full-Text
Keywords: random oblivious transfer; unconditional security; universal composability random oblivious transfer; unconditional security; universal composability
Show Figures

Figure 1

MDPI and ACS Style

Dowsley, R.; Müller-Quade, J.; Nascimento, A.C.A. On the Composability of Statistically Secure Random Oblivious Transfer. Entropy 2020, 22, 107.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop