Making Private Function Evaluation Safer, Faster, and Simpler
Authors:
- 27 February 2022
- book chapter
- Published by Springer Nature
- p. 349-378
Abstract
No abstract availableKeywords
This publication has 41 references indexed in Scilit:
- How to Hide Circuits in MPC an Efficient Framework for Private Function Evaluation2013
- Calling Out Cheaters: Covert Security with Public Verifiability2012
- Security Against Covert Adversaries: Efficient Protocols for Realistic AdversariesJournal of Cryptology, 2009
- A Proof of Security of Yao’s Protocol for Two-Party ComputationJournal of Cryptology, 2008
- A Practical Universal Circuit Construction and Secure Evaluation of Private Functions2008
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries2007
- Oblivious Polynomial EvaluationSIAM Journal on Computing, 2006
- Oblivious polynomial evaluation and oblivious neural learningTheoretical Computer Science, 2005
- Number-theoretic constructions of efficient pseudo-random functionsJournal of the ACM, 2004
- Secure circuit evaluationJournal of Cryptology, 1990