User menu

Encryption Switching Protocols

Bibliographic reference Couteau, Geoffroy ; Peters, Thomas ; Pointcheval, David. Encryption Switching Protocols.36th Annual International Cryptology Conference - Advances in Cryptology (CRYPTO 2016) (Santa Barbara (USA), du 14/08/2016 au 18/08/2016). In: Proceedings of the 36th Annual International Cryptology Conference - Advances in Cryptology (CRYPTO 2016), Springer : (Germany) Heidelberg2016, p.308-338
Permanent URL
  1. 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-3-662-46800-5_26
  2. 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-540-69053-0_33
  3. 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-3-642-29011-4_17
  4. 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/3-540-45539-6_31
  5. 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/3-540-48910-x_8
  6. Couteau, G., Peters, T., Pointcheval, D.: Encryption switching protocols. Cryptology ePrint Archive, Report 2015/990 (2015).
  7. 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-3-642-01957-9_8
  8. Damgård, I.B., Fujisaki, E.: A statistically-hiding integer commitment scheme based on groups with hidden order. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 125–142. Springer, Heidelberg (2002)
  9. Damgård, I.B., Jurik, M.: Client/server tradeoffs for online elections. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, pp. 125–140. Springer, Heidelberg (2002)
  10. 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-3-540-45146-4_15
  11. 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-3-642-32009-5_38
  12. Damgård Ivan, Zakarias Sarah, Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing, Theory of Cryptography (2013) ISBN:9783642365935 p.621-641, 10.1007/978-3-642-36594-2_35
  13. Demmler Daniel, Schneider Thomas, Zohner Michael, ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation, 10.14722/ndss.2015.23113
  14. Elgamal T., A public key cryptosystem and a signature scheme based on discrete logarithms, 10.1109/tit.1985.1057074
  15. Frederiksen, T.K., Nielsen, J.B., Orlandi, C.: Privacy-free garbled circuits with applications to efficient zero-knowledge. Cryptology ePrint Archive, Report 2014/598 (2014).
  16. Fujisaki Eiichiro, Okamoto Tatsuaki, Statistical zero knowledge protocols to prove modular polynomial relations, Advances in Cryptology — CRYPTO '97 (1997) ISBN:9783540633846 p.16-30, 10.1007/bfb0052225
  17. Gavin Gérald, Minier Marine, Oblivious Multi-variate Polynomial Evaluation, Progress in Cryptology - INDOCRYPT 2009 (2009) ISBN:9783642106279 p.430-442, 10.1007/978-3-642-10628-6_28
  18. Gentry Craig, Fully homomorphic encryption using ideal lattices, 10.1145/1536414.1536440
  19. Gentry, C., Halevi, S., Jutla, C., Raykova, M.: Private database access with HE-over-ORAM architecture. Cryptology ePrint Archive, Report 2014/345 (2014).
  20. Hazay Carmit, Mikkelsen Gert Læssøe, Rabin Tal, Toft Tomas, Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting, Lecture Notes in Computer Science (2012) ISBN:9783642279539 p.313-331, 10.1007/978-3-642-27954-6_20
  21. Henecka Wilko, K ögl Stefan, Sadeghi Ahmad-Reza, Schneider Thomas, Wehrenberg Immo, TASTY : tool for automating secure two-party computations, 10.1145/1866307.1866358
  22. Huang, Y., Evans, D., Katz, J.: Private set intersection: are garbled circuits better than custom protocols? In: NDSS 2012. The Internet Society, February 2012
  23. Jawurek, M., Kerschbaum, F., Orlandi, C.: Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently. Cryptology ePrint Archive, Report 2013/073 (2013).
  24. Kiayias, A., Tsiounis, Y., Yung, M.: Group encryption. Cryptology ePrint Archive, Report 2007/015 (2007).
  25. Kolesnikov Vladimir, Schneider Thomas, Improved Garbled Circuit: Free XOR Gates and Applications, Automata, Languages and Programming ISBN:9783540705826 p.486-498, 10.1007/978-3-540-70583-3_40
  26. Kranakis Evangelos, Primality and Cryptography, ISBN:9783322966483, 10.1007/978-3-322-96647-6
  27. Lim, H.W., Tople, S., Saxena, P., Chang, E.C.: Faster secure arithmetic computation using switchable homomorphic encryption. Cryptology ePrint Archive, Report 2014/539 (2014).
  28. Lindell Yehuda, Pinkas Benny, Secure Two-Party Computation via Cut-and-Choose Oblivious Transfer, Theory of Cryptography (2011) ISBN:9783642195709 p.329-346, 10.1007/978-3-642-19571-6_20
  29. Lipmaa, H.: On diophantine complexity and statistical zero-knowledge arguments. Cryptology ePrint Archive, Report 2003/105 (2003).
  30. Lipmaa Helger, Toft Tomas, Secure Equality and Greater-Than Tests with Sublinear Online Complexity, Automata, Languages, and Programming (2013) ISBN:9783642392115 p.645-656, 10.1007/978-3-642-39212-2_56
  31. Naor Moni, Pinkas Benny, Oblivious Polynomial Evaluation, 10.1137/s0097539704383633
  32. Nielsen Jesper Buus, Nordholt Peter Sebastian, Orlandi Claudio, Burra Sai Sheshank, A New Approach to Practical Active-Secure Two-Party Computation, Lecture Notes in Computer Science (2012) ISBN:9783642320088 p.681-700, 10.1007/978-3-642-32009-5_40
  33. Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999)
  34. Pedersen Torben Pryds, Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing, Advances in Cryptology — CRYPTO ’91 ISBN:9783540551881 p.129-140, 10.1007/3-540-46766-1_9
  35. Ranellucci, S., Tapp, A., Zakarias, R.W.: Efficient generic zero-knowledge proofs from commitments. Cryptology ePrint Archive, Report 2014/934 (2014).
  36. Schnorr C. P., Efficient Identification and Signatures for Smart Cards, Lecture Notes in Computer Science ISBN:9783540534334 p.688-689, 10.1007/3-540-46885-4_68
  37. Solovay R., Strassen V., A Fast Monte-Carlo Test for Primality, 10.1137/0206006
  38. Stadler Markus, Publicly Verifiable Secret Sharing, Advances in Cryptology — EUROCRYPT ’96 (1996) ISBN:9783540611868 p.190-199, 10.1007/3-540-68339-9_17
  39. Tassa Tamir, Jarrous Ayman, Ben-Ya'akov Yonatan, Oblivious evaluation of multivariate polynomials, 10.1515/jmc-2012-0007
  40. Tople Shruti, Shinde Shweta, Chen Zhaofeng, Saxena Prateek, AUTOCRYPT : enabling homomorphic computation on servers to protect sensitive web content, 10.1145/2508859.2516666
  41. Yao, A.C.C.: How to generate and exchange secrets (extended abstract). In: 27th FOCS, pp. 162–167. IEEE Computer Society Press, October 1986
  42. Ye Qingsong, Wang Huaxiong, Pieprzyk Josef, Zhang Xian-Mo, Efficient Disjointness Tests for Private Datasets, Information Security and Privacy ISBN:9783540699712 p.155-169, 10.1007/978-3-540-70500-0_12
  43. Yu Ching-Hua, Yang Bo-Yin, Probabilistically Correct Secure Arithmetic Computation for Modular Conversion, Zero Test, Comparison, MOD and Exponentiation, Lecture Notes in Computer Science (2012) ISBN:9783642329272 p.426-444, 10.1007/978-3-642-32928-9_24