A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Black-Box Proof of Knowledge of Plaintext and Multiparty Computation with Low Communication Overhead
[chapter]
2013
Lecture Notes in Computer Science
We present a 2-round protocol to prove knowledge of a plaintext corresponding to a given ciphertext. Our protocol is black-box in the underlying cryptographic primitives and it can be instantiated with almost any fully homomorphic encryption scheme. Since our protocol is only 2 rounds it cannot be zero-knowledge [GO94]; instead, we prove that our protocol ensures the semantic security of the underlying ciphertext. To illustrate the merit of this relaxed proof of knowledge property, we use our
doi:10.1007/978-3-642-36594-2_23
fatcat:uqboiem2ijbsff2utlxmbd74la