LLVM: A Compilation Framework for Lifelong Program Analysis & Transformation
Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization
Fairplay—a secure two-party computation system
SSYM'04 Proceedings of the 13th conference on USENIX Security Symposium - Volume 13
FairplayMP: a system for secure multi-party computation
Proceedings of the 15th ACM conference on Computer and communications security
Multiparty computation for interval, equality, and comparison without bit-decomposition protocol
PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Proceedings of the third ACM Haskell symposium on Haskell
Faster secure two-party computation using garbled circuits
SEC'11 Proceedings of the 20th USENIX conference on Security
VMCrypt: modular software architecture for scalable secure computation
Proceedings of the 18th ACM conference on Computer and communications security
A language for automatically enforcing privacy policies
POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Efficiency tradeoffs for malicious two-party computation
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Language-based control and mitigation of timing channels
Proceedings of the 33rd ACM SIGPLAN conference on Programming Language Design and Implementation
Fully homomorphic encryption with polylog overhead
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Quid-Pro-Quo-tocols: Strengthening Semi-honest Protocols with Dual Execution
SP '12 Proceedings of the 2012 IEEE Symposium on Security and Privacy
Information-Flow Control for Programming on Encrypted Data
CSF '12 Proceedings of the 2012 IEEE 25th Computer Security Foundations Symposium
Billion-gate secure computation with malicious adversaries
Security'12 Proceedings of the 21st USENIX conference on Security symposium
Secure two-party computations in ANSI C
Proceedings of the 2012 ACM conference on Computer and communications security
Pinocchio: Nearly Practical Verifiable Computation
SP '13 Proceedings of the 2013 IEEE Symposium on Security and Privacy
Circuit Structures for Improving Efficiency of Security and Privacy Tools
SP '13 Proceedings of the 2013 IEEE Symposium on Security and Privacy
PCF: a portable circuit format for scalable two-party secure computation
SEC'13 Proceedings of the 22nd USENIX conference on Security
| Hi-index | 0.00 |
The Portable Circuit Format (PCF) system presented by Kreuter et al.[kmsb13] addressed an important bottleneck in the tools developed by the research community for secure computation. The PCF system is based on the idea that circuits can be represented as programs that emit gates on certain state transitions. By dealing with programs rather than circuits, functions have much smaller representations, the PCF compiler is able to apply automatic optimizations to much larger functions, and the runtime system requires far less memory. We present our future plans for the PCF system and our current work-in-progress.