Name
Title | ||
|---|---|---|
Randomized Oblivious Transfer For Secure Multiparty Computation In The Quantum Setting |
Abstract | ||
|---|---|---|
Secure computation is a powerful cryptographic tool that encompasses the evaluation of any multivariate function with arbitrary inputs from mutually distrusting parties. The oblivious transfer primitive serves is a basic building block for the general task of secure multi-party computation. Therefore, analyzing the security in the universal composability framework becomes mandatory when dealing with multi-party computation protocols composed of oblivious transfer subroutines. Furthermore, since the required number of oblivious transfer instances scales with the size of the circuits, oblivious transfer remains as a bottleneck for large-scale multi-party computation implementations. Techniques that allow one to extend a small number of oblivious transfers into a larger one in an efficient way make use of the oblivious transfer variant called randomized oblivious transfer. In this work, we present randomized versions of two known oblivious transfer protocols, one quantum and another post-quantum with ring learning with an error assumption. We then prove their security in the quantum universal composability framework, in a common reference string model. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.3390/e23081001 | ENTROPY |
Keywords | DocType | Volume |
oblivious transfer, quantum cryptography, post-quantum cryptography, universal composability | Journal | 23 |
Issue | ISSN | Citations |
8 | 1099-4300 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bruno Costa | 1 | 36 | 7.51 |
| Pedro Branco | 2 | 0 | 0.34 |
| Manuel Goulão | 3 | 0 | 0.34 |
| Mariano Lemus | 4 | 0 | 0.34 |
| Paulo Mateus | 5 | 0 | 0.34 |