Making private function evaluation safer, faster, and simpler
From MaRDI portal
Publication:5087263
Recommendations
- Constant-round private function evaluation with linear complexity
- 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
- There is always an exception: controlling partial information leakage in secure computation
Cites work
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
- A proof of security of Yao's protocol for two-party computation
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Actively Secure Private Function Evaluation
- Actively secure OT extension with optimal overhead
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Black-box transformations from passive to covert security with public verifiability
- Blazing fast OT for three-round UC OT extension
- Blind polynomial evaluation and data trading
- Calling out cheaters: covert security with public verifiability
- Constant-round private function evaluation with linear complexity
- Covert security with public verifiability: faster, leaner, and simpler
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
- Efficient and scalable universal circuits
- Efficient secure two-party protocols. Techniques and constructions
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Fully homomorphic encryption using ideal lattices
- Generic compiler for publicly verifiable covert multi-party computation
- How to hide circuits in MPC an efficient framework for private function evaluation
- More efficient universal circuit constructions
- Number-theoretic constructions of efficient pseudo-random functions
- Oblivious Polynomial Evaluation
- Oblivious polynomial evaluation and oblivious neural learning
- Public verifiability in the covert model (almost) for free
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact
- Secure circuit evaluation. A protocol based on hiding information from an oracle
- Security against covert adversaries: Efficient protocols for realistic adversaries
- Universal circuits (Preliminary Report)
- Valiant's universal circuit is practical
- Valiant's universal circuits revisited: an overall improvement and a lower bound
Cited in
(10)- Constant-round private function evaluation with linear complexity
- Actively Secure Private Function Evaluation
- There is always an exception: controlling partial information leakage in secure computation
- Linear-Complexity Private Function Evaluation is Practical
- How to hide circuits in MPC an efficient framework for private function evaluation
- Improved zero-knowledge argument of encrypted extended permutation
- PFE: linear active security, double-shuffle proofs, and low-complexity communication
- Constant-round multiparty private function evaluation with (quasi-)linear complexities
- Breaking the size barrier: universal circuits meet lookup tables
- Robust publicly verifiable covert security: limited information leakage and guaranteed correctness with low overhead
This page was built for publication: Making private function evaluation safer, faster, and simpler
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087263)
