Constant-round private function evaluation with linear complexity
From MaRDI portal
Recommendations
- Linear-Complexity Private Function Evaluation is Practical
- Making private function evaluation safer, faster, and simpler
- How to hide circuits in MPC an efficient framework for private function evaluation
- Actively Secure Private Function Evaluation
- A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
Cited in
(23)- Efficient and scalable universal circuits
- How to circumvent the two-ciphertext lower bound for linear garbling schemes
- Making private function evaluation safer, faster, and simpler
- PFE: linear active security, double-shuffle proofs, and low-complexity communication
- Constant-round multiparty private function evaluation with (quasi-)linear complexities
- Efficient private PEZ protocols for symmetric functions
- Breaking the size barrier: universal circuits meet lookup tables
- How to hide circuits in MPC an efficient framework for private function evaluation
- Reducing garbled circuit size while preserving circuit gate privacy
- Improved zero-knowledge argument of encrypted extended permutation
- Rate-limited secure function evaluation
- Selective private function evaluation with applications to private statistics
- Secure multiparty computation with free branching
- Bitwise garbling schemes. A model with \(\frac{3}{2}\lambda \)-bit lower bound of ciphertexts
- Adaptively secure laconic function evaluation for \(\mathsf{NC}^1\)
- There is always an exception: controlling partial information leakage in secure computation
- Private Decision Tree Evaluation with Constant Rounds via (Only) Fair SS-4PC
- Private decision tree evaluation with constant rounds via (only) SS-3PC over ring
- Minimal-latency secure function evaluation
- Rate-limited secure function evaluation: definitions and constructions
- Two-message, oblivious evaluation of cryptographic functionalities
- Linear-Complexity Private Function Evaluation is Practical
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact
This page was built for publication: Constant-round private function evaluation with linear complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3102210)
