Anzeige
Erschienen in:
2005 | OriginalPaper | Buchkapitel
An Improved Secure Two-Party Computation Protocol
verfasst von : Yu Yu, Jussipekka Leiwo, Benjamin Premkumar
Erschienen in: Information Security and Cryptology
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Alice and Bob with their private inputs
x
n
and
y
n
respectively, want to compute
f
n
(
x
n
,
y
n
) for some publicly known function
f
n
without disclosing information regarding their private inputs more than what can be inferred from
f
n
(
x
n
,
y
n
). This problem is referred to as a secure two-party computation and Yao proposed a solution to privately compute
f
n
using garbled circuits. In this paper, we improve the efficiency of circuit by hardwiring the input of Alice in the circuit without compromising privacy. Using a typical two-party computation problem, namely, the Millionaire Problem, we show that our method reduces circuit size significantly specially for circuits whose fan-in is bounded by 2. We also show that the protocol using the reduced circuit is provably secure.