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

First Page		Document Content
Date: 2011-06-09 13:31:32 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 Source URL: www.usenix.org Download Document from Source Website File Size: 414,79 KB Share Document on Facebook

	SCAN 2018 Post-conference Proceedings Special Issue of Journal of Computational and Applied Mathematics Call for Papers Special Issue on the 18th International Symposium on Scientific Computing, Computer Arithmetic, DocID: 1xVSx - View Document
	Performance Evaluation and Optimization Models for Processing Networks with Queue-Dependent Production Quantities by John S. Hollywood S.B. Applied Mathematics DocID: 1xVdz - View Document
	Mixture Density Networks Christopher M. Bishop Neural Computing Research Group Dept. of Computer Science and Applied Mathematics Aston University DocID: 1xUJf - View Document
	Mathematics_BS_Applied.pdf DocID: 1xTYO - View Document
	A BOOTSTRAP INTERVAL ESTIMATOR FOR BAYES’ CLASSIFICATION ERROR Chad M. Hawes and Carey E. Priebe Johns Hopkins University Department of Applied Mathematics and Statistics Baltimore, MDABSTRACT DocID: 1vrMQ - View Document