Making Private Function Evaluation Safer, Faster, and Simpler
From MaRDI portal
Publication:5087263
DOI10.1007/978-3-030-97121-2_13zbMath1492.94144OpenAlexW4214513733MaRDI QIDQ5087263
No author found.
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
secure two-party computationprivate function evaluationextended permutationpublicly verifiable covert security
Cites Work
- Unnamed Item
- Secure circuit evaluation. A protocol based on hiding information from an oracle
- Efficient secure two-party protocols. Techniques and constructions
- A proof of security of Yao's protocol for two-party computation
- More efficient universal circuit constructions
- 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
- Blind polynomial evaluation and data trading
- Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact
- Valiant's universal circuits revisited: an overall improvement and a lower bound
- Efficient and scalable universal circuits
- Security against covert adversaries: Efficient protocols for realistic adversaries
- Covert security with public verifiability: faster, leaner, and simpler
- Oblivious polynomial evaluation and oblivious neural learning
- Public Verifiability in the Covert Model (Almost) for Free
- Valiant’s Universal Circuit is Practical
- Efficient Zero-Knowledge Argument for Correctness of a Shuffle
- Actively Secure Private Function Evaluation
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Constant-Round Private Function Evaluation with Linear Complexity
- Number-theoretic constructions of efficient pseudo-random functions
- Actively Secure OT Extension with Optimal Overhead
- A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
- Universal circuits (Preliminary Report)
- Calling Out Cheaters: Covert Security with Public Verifiability
- How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation
- Fully homomorphic encryption using ideal lattices
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Oblivious Polynomial Evaluation
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
This page was built for publication: Making Private Function Evaluation Safer, Faster, and Simpler
