Constant-round multiparty private function evaluation with (quasi-)linear complexities

DOI10.1007/978-3-031-33491-7_5MaRDI QIDQ6535112zbMATH OpenFDO

Authors Yongfeng Xu, Hanyu Jia, Xiangxue Li, Qiang Li, Yu'e Bao, Xintian Hou

Publication date 10 November 2023

zbMATH Keywords

linear complexitysecure multiparty computationquasi-linear complexityprivate function evaluationconstant rounds

Mathematics Subject Classification ID

Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Privacy of data (68P27)

Recommendations

• Constant-round private function evaluation with linear complexity
• Making private function evaluation safer, faster, and simpler
• Linear-Complexity Private Function Evaluation is Practical
• Actively Secure Private Function Evaluation
• How to hide circuits in MPC an efficient framework for private function evaluation

Cites work

• A Permutation Network
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Actively Secure Private Function Evaluation
• Advances in Cryptology - CRYPTO 2003
• Constant-round private function evaluation with linear complexity
• Efficient and scalable universal circuits
• Efficient three-party computation from cut-and-choose
• How to hide circuits in MPC an efficient framework for private function evaluation
• Improved OT extension for transferring short secrets
• Linear-Complexity Private Function Evaluation is Practical
• Making private function evaluation safer, faster, and simpler
• More efficient universal circuit constructions
• Optimizing authenticated garbling for faster secure two-party computation
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact
• Two halves make a whole: reducing data transfer in garbled circuits using half gates
• Universal circuits (Preliminary Report)
• Valiant's universal circuit is practical

Cited in

(5)

• Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security
• Constant-round linear-broadcast secure computation with penalties
• PFE: linear active security, double-shuffle proofs, and low-complexity communication
• Constant-Round Multi-party Private Set Union Using Reversed Laurent Series
• Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions

This page was built for publication: Constant-round multiparty private function evaluation with (quasi-)linear complexities

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