Linear-Complexity Private Function Evaluation is Practical

DOI10.1007/978-3-030-59013-0_20MaRDI QIDQ6485994zbMATH OpenFDO

Authors Ágnes Kiss, Thomas Schneider

Publication date 22 December 2022

Published in 1522.68088 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-59013-0_20

Mathematics Subject Classification ID

Computer security (68M25) Data encryption (aspects in computer science) (68P25) Privacy of data (68P27) Cryptography (94A60)

Recommendations

• Constant-round private function evaluation with linear complexity
• Actively Secure Private Function Evaluation
• Making private function evaluation safer, faster, and simpler
• A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
• How to hide circuits in MPC an efficient framework for private function evaluation

Cited in

(11)

• Efficient protocols for oblivious linear function evaluation from ring-LWE
• Improved zero-knowledge argument of encrypted extended permutation
• Actively Secure Private Function Evaluation
• Constant-round private function evaluation with linear complexity
• Rate-limited secure function evaluation
• How to hide circuits in MPC an efficient framework for private function evaluation
• Making private function evaluation safer, faster, and simpler
• Constant-round multiparty private function evaluation with (quasi-)linear complexities
• PFE: linear active security, double-shuffle proofs, and low-complexity communication
• Breaking the size barrier: universal circuits meet lookup tables
• There is always an exception: controlling partial information leakage in secure computation

This page was built for publication: Linear-Complexity Private Function Evaluation is Practical

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6485994)