How to simulate it–a tutorial on the simulation proof technique
Y Lindell - Tutorials on the Foundations of Cryptography …, 2017 - Springer
One of the most fundamental notions of cryptography is that of simulation. It stands behind
the concepts of semantic security, zero knowledge, and security for multiparty computation …
the concepts of semantic security, zero knowledge, and security for multiparty computation …
Fairness in an unfair world: Fair multiparty computation from public bulletin boards
Secure multiparty computation allows mutually distrusting parties to compute a function on
their private inputs such that nothing but the function output is revealed. Achieving fairness …
their private inputs such that nothing but the function output is revealed. Achieving fairness …
Efficient and private scoring of decision trees, support vector machines and logistic regression models based on pre-computation
Many data-driven personalized services require that private data of users is scored against a
trained machine learning model. In this paper we propose a novel protocol for privacy …
trained machine learning model. In this paper we propose a novel protocol for privacy …
A full proof of the BGW protocol for perfectly secure multiparty computation
In the setting of secure multiparty computation, a set of n parties with private inputs wish to
jointly compute some functionality of their inputs. One of the most fundamental results of …
jointly compute some functionality of their inputs. One of the most fundamental results of …
Sealed-glass proofs: Using transparent enclaves to prove and sell knowledge
Trusted hardware systems, such as Intel's new SGX instruction set architecture extension,
aim to provide strong confidentiality and integrity assurances for applications. Recent work …
aim to provide strong confidentiality and integrity assurances for applications. Recent work …
Secure multiparty computation from SGX
In this paper we show how Isolated Execution Environments (IEE) offered by novel
commodity hardware such as Intel's SGX provide a new path to constructing general secure …
commodity hardware such as Intel's SGX provide a new path to constructing general secure …
Garbled protocols and two-round MPC from bilinear maps
S Garg, A Srinivasan - 2017 IEEE 58th Annual Symposium on …, 2017 - ieeexplore.ieee.org
In this paper, we initiate the study of garbled protocols-a generalization of Yao's garbled
circuits construction to distributed protocols. More specifically, in a garbled protocol …
circuits construction to distributed protocols. More specifically, in a garbled protocol …
Non-interactive multiparty computation without correlated randomness
We study the problem of non-interactive multiparty computation (NI-MPC) where a group of
completely asynchronous parties can evaluate a function over their joint inputs by sending a …
completely asynchronous parties can evaluate a function over their joint inputs by sending a …
A framework for efficient adaptively secure composable oblivious transfer in the ROM
Oblivious Transfer (OT) is a fundamental cryptographic protocol that finds a number of
applications, in particular, as an essential building block for two-party and multi-party …
applications, in particular, as an essential building block for two-party and multi-party …
Efficient and universally composable protocols for oblivious transfer from the CDH assumption
Oblivious Transfer (OT) is a simple, yet fundamental primitive which suffices to achieve
almost every cryptographic application. In a recent work (Latincrypt15), Chou and Orlandi …
almost every cryptographic application. In a recent work (Latincrypt15), Chou and Orlandi …