Completeness for Symmetric Two-Party Functionalities: Revisited

Authors

Keywords

Secure computation, Hardness assumptions, Completeness, Non-black-box reductions

Journal

JOURNAL OF CRYPTOLOGY

Volume 31, Issue 3, Pages 671-697

Publisher

Springer Nature

Online

2017-11-03

DOI

10.1007/s00145-017-9267-7

Ask authors/readers for more resources

Protocol

Community support

Reagent

Community support

Reprint

Contact the author

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

Ask a Question. Answer a Question.

Quickly pose questions to the entire community. Debate answers and get clarity on the most important issues facing researchers.

Get Started