Cryptology ePrint Archive: Report 2014/102
Actively Secure Private Function Evaluation
Payman Mohassel and Saeed Sadeghian and Nigel P. Smart
Abstract: We propose the first general framework for designing actively secure private function evaluation (PFE), not based on universal circuits. Our framework is naturally divided into pre-processing and online stages and can be instantiated using any generic actively secure multiparty computation (MPC) protocol.
Our framework helps address the main open questions about efficiency of actively secure PFE. On the theoretical side, our framework yields the first actively secure PFE with linear complexity in the circuit size. On the practical side, we obtain the first actively secure PFE for arithmetic circuits with $O(g \cdot \log g)$ complexity where $g$ is the circuit size. The best previous construction (of practical interest) is based on an arithmetic universal circuit and has complexity $O(g^5)$.
We also introduce the first linear Zero-Knowledge proof of correctness of ``extended permutation" of ciphertexts (a generalization of ZK proof of correct shuffles) which maybe of independent interest.
Category / Keywords: cryptographic protocols /
Original Publication (with major differences): IACR-ASIACRYPT-2014
Date: received 11 Feb 2014, last revised 18 Dec 2014
Contact author: pmohasse at cpsc ucalgary ca,sadeghis@ucalgary ca,nigel@cs bris ac uk
Available format(s): PDF | BibTeX Citation
Version: 20141218:092120 (All versions of this report)
Short URL: ia.cr/2014/102
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]