Constant-round multiparty private function evaluation with (quasi-)linear complexities
From MaRDI portal
Publication:6535112
DOI10.1007/978-3-031-33491-7_5zbMATH Open1540.68092MaRDI QIDQ6535112FDOQ6535112
Authors: Yongfeng Xu, Hanyu Jia, Xiangxue Li, Qiang Li, Yu'e Bao, Xintian Hou 
Publication date: 10 November 2023
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
linear complexitysecure multiparty computationquasi-linear complexityprivate function evaluationconstant rounds
Cryptography (94A60) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Privacy of data (68P27)
Cites Work
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Advances in Cryptology - CRYPTO 2003
- A Permutation Network
- Optimizing authenticated garbling for faster secure two-party computation
- Improved OT extension for transferring short secrets
- Universal circuits (Preliminary Report)
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
- More efficient universal circuit constructions
- Valiant's universal circuit is practical
- Efficient three-party computation from cut-and-choose
- How to hide circuits in MPC an efficient framework for private function evaluation
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact
- Efficient and scalable universal circuits
- Constant-round private function evaluation with linear complexity
- Actively Secure Private Function Evaluation
- Making private function evaluation safer, faster, and simpler
- Linear-Complexity Private Function Evaluation is Practical
Cited In (5)
- PFE: linear active security, double-shuffle proofs, and low-complexity communication
- Constant-Rounds, Linear Multi-party Computation for Exponentiation and Modulo Reduction with Perfect Security
- Constant-round linear-broadcast secure computation with penalties
- Function-private conditional disclosure of secrets and multi-evaluation threshold distributed point functions
- Constant-Round Multi-party Private Set Union Using Reversed Laurent Series
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)
