Abstract—RAM-model secure computation addresses the in-herent limitations of circuit-model secure computation considered in almost all previous work. Here, we describe the first automated approach for RAM-model secure computation in the semi-honest model. We define an intermediate representation called SCVM and a corresponding type system suited for RAM-model secure computation. Leveraging compile-time optimizations, our approach achieves order-of-magnitude speedups compared to both circuit-model secure computation and the state-of-art RAM-model secure computation. I
We are interested in secure computation protocols in settings where the number of parties is huge an...
Secure computation allows mutually distrusting parties to compute over private data. Such collaborat...
Abstract—Several techniques in computer security, including generic protocols for secure computation...
Abstract—RAM-model secure computation addresses the in-herent limitations of circuit-model secure co...
Abstract—RAM-model secure computation addresses the in-herent limitations of circuit-model secure co...
RAM-model secure computation addresses the inherent limitations of circuit-model secure computation...
A crucial issue, that mostly affects the performance of actively secure computation of RAM programs,...
Oblivious RAMs (ORAMs) have traditionally been measured by their bandwidth overhead and client stora...
Oblivious RAMs (ORAMs) have traditionally been mea-sured by their bandwidth overhead and client stor...
Abstract. We present ShMAC (Shallow MAC), a fixed input length message authentication code that perf...
Abstract. We present the first efficient (i.e., polylogarithmic overhead) method for securely and pr...
Secure processors enable new sets of applications such as commercial grid computing, software copy-p...
In theory secure computation offers a solution for privacy in many collaborative applications. Howev...
Graduation date: 2016Secure multi-party computation (MPC) is a conceptual framework in cryptography....
This paper formalises the security of programmable secure computation focusing on simplifying securi...
We are interested in secure computation protocols in settings where the number of parties is huge an...
Secure computation allows mutually distrusting parties to compute over private data. Such collaborat...
Abstract—Several techniques in computer security, including generic protocols for secure computation...
Abstract—RAM-model secure computation addresses the in-herent limitations of circuit-model secure co...
Abstract—RAM-model secure computation addresses the in-herent limitations of circuit-model secure co...
RAM-model secure computation addresses the inherent limitations of circuit-model secure computation...
A crucial issue, that mostly affects the performance of actively secure computation of RAM programs,...
Oblivious RAMs (ORAMs) have traditionally been measured by their bandwidth overhead and client stora...
Oblivious RAMs (ORAMs) have traditionally been mea-sured by their bandwidth overhead and client stor...
Abstract. We present ShMAC (Shallow MAC), a fixed input length message authentication code that perf...
Abstract. We present the first efficient (i.e., polylogarithmic overhead) method for securely and pr...
Secure processors enable new sets of applications such as commercial grid computing, software copy-p...
In theory secure computation offers a solution for privacy in many collaborative applications. Howev...
Graduation date: 2016Secure multi-party computation (MPC) is a conceptual framework in cryptography....
This paper formalises the security of programmable secure computation focusing on simplifying securi...
We are interested in secure computation protocols in settings where the number of parties is huge an...
Secure computation allows mutually distrusting parties to compute over private data. Such collaborat...
Abstract—Several techniques in computer security, including generic protocols for secure computation...