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 / Date: received 11 Feb 2014 Contact author: pmohasse at cpsc ucalgary ca,sadeghis@ucalgary ca,nigel@cs bris ac uk Available format(s): PDF | BibTeX Citation Version: 20140214:180314 (All versions of this report) Short URL: ia.cr/2014/102 Discussion forum: Show discussion | Start new discussion