Actively Secure Private Function Evaluation
From MaRDI portal
Recommendations
- Minimal-latency secure function evaluation
- Communication preserving protocols for secure function evaluation
- Rate-limited secure function evaluation
- High-precision privacy-preserving real-valued function evaluation
- On Function Computation With Privacy and Secrecy Constraints
- Linear-Complexity Private Function Evaluation is Practical
- Function-private functional encryption in the private-key setting
- Function-private functional encryption in the private-key setting
- Making private function evaluation safer, faster, and simpler
Cited in
(15)- Improved zero-knowledge argument of encrypted extended permutation
- Secure multiparty computation with free branching
- Efficient and scalable universal circuits
- High-precision privacy-preserving real-valued function evaluation
- Maliciously circuit-private multi-key FHE and MPC based on LWE
- Constant-round private function evaluation with linear complexity
- How to hide circuits in MPC an efficient framework for private function evaluation
- Making private function evaluation safer, faster, and simpler
- Communication preserving protocols for secure function evaluation
- Circuit-private multi-key FHE
- Count me in! Extendability for threshold ring signatures
- Linear-Complexity Private Function Evaluation is Practical
- Constant-round multiparty private function evaluation with (quasi-)linear complexities
- PFE: linear active security, double-shuffle proofs, and low-complexity communication
- There is always an exception: controlling partial information leakage in secure computation
This page was built for publication: Actively Secure Private Function Evaluation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936625)
