On the Efficiency of Classical and Quantum Secure Function Evaluation
From MaRDI portal
Publication:2986307
DOI10.1109/TIT.2014.2314467zbMATH Open1360.81134arXiv1205.5136MaRDI QIDQ2986307FDOQ2986307
Authors: Severin Winkler, Jürg Wullschleger 
Publication date: 16 May 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: We provide bounds on the efficiency of secure one-sided output two-party computation of arbitrary finite functions from trusted distributed randomness in the statistical case. From these results we derive bounds on the efficiency of protocols that use different variants of OT as a black-box. When applied to implementations of OT, these bounds generalize most known results to the statistical case. Our results hold in particular for transformations between a finite number of primitives and for any error. In the second part we study the efficiency of quantum protocols implementing OT. While most classical lower bounds for perfectly secure reductions of OT to distributed randomness still hold in the quantum setting, we present a statistically secure protocol that violates these bounds by an arbitrarily large factor. We then prove a weaker lower bound that does hold in the statistical quantum setting and implies that even quantum protocols cannot extend OT. Finally, we present two lower bounds for reductions of OT to commitments and a protocol based on string commitments that is optimal with respect to both of these bounds.
Full work available at URL: https://arxiv.org/abs/1205.5136
Cited In (4)
- On the round complexity of secure quantum computation
- Secure certification of mixed quantum states with application to two-party randomness generation
- A trade-off between classical and quantum circuit size for an attack against CSIDH
- On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
This page was built for publication: On the Efficiency of Classical and Quantum Secure Function Evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986307)
