Damgård Ivan, Pastro Valerio, Smart Nigel, Zakarias Sarah, Multiparty Computation from Somewhat Homomorphic Encryption, Lecture Notes in Computer Science (2012) ISBN:9783642320088 p.643-662, 10.1007/978-9-5_38.

Damgård Ivan, Nielsen Jesper Buus, Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption, Advances in Cryptology - CRYPTO 2003 (2003) ISBN:9783540406747 p.247-264, 10.1007/978-6-4_15.

Damgård, I.B., Jurik, M.: Client/server tradeoffs for online elections.

Damgård, I.B., Fujisaki, E.: A statistically-hiding integer commitment scheme based on groups with hidden order.

Dachman-Soled Dana, Malkin Tal, Raykova Mariana, Yung Moti, Efficient Robust Private Set Intersection, Applied Cryptography and Network Security (2009) ISBN:9783642019562 p.125-142, 10.1007/978-7-9_8.

Cryptology ePrint Archive, Report 2015/990 (2015).

Couteau, G., Peters, T., Pointcheval, D.: Encryption switching protocols.

Camenisch Jan, Michels Markus, Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes, Advances in Cryptology - EUROCRYPT ’99 (1999) ISBN:9783540658894 p.107-122, 10.1007/0-x_8.

Boudot Fabrice, Efficient Proofs that a Committed Number Lies in an Interval, Advances in Cryptology - EUROCRYPT 2000 (2000) ISBN:9783540675174 p.431-444, 10.1007/9-6_31.

Bayer Stephanie, Groth Jens, Efficient Zero-Knowledge Argument for Correctness of a Shuffle, Advances in Cryptology – EUROCRYPT 2012 (2012) ISBN:9783642290107 p.263-280, 10.1007/978-1-4_17.

Barić Niko, Pfitzmann Birgit, Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees, Advances in Cryptology - EUROCRYPT ’97 (1997) ISBN:9783540629757 p.480-494, 10.1007/3-0_33.

Asharov Gilad, Lindell Yehuda, Schneider Thomas, Zohner Michael, More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries, Advances in Cryptology - EUROCRYPT 2015 (2015) ISBN:9783662467992 p.673-701, 10.1007/978-0-5_26.

We additionally prove this is enough to argue the security of our general 2-PC protocol against malicious adversaries. This enhancement relies on a new technique called refreshable twin ciphertext pool, which we show being of independent interest. Eventually, we also instantiate secure ESPs between the two schemes, in front of malicious adversaries.

Since no such pair of public-key encryption schemes appeared in the literature, except for the non-interactive case of fully homomorphic encryption which still remains prohibitive in practice, we build the ﬁrst multiplicatively homomorphic ElGamal-like encryption scheme over (Zn,×) as a complement to the Paillier encryption scheme over (Zn,+), where n is a strong RSA modulus. Indeed, assuming the compatibility of two additively and multiplicatively homomorphic encryption schemes, switching ciphertexts makes it possible to eﬃciently reconcile the two internal laws. In particular, our new paradigm is tailored to the evaluation of functions over rings.

Although ESP is a special kind of two-party computation protocol, it turns out that ESP implies general two-party computation (2-PC) under natural conditions.

Intuitively, this two-party protocol converts given ciphertexts from one scheme into ciphertexts of the same messages under the other scheme, for any polynomial number of switches, in any direction. We formally deﬁne the primitive of encryption switching protocol (ESP), allowing to switch between two encryption schemes.

Autocrypt hommorphic