Privacy preserving auctions and mechanism design
Proceedings of the 1st ACM conference on Electronic commerce
Efficient oblivious transfer protocols
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Precomputing Oblivious Transfer
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Fairplay—a secure two-party computation system
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Improved Garbled Circuit: Free XOR Gates and Applications
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
FairplayMP: a system for secure multi-party computation
Proceedings of the 15th ACM conference on Computer and communications security
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
A Proof of Security of Yao’s Protocol for Two-Party Computation
Journal of Cryptology
Practical Secure Evaluation of Semi-private Functions
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Secure Two-Party Computation Is Practical
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
SCiFI - A System for Secure Face Identification
SP '10 Proceedings of the 2010 IEEE Symposium on Security and Privacy
TASTY: tool for automating secure two-party computations
Proceedings of the 17th ACM conference on Computer and communications security
Garbled circuits for leakage-resilience: hardware implementation and evaluation of one-time programs
CHES'10 Proceedings of the 12th international conference on Cryptographic hardware and embedded systems
Privacy-preserving applications on smartphones
HotSec'11 Proceedings of the 6th USENIX conference on Hot topics in security
Faster secure two-party computation using garbled circuits
SEC'11 Proceedings of the 20th USENIX conference on Security
Secure and efficient protocols for iris and fingerprint identification
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
Twin clouds: secure cloud computing with low latency
CMS'11 Proceedings of the 12th IFIP TC 6/TC 11 international conference on Communications and multimedia security
Automatically optimizing secure computation
Proceedings of the 18th ACM conference on Computer and communications security
VMCrypt: modular software architecture for scalable secure computation
Proceedings of the 18th ACM conference on Computer and communications security
A new combinational logic minimization technique with applications to cryptology
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
Concrete multiplicative complexity of symmetric functions
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Keyword search and oblivious pseudorandom functions
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Embedded SFE: offloading server and network using hardware tokens
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
Quid-Pro-Quo-tocols: Strengthening Semi-honest Protocols with Dual Execution
SP '12 Proceedings of the 2012 IEEE Symposium on Security and Privacy
Billion-gate secure computation with malicious adversaries
Security'12 Proceedings of the 21st USENIX conference on Security symposium
Engineering Secure Two-Party Computation Protocols: Design, Optimization, and Applications of Efficient Secure Function Evaluation
Secure two-party computations in ANSI C
Proceedings of the 2012 ACM conference on Computer and communications security
More efficient oblivious transfer and extensions for faster secure computation
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
| Hi-index | 0.00 |
Secure two-party computation is used as the basis for a large variety of privacy-preserving protocols, but often concerns about the low performance hinder the move away from non-private solutions. In this paper we present an improved implementation of Yao's garbled circuit protocol in the semi-honest adversaries setting which is up to 10 times faster than previous implementations. Our improvements include (1) the first multi-threaded implementation of the base oblivious transfers resulting in a speedup of a factor of two, (2) techniques for minimizing the memory footprint during oblivious transfer extensions and processing of circuits, (3) compilation of sub-circuits into files, and (4) caching of circuit descriptions and network packets. We implement improved circuit building blocks from the literature and present for the first time performance results for secure evaluation of the ultra-lightweight block cipher PRESENT within 7 ms online time.