Questions tagged [multiparty-computation]
Multi-party computation (MPC) allows a set of parties, each with a private input, to securely and jointly perform any computation over their inputs.
429
questions
0
votes
1
answer
43
views
Secure communication over insecure channel is based on the assumption of secure channel？
Consider a scenario：data owners $C$ sends a $l$ bits value $x$ to parties $P_0$ and $P_1$ via additively secret sharing scheme, for example, $C$ randomly selects $r \in_R \{0, 1\}^l$, and sends $r$ to ...
- 28
1
vote
2
answers
124
views
Is there a winning strategy based on this coin-flipping protocol?
Given the coin flipping protocol:
A chooses $a \in_R \{0,1\}$ and computes $commit(a,r)$. She sends $commit(a,r)$ to B.
B chooses $b \in_R \{0,1\}$ and sends $b$ to A.
A sends $open(a,r)$ and B ...
- 137
2
votes
2
answers
142
views
Secretly compute multiplication of two numbers owned by two people
For example, Alice and Bob have two numbers $a$ and $b$, respectively. They want to calculate the multiplication $a\cdot b$ without Alice knowing $b$ or Bob knowing $a$ and send this multiplication $a\...
- 47
1
vote
1
answer
42
views
Simulation based proof for Beaver's multiplication protocol
Setup
Recently, I became interested in simulation based proofs in the context of secure two party computation. I read some book chapters (from Secure MPC and Secret Sharing and Foundations on ...
- 13
0
votes
0
answers
41
views
A single array access with multiplexers to achieve obliviousness
I'm new to secure multi-party computation and ORAM. My question is quite simple.
Is there a concrete example to explain the linear scan for an array with multiplexers to achieve obliviousness?
I didn'...
- 33
0
votes
1
answer
45
views
Difference between Non-Interactive Secure Multiparty Computation (NISMPC) and Fully Homomorphic Encryption (FHE)
Until recently, I only knew about SMPC* and FHE, but now I just encountered the term NISMPC. I was wondering what is their difference and what is their difference in their use cases?
Sometimes in ...
- 268
0
votes
0
answers
18
views
Data encryption or Blockchain in data sharing between *multiple* sources?
imagine several parties that own data, and some of them need to use data of other parties, but have only limited access rights to it. An example:
Party #1 (pharmacy store) needs confirmation from ...
1
vote
1
answer
69
views
What is the essential difference between Garbled Circuit and Oblivious Transfer?
According to the literature (https://en.wikipedia.org/wiki/Garbled_circuit), Oblivious Transfer allows a party A holding a function $f$ and a party B holding a index i to jointly compute the value $f(...
- 35
0
votes
0
answers
31
views
Tools/libraries to protect private keys using shamir secret sharing / multi-party computation?
here is the scenario. I want to use the concept of shamir secret sharing (or other multi-party computation methods) to store my private key in the public-key encryption. For example, I use RSA to ...
- 47
1
vote
1
answer
55
views
Anonymous PAKE using two party computation
Let's say client side has a secret password $\pi$. The server has a series of indices $0..n-1$ and a salt associated value $s_i$ for all $i \in \{0,n-1\}$ call it set $S=\{s_i |
i \in \{0,n-1\}\}$ ...
- 501
2
votes
1
answer
106
views
Does shared randomness between two cryptographic primitives complicate the hybrid argument for computational indistinguishability?
Let $(Enc, Dec)$ be an IND-CPA secure encryption scheme, where $Enc: \mathcal{K} \times \mathcal{M}_1 \rightarrow \mathcal{C}_1$, and $F: \mathcal{K} \times \mathcal{M}_2 \rightarrow \mathcal{C}_2$ be ...
- 187
0
votes
0
answers
49
views
Tuples 2P secure multi-party computation against malicious adversaries algorithms
There are secure multi-party computation algorithms and implementations [1] for signing 2-party messages where the parties don't need to reveal their secrets.
Can this algorithms be used for signing ...
- 101
0
votes
1
answer
52
views
AES in binary-circuit-based 2PC
No matter AES with CBC or EBC etc, the inputs for AES i.e, plaintext, key, IV, are always provided by one party. In other words, there is no need for AES in a 2PC scenario since one party can already ...
- 25
1
vote
1
answer
74
views
SHA-256 in binary-circuit-based MPC
For a binary-circuit-based MPC, the multiparty will provide its inputs to calculate the result, which indicated the function $f(x_1, x_2, \dots,x_n)$ needs to accept $2$ or more inputs.
Why do there ...
- 25
1
vote
0
answers
23
views
Why we need broadcast channel in the 3PC setting?
I am a MPC learner for privacy-preserving machine learning. Recently, I am reading this paper: FLASH: Fast and Robust Framework for Privacy-preserving Machine Learning. I am confused about the ...
- 65
3
votes
1
answer
49
views
About simulating abort in multiple party computation
I am new to the simulated proof and am a little bit confused about the abort in the simulation.
When the real-time protocol abort, I assume that the ideal process should also abort? Does this mean ...
- 99
1
vote
1
answer
51
views
Securely sort lists of numbers from two parties
I am looking for ways to securely sort two lists of numbers. Yao's millionaire's problem considers each party with one secrete number and compare them securely. Are there papers on extension to this ...
2
votes
2
answers
71
views
Are all parties for an MPC protocol needed?
For a lot of cryptographic applications, multi-party protocols are used. The idea is to create shares of a key/secret and give them to multiple parties. My question is: Do all parties have to ...
- 1,482
1
vote
1
answer
38
views
Question about round complexity of secure multiple party computation based on secret sharing
I am reading Fast and Secure Three-party Computation:
The Garbled Circuit Approach
And in the introduction section it said that:
the round complexity of these protocols is proportional to the
...
- 99
2
votes
1
answer
40
views
Leaking information for giving the yao's garbled circuit's garbled output
I am currently reading the paper: Efficiency Tradeoffs for Malicious Two-Party
Computation. The paper describes a $k$-leak model and gives an example that leaking 1 bit could turn Yao's garbled ...
- 99
0
votes
0
answers
58
views
How could this scheme work?
When we use a secret sharing scheme we usually want to reconstruct the polynomial function $p(x)\in\mathbb{Z}_q[X]$ with the Lagrange interpolation method and then compute $s=p(0)=a_0$. However, the ...
- 261
0
votes
2
answers
99
views
How can I use a secret sharing scheme when the secret is not a number but a statement?
I want to use a secret sharing scheme, where every player $i\in N$ has to share a pair of secrets $(l_i,\nu_{l_i})$, where $l_i$ is a unique code (positive integer) for every player, but $\nu_{l_i}$ ...
- 261
0
votes
0
answers
21
views
Witness Recovery in SPDZ Offline Phase
I am currently reading SPDZ: https://eprint.iacr.org/2011/535.pdf.
The MPC protocol uses an encryption scheme $\operatorname{Enc}_{\operatorname{pk}}(x,r)$ based on Brakerski, V. Vaikuntanathan (...
-1
votes
1
answer
48
views
How to define a cryptosystem when the encryption-decyrption scheme is based on Shamir's secret sharing scheme?
I would like to make a parallelism between Shamir's secret sharing scheme and how to define a cryptosystem where the encryption scheme is based on secret sharing. To begin with I do not know if there ...
- 261
1
vote
0
answers
37
views
Privacy preserving functions vs secure multi-party computation
As we all know, secure multi-party computation allows us to run a certain computation/function on private inputs contributed by different parties (that do not necessarily trust each other). The ...
- 422
1
vote
1
answer
111
views
Mathematical formulation for a cryptosystem
I will try to define easily the cryptographic system of this paper. The author designs a communication game for $N$ players. The private information of every player is denoted as $t_i\in T_i$ and ...
- 131
1
vote
1
answer
87
views
Could someone explain the protocol of Yevgeniy Dodis, Shai Halevi, and Tal Rabin in details?
This is from the paper of Yevgeniy Dodis, Shai Halevi, and Tal Rabin
Could anyone provide some help about understanding how the following protocol is executed? The game is played based on the sequel ...
- 131
0
votes
1
answer
53
views
Is this a well defined sharing scheme to propose
A proposed secret sharing scheme: Suppose that $p:S\times Y\to X$, with $|Y|\geq|S|$ is a cipher where, $y\in Y$ is the key and $x\in X$ the code, $p$ is bijective, namely $(x,y)$ is associated with ...
- 261
0
votes
0
answers
46
views
Secure multi-party computation made simple - questions
The scheme that I refer to is from this paper.
A secret $s\in D$ is obtained by splitting s into a random sum. We have (actually linear) for any $k$ this $k$-out-of-$k$ secret-sharing scheme: Select $...
- 261
0
votes
0
answers
26
views
Could you provide the proof of a secure multi - secret sharing scheme that fulfils the requirements of correctness and information-theoretic privacy?
Suppose that we have a multi-secret sharing scheme and let $I$ be the a set of agents. Say that $S$ is the space of the (uniform) random variables $s=(s_1,s_2,\cdots,s_I)\in S$ such that the share $...
- 261
1
vote
0
answers
52
views
Could anybody help by applying a secure multiparty secret sharing scheme?
Suppose that we have a multi-secret sharing scheme as it is described in the literature
Let there be $I$ agents and say that $S$ is the space of the (uniform) random variables $s=(s_1,s_2,\cdots,s_I)\...
- 261
0
votes
1
answer
40
views
Is the Secret sharing scheme thresholds of variable of interest shared related with the entropy of the variable?
Is the $t$ out of $n$, namely $(t,n)$, threshold in the secret sharing scheme related to the entropy of the random variable that is shared according to the scheme?
What changes in the secret sharing ...
- 261
0
votes
0
answers
24
views
Could this scheme work for multiparty computation secret sharing?
Suppose that there are $5$ players and each of them learns a secret that is a coordinate of the random vector $s=(s_1,s_2,\cdots,s_5)$, such that $s$ is a uniformly distributed over the field $V$. ...
- 261
0
votes
0
answers
24
views
Secret sharing scheme combined with probability theory results?
As a sequel of my previous post I am writing a new one with respect to the secret sharing scheme. I will only cite here the answer because I want to make a question on it.
$\textbf{Answer:}$ To be ...
- 261
0
votes
0
answers
22
views
How to design such a secure multiparty computation scheme with the players using a majority rule
Suppose that $y$ is a uniform random variable that is defined over the field (or group or abelian group) $Y$. Let us suppose that there are $N=\{1,2,\cdots,i\cdots,N\}$ agents and only one of them, ...
- 261
0
votes
1
answer
58
views
Could this be a secure multiparty secret sharing scheme?
Suppose that $y$ is a uniform random variable that is defined over the field (or group or abelian group) $Y$. Let us suppose that there are $N=\{1,2,\cdots,i\cdots,N\}$ agents and only one of them, ...
- 261
2
votes
0
answers
79
views
Secure multiparty scheme in key (splitting) distribution among the players
Suppose that we have a game with $I$ players and each of them has a private secret say $e_i$. Every player wants to share her secret with the rest of the players but in such a way that she will not be ...
- 261
0
votes
0
answers
35
views
How can I enrich this mechanism of communication to become more efficient and secure?
Suppose that we have a Bayesian game, where $t_i\in T_i$ denotes the type of player $i$. Say that we have a communication game (communication equilibrium). The players do send each other an encrypted ...
- 261
0
votes
0
answers
12
views
How to design such a protocol that the agents could replicate the mediator by themselves?
A problem in game theory is that of communication. Taking into account the classic approach of Myerson and Forges, the agents communicate each other, however indirectly, through a communication ...
- 261
1
vote
1
answer
62
views
Generate asymmetric key pairs based on keywords such that any public key based on set containing the generating subset is valid
Let's assume we have a ton of users, and each user has a list of fruits they like - Those will be keywords. I want my users to be able to encode any data they store (Let's say, the location of their ...
- 111
0
votes
0
answers
41
views
Could anyone provide any idea of such a protocol?
Could anybody provide the seminal paper and/or every specific manual in mathematics that describes a secure multiparty computation procedure, where the players will exchange encrypted messages (...
- 261
0
votes
0
answers
24
views
Sharing information scheme of cryptography - operations in modular arithmetic
Taking into account my previous question here and the answer about the proposed encryption-decryption scheme. I am trying to understand how to make possible operations in modular arithmetic for a ...
- 261
2
votes
0
answers
72
views
No-dealer secret sharing scheme that prevents anonymous collaboration to reconstruct the secret
Is there a no-dealer secret sharing scheme that allows a threshold $k$ of $n$ parties (where $k<n$) to collaborate to reconstruct a secret, but in such a way that none of those $k$ parties are able ...
- 195
2
votes
1
answer
97
views
Why do we always assume that the functions that the protocols can replicate are of the form $f:\{0,1\}^*\to\{0,1\}^*$?
Taking into account the vast literature of secure multiparty computation and secret sharing, there is a specific assumption that is made for the calculation of a rule function. The latter function ...
- 261
0
votes
0
answers
37
views
Can we encode with the set of $\{0,1\}$ and its Boolean operations any finite or infinite domain?
Can we encode with the set of $\{0,1\}$ and its Boolean operations any infinite domain that is subset of the real numbers $\mathbb{R}$ or the whole set of real numbers? For example can we encode the ...
- 261
0
votes
0
answers
12
views
Efficient cheap talk communication in game theory
Are there any papers about efficient cheap talk communication, where the players achieve the equilibrium payoffs of a correlated strategy as in Aumann's seminal paper? Or in case no such paper exists, ...
- 261
2
votes
1
answer
133
views
Can anybody explain the proof of Rabin and Ben-or of secure multiparty computation?
Can anybody explain the proof of Rabin and Ben-or of secure multiparty computation?
The idea is that every player $i$, of $N<+\infty$ players, holds a secret say $s_i$. All of them want to share ...
- 261
0
votes
0
answers
24
views
Rational secure multiparty computation with permuatation secret sharing scheme?
Taking a look in this economic paper they use cryptographic tools to implement correletaed equilibria in the case of two plaeyrs. They use permutations for the exchange of information between the ...
- 261
0
votes
0
answers
22
views
Secure protocols by implementing cheap talk instead on a centralized mediator to compute any function $f(s_1,...,s_n) = (y_1,...,y_n)$?
Based on this paper a protocol is secure if and only if it satisfies secrecy and resiliency. Most of the papers in ecnomic and computer since deal with the following problem. They consider the case ...
- 261
2
votes
0
answers
51
views
For unequal set sizes in PSI: why should the party with fewer elements use cuckoo hash rather than simple hash?
Most PSI papers usually use hash-to-bin to improve the number of comparsons.
For unequal set sizes in 2PSI, I have read CCS17, which designs a PSI protocol for unequal size. The party with fewer ...
- 21