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

DOI10.1007/978-981-97-0942-7_12MaRDI QIDQ6573663zbMATH OpenFDO

Authors Hanyu Jia, Xiangxue Li

Publication date 17 July 2024

zbMATH Keywords

shufflezero-knowledge proofprivate function evaluationactive securityextended permutation

Mathematics Subject Classification ID

Cryptography (94A60)

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

Cites work

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

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)