Paper 2014/018
Completeness for Symmetric Two-Party Functionalities - Revisited
Yehuda Lindell, Eran Omri, and Hila Zarosim
Abstract
Understanding the minimal assumptions required for carrying out cryptographic tasks is one of the fundamental goals of theoretical cryptography. A rich body of work has been dedicated to understanding the complexity of cryptographic tasks in the context of (semi-honest) secure two-party computation. Much of this work has focused on the characterization of trivial and complete functionalities (resp., functionalities that can be securely implemented unconditionally, and functionalities that can be used to securely compute all functionalities).
All previous works define reductions via an ideal implementation of the functionality; \ie
Metadata
- Available format(s)
-
PDF
- Publication info
- A minor revision of an IACR publication in ASIACRYPT 2012
- Contact author(s)
- hila zarosim @ gmail com
- History
- 2014-01-07: received
- Short URL
- https://ia.cr/2014/018
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2014/018, author = {Yehuda Lindell and Eran Omri and Hila Zarosim}, title = {Completeness for Symmetric Two-Party Functionalities - Revisited}, howpublished = {Cryptology {ePrint} Archive, Paper 2014/018}, year = {2014}, url = {https://eprint.iacr.org/2014/018} }