Back to Results
First PageMeta Content
Computational complexity theory / Logic gates / Circuit complexity / Secure multi-party computation / Levenshtein distance / XOR gate / Boolean circuit / Circuit / Adder / Theoretical computer science / Applied mathematics / Cryptographic protocols


Faster Secure Two-Party Computation Using Garbled Circuits Yan Huang David Evans University of Virginia
Add to Reading List

Document Date: 2011-06-09 13:31:32


Open Document

File Size: 414,79 KB

Share Result on Facebook
UPDATE