A Practical Universal Circuit Construction and Secure Evaluation of Private Functions

DOI10.1007/978-3-540-85230-8_7zbMath1385.94052OpenAlexW1772045830MaRDI QIDQ3603006

Thomas Schneider, Vladimir Kolesnikov

Publication date: 12 February 2009

Published in: Financial Cryptography and Data Security (Search for Journal in Brave)

Full work available at URL: https://encrypto.de/papers/KS08UC.pdf

zbMATH Keywords

privacyuniversal circuitSFE of private functions

Mathematics Subject Classification ID

Cryptography (94A60) Analytic circuit theory (94C05)

Related Items (14)

Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact ⋮ Practical attacks against the walnut digital signature scheme ⋮ One-Time Programs with Limited Memory ⋮ Improved zero-knowledge argument of encrypted extended permutation ⋮ Garbled circuits with sublinear evaluator ⋮ Making Private Function Evaluation Safer, Faster, and Simpler ⋮ Efficient and scalable universal circuits ⋮ How to Circumvent the Two-Ciphertext Lower Bound for Linear Garbling Schemes ⋮ \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication ⋮ Improved Garbled Circuit: Free XOR Gates and Applications ⋮ Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free ⋮ Masked triples. Amortizing multiplication triples across conditionals ⋮ Hashing Garbled Circuits for Free ⋮ Zero-knowledge proofs for committed symmetric Boolean functions

Cites Work

• A proof of security of Yao's protocol for two-party computation
• Conditional Encrypted Mapping and Comparing Encrypted Numbers
• Universal circuits (Preliminary Report)
• Private Searching on Streaming Data
• A Permutation Network
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Practical Universal Circuit Construction and Secure Evaluation of Private Functions