Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with multiparty-computation
Search options answers only
not deleted
user 11378
Multi-party computation (MPC) allows a set of parties, each with a private input, to securely and jointly perform any computation over their inputs.
3
votes
Motivation for the definition of statistical distance
Statistical indistinguishability (i.e., negligible statistical distance) implies computational indistinguishability, but is typically easier to prove since it does not require a computational argument …
- 8,202
3
votes
Accepted
Simulation-based proofs - advice tape of reduction algorithm
Yes.
We work under the assumption that the protocol is not secure, which means that for infinitely many $n$, there is a pair of inputs $(x,y)$ on which the simulation fails (i.e., when the inputs are …
- 8,202
5
votes
Accepted
Suppose $A$ knows $a$ and $B$ knows $b$, is it possible to efficiently compute $g^{ab}$ with...
It's not possible because if $B$ knows $b$ and $g^{ab}$, then she can compute $\left(g^{ab}\right)^{b^{-1} \bmod N} = g^a$ (where $N$ is the order of $g$, which is normally prime so that $b^{-1} \bmod …
- 8,202
4
votes
Accepted
Definition of secure computation with more that two parties
It is not enough to be able to simulate the view of a single party, because corrupted parties may cooperate. As mentioned in the book, it may be easier to view all the corrupted parties as a single en …
- 8,202
1
vote
Accepted
Simulation based proofs, what am I missing?
Basically, what you are missing is that the real view for a given input pair must be indistinguishable from the simulated view for the same input pair.
Remember that, put simply, the requirement is t …
- 8,202
5
votes
Accepted
Concept Question for Secure Computation
As in the linked question, what you are missing is that the simulated view for a given input pair must be indistinguishable from the simulated view for the same input pair.
So if $A$'s input $s$ is $ …
- 8,202
9
votes
Accepted
Simulation based proofs: Simple examples
The simplest example I know of is actually for a pathological case. Namely, it is presented in Chapter 2 of the book of Hazay and Lindell as an example of a two-party MPC protocol which is secure agai …
- 8,202
1
vote
The main differences between Sketch of Proof and Full proof
Why do most of papers in the well-known conferences provide only the proof sketch?
Space constraints, mostly (the paper has to fit in a certain number of pages). Often, the full proofs are given …
- 8,202