Pool: Scalable On-Demand Secure Computation Service Against Malicious Adversaries

First Page		Document Content
Date: 2017-12-30 21:51:59 Logic gates Cryptographic protocols Circuit complexity Theoretical computer science Complexity classes Garbled circuit Theory of computation Secure multi-party computation Multiplexer XOR gate OR gate NC		Pool: Scalable On-Demand Secure Computation Service Against Malicious Adversaries Add to Reading List Source URL: acmccs.github.io Download Document from Source Website File Size: 3,06 MB Share Document on Facebook

	Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE, and Compact Garbled Circuits∗ Dan Boneh† Craig Gentry‡ DocID: 1tpEx - View Document
	2015 IEEE Symposium on Security and Privacy TinyGarble: Highly Compressed and Scalable Sequential Garbled Circuits Ebrahim M. Songhori∗ , Siam U. Hussain∗ , Ahmad-Reza Sadeghi† , Thomas Schneider† , Farinaz Kous DocID: 1rrYP - View Document
	The proceedings version of this paper appears in CCSThis is the full paper, an earlier version of which was circulated under the title “Garbling Schemes”. Foundations of Garbled Circuits Mihir Bellare1 1 DocID: 1pyIx - View Document
	2015 IEEE Symposium on Security and Privacy Secure Sampling of Public Parameters for Succinct Zero Knowledge Proofs Eli Ben-Sasson§ , Alessandro Chiesa∗ , Matthew Green† , Eran Tromer¶ , Madars Virza‡ ∗ ETH DocID: 1mti2 - View Document
	Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique∗ (Technical report – September 11, 2013) Luís T. A. N. Brandão† University of Lisbon DocID: 1m1L6 - View Document