First Page | Document Content | |
---|---|---|
Date: 2011-06-09 13:31:32Computational 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 VirginiaAdd to Reading ListSource URL: www.usenix.orgDownload Document from Source WebsiteFile Size: 414,79 KBShare Document on Facebook |