Back to Results
First PageMeta Content
Complexity classes / Probabilistic complexity theory / Zero-knowledge proof / Probabilistically checkable proof / NP / Proof of knowledge / IP / Non-interactive zero-knowledge proof / Soundness / Cryptography / Cryptographic protocols / Theoretical computer science


Secure Two-Party Computation with Low Communication Ivan Damg˚ard∗ Sebastian Faust† Carmit Hazay‡
Add to Reading List

Document Date: 2013-10-04 08:09:02

Open Document

File Size: 221,77 KB

Share Result on Facebook
UPDATE