PFE: linear active security, double-shuffle proofs, and low-complexity communication

DOI10.1007/978-981-97-0942-7_12zbMATH Open1543.94731MaRDI QIDQ6573663FDOQ6573663

Authors: Hanyu Jia, Xiangxue Li 

Publication date: 17 July 2024

Recommendations

• Actively Secure Private Function Evaluation
• Linear-Complexity Private Function Evaluation is Practical
• Constant-round private function evaluation with linear complexity
• Constant-round multiparty private function evaluation with (quasi-)linear complexities
• Making private function evaluation safer, faster, and simpler

zbMATH Keywords

shufflezero-knowledge proofprivate function evaluationactive securityextended permutation

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• A proof of security of Yao's protocol for two-party computation
• A Permutation Network
• A verifiable secret shuffle of homomorphic encryptions
• Proofs of Restricted Shuffles
• Efficient and scalable universal circuits

This page was built for publication: PFE: linear active security, double-shuffle proofs, and low-complexity communication

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