Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.3390/e22010107 | ENTROPY |
Keywords | Field | DocType |
random oblivious transfer,unconditional security,universal composability | Mathematical optimization,Theoretical computer science,Adversary,Composability,Mathematics,Oblivious transfer,Universal composability | Journal |
Volume | Issue | ISSN |
22 | 1 | 1099-4300 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Rafael Dowsley | 1 | 182 | 16.89 |
| Jörn Müller-Quade | 2 | 361 | 38.34 |
| Anderson C. A. Nascimento | 3 | 266 | 29.84 |