Making private function evaluation safer, faster, and simpler
From MaRDI portal
Publication:5087263
DOI10.1007/978-3-030-97121-2_13zbMATH Open1492.94144OpenAlexW4214513733MaRDI QIDQ5087263FDOQ5087263
Authors:
Publication date: 8 July 2022
Published in: Public-Key Cryptography – PKC 2022 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-97121-2_13
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
secure two-party computationprivate function evaluationextended permutationpublicly verifiable covert security
Cites Work
- Fully homomorphic encryption using ideal lattices
- A proof of security of Yao's protocol for two-party computation
- Title not available (Why is that?)
- Security against covert adversaries: Efficient protocols for realistic adversaries
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
- A public key cryptosystem and a signature scheme based on discrete logarithms
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Efficient secure two-party protocols. Techniques and constructions
- Number-theoretic constructions of efficient pseudo-random functions
- Oblivious Polynomial Evaluation
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Secure circuit evaluation. A protocol based on hiding information from an oracle
- Universal circuits (Preliminary Report)
- Actively secure OT extension with optimal overhead
- More efficient universal circuit constructions
- Valiant's universal circuit is practical
- A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
- How to hide circuits in MPC an efficient framework for private function evaluation
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact
- Efficient and scalable universal circuits
- Oblivious polynomial evaluation and oblivious neural learning
- Blazing fast OT for three-round UC OT extension
- Generic compiler for publicly verifiable covert multi-party computation
- Black-box transformations from passive to covert security with public verifiability
- Valiant's universal circuits revisited: an overall improvement and a lower bound
- Covert security with public verifiability: faster, leaner, and simpler
- Public verifiability in the covert model (almost) for free
- Calling out cheaters: covert security with public verifiability
- Blind polynomial evaluation and data trading
- Constant-round private function evaluation with linear complexity
- Actively Secure Private Function Evaluation
Cited In (10)
- PFE: linear active security, double-shuffle proofs, and low-complexity communication
- Constant-round private function evaluation with linear complexity
- 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
- How to hide circuits in MPC an efficient framework for private function evaluation
- Improved zero-knowledge argument of encrypted extended permutation
- Actively Secure Private Function Evaluation
- There is always an exception: controlling partial information leakage in secure computation
- Linear-Complexity Private Function Evaluation is Practical
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)
