Generalized Universal Circuits for Secure Evaluation of Private Functions with Application to Data Classification

Secure Evaluation of Private Functions (PF-SFE) allows two parties to compute a private function which is known by one party only on private data of both. It is known that PF-SFE can be reduced to Secure Function Evaluation (SFE) of a Universal Circuit (UC). Previous UC constructions only simulated circuits with gates of d = 2 inputs while gates with d > 2 inputs were decomposed into many gates with 2 inputs which is inefficient for large d as the size of UC heavily depends on the number of gates. We present generalized UC constructions to efficiently simulate any circuit with gates of d 2 inputs having efficient circuit representation. Our constructions are non-trivial generalizations of previously known UC constructions. As application we show how to securely evaluate private functions such as neural networks (NN) which are increasingly used in commercial applications. Our provably secure PF-SFE protocol needs only one round in the semi-honest model (or even no online communicati...

• Type: Conference
• Year: 2008
• Where: ICISC
• Authors: Ahmad-Reza Sadeghi, Thomas Schneider 0003
• Keywords: Cryptology, Generalized Uc, ICISC 2008, Private Functions, UC Constructions