[PDF] Top 20 Unconditionally Secure Computation with Reduced Interaction
Has 10000 "Unconditionally Secure Computation with Reduced Interaction" found on our website. Below are the top 20 most common "Unconditionally Secure Computation with Reduced Interaction".
Unconditionally Secure Computation with Reduced Interaction
... Very roughly, the intuition we will formalize is as follows: A player whose input matters to the result must somehow communicate his input to the rest of players, in order to enable correct computation of the ... See full document
30
On the Message Complexity of Secure Multiparty Computation
... Combining Theorem 4.1 and Theorem 4.3, we get the following corol- lary for message-optimal MPC with correlated randomness setup. Corollary 4.4. Suppose a one-way function exists. Then, any polyno- mial time n-party ... See full document
16
Unconditionally secure multi-party quantum commitment scheme
... and secure two-party computation [4]. Unconditionally secure bit commitment was thought to be impossible [5] until recent theoretical protocols [6] that combine with quantum mechanics and ... See full document
12
Non-Interactive Secure Multiparty Computation
... mined distribution. Such a setup is motivated by the possibility of securely realizing it during an offline preprocessing phase, which takes place before the inputs are known (see, e.g. [27], for further motivation). The ... See full document
43
Round and Communication Efficient Unconditionally-secure MPC with $t
... To design our protocol, we follow the standard offline-online paradigm, based on Beaver’s circuit rando- mization technique [2] and which is now the de facto style of designing efficient MPC protocols [3, 4, 5, 10, 14, ... See full document
30
Unconditionally secure cryptographic protocols from coding-theoretic primitives
... the computation of the shares and the reconstruction of the secret can be performed in linear ...Perfectly Secure Message Transmission or PSMT for ... See full document
161
Analysis of an unconditionally secure distributed oblivious transfer
... 4. Sender’s privacy with respect to a “greedy” receiver. Given the transcript of the interaction with k servers, the receiver should gain information about at most a single secret, and no information about the ... See full document
5
Secure Multiparty Computation between Distrusted Networks Terminals
... frequent interaction is undesirable in many applications such as batch processing in which one party needs to reuse many times the same se- cret information from another party, and asymmetric com- putation in ... See full document
10
Actively Private and Correct MPC Scheme in $t
... an unconditionally secure multi-party computation (MPC) scheme have been put into ...passively secure MPC schemes in which an adversary must follow the MPC ...passively secure MPC ... See full document
18
Multi-party computation with conversion of secret sharing
... an unconditionally secure setting, if the participants are given access to the auxiliary information distributed during a trusted setup phase, we achieve maximum level of security in MPC protocols, ... See full document
15
On the Communication Complexity of Secure Computation
... In secure multi-party computation, there has been a vast literature on information- theoretic security, focusing on building efficient protocols, as well as character- izing various aspects like corruption ... See full document
18
Fine-Grained Secure Computation
... Verifiable Computation, we also have information-theoretic protocols which are secure against any (possibly computationally unbounded) ...of interaction) and because our protocols work in the ... See full document
33
On the Communication required for Unconditionally Secure Multiplication
... are unconditionally secure and constant round protocols for any function [IK00] (which will, however, be very inefficient in general with respect to the compu- ...of computation [BFKR90, NN01] and ... See full document
30
Secure Multiparty Computation with General Interaction Patterns
... of interaction patterns (such as a chain or a ...of interaction patterns (such as ones forcing all inputs to be fixed), special functionalities (such as symmetric boolean functions) or when using a ... See full document
56
Secure Distributed Computation on Private Inputs
... two-party computation and lead to particularly efficient protocols for arithmetic circuits in terms of interaction and ...outsource computation on sensitive data to cloud ... See full document
9
Almost-Everywhere Secure Computation with Edge Corruptions
... a.e. secure computation protocol for node corruptions can be readily transformed into a corresponding ...a reduced fraction of edge ...(a.e. computation) protocol Π amongst p < n nodes, in ... See full document
20
Impossibility Results for Static Input Secure Computation
... two-party secure computation. The question of general secure computation with stateless parties has been studied in ...that secure com- putation with stateless parties should imply ... See full document
31
Unconditionally Secure Asynchronous Multiparty Computation with Linear Communication Complexity
... efficient unconditionally secure MPC protocols have been proposed [23, 22, 3, 18, 5, ...art unconditionally secure MPC protocols have linear ...known unconditionally secure MPC ... See full document
35
Adaptively Secure Computation with Partial Erasures
... for secure computation was one of a static adversary where the adversary controls a subset of the parties (who are called corrupted) before the protocol begins, and this subset cannot ...adaptively- ... See full document
33
Perfect Secure Computation in Two Rounds
... and has effective degree 2. We do this in a sequence of steps. The first step is noticing that we can get a “friendly” MPRE from any protocol for computing f, even one with many rounds. We stress that this will not be ... See full document
30
Related subjects