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 questions only
not deleted
user 28163
Multi-party computation (MPC) allows a set of parties, each with a private input, to securely and jointly perform any computation over their inputs.
4
votes
1
answer
247
views
BGV KeyGen-- Can a maliciously-generated secret-shared key break security (e.g. SPDZ)?
I was (re)reading the paper "Practical Covertly Secure MPC for Dishonest Majority–or: Breaking the SPDZ Limits".
One of the key points in this paper is that they present a covertly secure BGV key gen …
- 683
4
votes
1
answer
109
views
Under what conditions is broadcast possible? (Cryptographically, and in the model of Maurer ...
In this paper, Ueli Maurer uses a very cool model to generalize a number of results about broadcast, secret sharing and secure multiparty computation. Rather than talking about an adversary being eith …
- 683
8
votes
1
answer
174
views
BGW Theorem 2- Does this proof work?
I was reading the original BGW paper. Great paper. I'm confused about Theorem 2, though.
The Theorem states, "There are functions for which there are no n/2-private protocols."
The proof is simply t …
- 683
5
votes
1
answer
384
views
Communication Complexity of Equality comparison (Catrina and de Hoogh)
I was reading secure MPC protocol for finding a secret representation of whether a secret value equals zero, from Catrina and de Hoogh (summarized here).
In the paper, the communication complexity co …
- 683
2
votes
2
answers
1k
views
SPDZ- How to do secure equality comparison
The SPDZ paper explains how the SPDZ protocol can be used to find the sum/product of secret values and find the sum/product of a secret and a non-secret value (page 6).
The paper seems to say that fr …
- 683
3
votes
1
answer
753
views
SPDZ- How to do secure less-than comparison
The SPDZ paper explains how the SPDZ protocol can be used to find the sum/product of secret values and find the sum/product of a secret and a non-secret value (page 6).
The paper seems to say that fr …
- 683
2
votes
0
answers
429
views
SPDZ Implementation [closed]
I am looking for a publicly available implementation of the SPDZ protocol. So far I have found the following:
An implementation by Vitor Enes: Depends on trusted dealer for offline phase.
The Fresco …
- 683
5
votes
1
answer
2k
views
SPDZ protocol: how expensive is it to generate the multiplicative triples?
I am currently reading the full version of the SPDZ protocol. I understand that the online phase does multiplication with computational and communication complexity $O(n)$ by using Beaver's multiplica …
- 683
3
votes
1
answer
806
views
Yao's Garbled circuit: Does Bob ever see the circuit?
I asked a question about whether the circuit structure for Yao's garbled circuit needs to be rearranged. I understand from Yehuda Lindell's response that the circuit structure itself does not need to …
- 683
5
votes
2
answers
770
views
Yao's Garbled Circuit- Why does Alice need to rearrange the circuit?
My understanding of Yao's Garbled Circuit (based mostly on this summary) is as follows:
Alice creates a garbled circuit based on the function f to be computed. She then hard-codes her input into the …
- 683