Best Possible Information-Theoretic MPC

Halevi, Shai; Ishai, Yuval; Kushilevitz, Eyal; Rabin, Tal

doi:10.1007/978-3-030-03810-6_10

Cited by 14 publications

(2 citation statements)

References 33 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Elemental as it seems, this minimal secure computation problem preserves most challenging features of general secure computation; in particular, feasibility results remain strong and optimality results remain weak, i.e., any function f can be computed securely while the construction of efficient codes remains open in general [12,13]. In this work, we focus exclusively on the original three-party formulation of minimal secure computation [12], but note that many interesting variants have been studied (sometimes under different names to highlight different assumptions) in the literature, e.g., more than three parties [14][15][16], colluding parties [17][18][19][20], other security notions [21], and unresponsive parties [22].…”

Section: Introductionmentioning

confidence: 99%

Expand-and-Randomize: An Algebraic Approach to Secure Computation

Zhao

Sun

2021

Entropy

View full text Add to dashboard Cite

We consider the secure computation problem in a minimal model, where Alice and Bob each holds an input and wish to securely compute a function of their inputs at Carol without revealing any additional information about the inputs. For this minimal secure computation problem, we propose a novel coding scheme built from two steps. First, the function to be computed is expanded such that it can be recovered while additional information might be leaked. Second, a randomization step is applied to the expanded function such that the leaked information is protected. We implement this expand-and-randomize coding scheme with two algebraic structures—the finite field and the modulo ring of integers, where the expansion step is realized with the addition operation and the randomization step is realized with the multiplication operation over the respective algebraic structures.

show abstract

Section: Introductionmentioning

confidence: 99%

Expand-and-Randomize: An Algebraic Approach to Secure Computation

Zhao

Sun

2021

Entropy

View full text Add to dashboard Cite

show abstract

“…Elemental as it seems, this minimal secure computation problem preserves most challenging features of general secure computation; in particular, feasibility results remain strong and optimality results remain weak, i.e., any function f can be computed securely while efficient codes are mostly not available [11,12]. In this work we focus exclusively on the original three-party formulation of minimal secure computation [11], but note that many interesting variants have been studied (sometimes under different names to highlight different assumptions) in the literature, e.g., more than three parties [13][14][15], colluding parties [16][17][18][19], other security notions [20], and unresponsive parties [21].…”

Section: Introductionmentioning

confidence: 99%

Expand-and-Randomize: An Algebraic Approach to Secure Computation

Zhao,

Sun

2020

Preprint

View full text Add to dashboard Cite

We consider the secure computation problem in a minimal model, where Alice and Bob each holds an input and wish to securely compute a function of their inputs at Carol without revealing any additional information about the inputs. For this minimal secure computation problem, we propose a novel coding scheme built from two steps. First, the function to be computed is expanded such that it can be recovered while additional information might be leaked. Second, a randomization step is applied to the expanded function such that the leaked information is protected. We implement this expand-and-randomize coding scheme with two algebraic structures -the finite field and the modulo ring of integers, where the expansion step is realized with the addition operation and the randomization step is realized with the multiplication operation over the respective algebraic structures.

show abstract