Constant-Round Private Function Evaluation with Linear Complexity

DOI10.1007/978-3-642-25385-0_30zbMath1227.94050OpenAlexW142017860MaRDI QIDQ3102210

Lior Malka, Jonathan N. Katz

Publication date: 2 December 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25385-0_30

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (6)

Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact ⋮ Improved zero-knowledge argument of encrypted extended permutation ⋮ Secure multiparty computation with free branching ⋮ 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

Uses Software

• TASTY

This page was built for publication: Constant-Round Private Function Evaluation with Linear Complexity