Generalized Universal Circuits for Secure Evaluation of Private Functions with Application to Data Classification Ahmad-Reza Sadeghi and Thomas Schneider? Horst G¨ ortz Institute for IT-Security, Ruhr-University Bochum,

First Page		Document Content
Date: 2008-12-22 15:22:51 Logic gates Computational complexity theory Circuit complexity Boolean circuit Logic in computer science Adder ACC0 OR gate Theoretical computer science Applied mathematics Digital circuits		Generalized Universal Circuits for Secure Evaluation of Private Functions with Application to Data Classification Ahmad-Reza Sadeghi and Thomas Schneider? Horst G¨ ortz Institute for IT-Security, Ruhr-University Bochum, Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 1,23 MB Share Document on Facebook

	Comput. complex), 1 – 010001–20 $ 1.50c Birkh¨ auser Verlag, Basel 1999 DocID: 1pKtv - View Document
	Low-end uniform hardness vs. randomness tradeoffs for AM Christopher Umans† Department of Computer Science California Institute of Technology Pasadena, CA 91125. DocID: 1p3R3 - View Document
	DATA UPDATE // JULYNOVEMBER 2012 Index Value as at 30-Jun-16 DocID: 1ounU - View Document
	On Derandomization and Average-Case Complexity of Monotone Functions ∗ George Karakostas † DocID: 1mHsj - View Document
	LEARNING CIRCUITS AND NETWORKS BY INJECTING VALUES 1 DocID: 1mrFk - View Document