Anzeige
Erschienen in:
2008 | OriginalPaper | Buchkapitel
A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
verfasst von : Vladimir Kolesnikov, Thomas Schneider
Erschienen in: Financial Cryptography and Data Security
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
We consider general secure function evaluation (SFE) of
private functions
(PF-SFE). Recall, privacy of functions is often most efficiently achieved by general SFE [18,19,10] of a Universal Circuit (UC).
Our main contribution is a new simple and efficient UC construction. Our circuit UC
k
, universal for circuits of
k
gates, has size ~1.5
k
log
2
k
and depth ~
k
log
k
. It is up to 50% smaller than the best UC (of Valiant [16], of size ~19
k
log
k
) for circuits of size up to ≈ 5000 gates.
Our improvement results in corresponding performance improvement of SFE of (small) private functions. Since, due to cost, only small circuits (i.e. < 5000 gates) are practical for PF-SFE, our construction appears to be the best fit for many practical PF-SFE.
We implement PF-SFE based on our UC and Fairplay SFE system [11].