Non-commutative arithmetic circuits: depth reduction and size lower bounds, Theoretical Computer Science, vol.209, issue.1-2, pp.47-86, 1998. ,
DOI : 10.1016/S0304-3975(97)00227-2
URL : http://doi.org/10.1016/s0304-3975(97)00227-2
Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE, EUROCRYPT 2012, pp.483-501, 2012. ,
DOI : 10.1007/978-3-642-29011-4_29
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.225.2213
More Efficient Oblivious Transfer Extensions with Security for Malicious Adversaries, EUROCRYPT 2015, Part I. LNCS, pp.673-701, 2015. ,
DOI : 10.1007/978-3-662-46800-5_26
Foundations of Secure Interactive Computing, CRYPTO'91, pp.377-391, 1992. ,
DOI : 10.1007/3-540-46766-1_31
Semi-homomorphic Encryption and Multiparty Computation, EUROCRYPT 2011, pp.169-188, 2011. ,
DOI : 10.1007/978-3-642-20465-4_11
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.400.6491
A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation, FC 2006, pp.142-147, 2006. ,
DOI : 10.1007/11889663_10
On the Portability of Generalized Schnorr Proofs, EUROCRYPT 2009, pp.425-442, 2009. ,
DOI : 10.1007/11556992_11
Security and Composition of Multiparty Cryptographic Protocols, Journal of Cryptology, vol.13, issue.1, pp.143-202, 2000. ,
DOI : 10.1007/s001459910006
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.4870
Linearly homomorphic encryption from DDH, CT-RSA 2015, pp.487-505, 2015. ,
DOI : 10.1007/978-3-319-16715-2_26
URL : https://hal.archives-ouvertes.fr/hal-01213284
Encryption Switching Protocols, CRYPTO 2016, Part I. LNCS, pp.308-338, 2016. ,
DOI : 10.1007/978-3-642-32928-9_24
URL : https://hal.archives-ouvertes.fr/hal-01407341
Multiparty computation from threshold homomorphic encryption, EUROCRYPT 2001, pp.280-299 ,
DOI : 10.7146/brics.v7i14.20141
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.5028
A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order, ASIACRYPT 2002, pp.125-142 ,
DOI : 10.1007/3-540-36178-2_8
Generic Lower Bounds for Root Extraction and Signature Schemes in General Groups, EUROCRYPT 2002, pp.256-271, 2002. ,
DOI : 10.1007/3-540-46035-7_17
Efficient, Robust and Constant-Round Distributed RSA Key Generation, TCC 2010, pp.183-200, 2010. ,
DOI : 10.1145/359168.359176
Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption, CRYPTO 2003, pp.247-264, 2003. ,
DOI : 10.1007/978-3-540-45146-4_15
Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing, TCC 2013, pp.621-641, 2013. ,
DOI : 10.1007/978-3-642-36594-2_35
Threshold cryptosystems, CRYPTO'89, pp.307-315, 1990. ,
DOI : 10.1007/3-540-57220-1_47
A public key cryptosystem and a signature scheme based on discrete logarithms, IEEE Transactions on Information Theory, vol.31, issue.4, pp.469-472, 1985. ,
DOI : 10.1109/TIT.1985.1057074
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.476.4791
Sharing Decryption in the Context of Voting or Lotteries, FC 2000, pp.90-104, 2001. ,
DOI : 10.1007/3-540-45472-1_7
URL : https://hal.archives-ouvertes.fr/inria-00565275
Oblivious Multi-variate Polynomial Evaluation, DOCRYPT 2009, pp.430-442, 2009. ,
DOI : 10.1007/978-3-642-10628-6_28
URL : https://hal.archives-ouvertes.fr/inria-00524361
Trapdoors for hard lattices and new cryptographic constructions, Proceedings of the fourtieth annual ACM symposium on Theory of computing, STOC 08, pp.197-206, 2008. ,
DOI : 10.1145/1374376.1374407
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.7052
How to play any mental game or A completeness theorem for protocols with honest majority, 19th ACM STOC, pp.218-229, 1987. ,
Probabilistic encryption, Journal of Computer and System Sciences, vol.28, issue.2, pp.270-299, 1984. ,
DOI : 10.1016/0022-0000(84)90070-9
URL : http://doi.org/10.1016/0022-0000(84)90070-9
Computing discrete logarithms in quadratic orders, Journal of Cryptology, vol.13, issue.4, pp.473-492, 2000. ,
Introduction to Modern Cryptography, Second Edition, 2014. ,
Threshold Cryptosystems Based on Factoring, ASI- ACRYPT 2002, pp.192-205, 2002. ,
DOI : 10.1007/3-540-36178-2_12
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.5455
Secure Games with Polynomial Expressions, Automata, Languages and Programming, 28th International Colloquium, ICALP 2001, Proceedings . LNCS, pp.939-950, 2001. ,
DOI : 10.1007/3-540-48224-5_76
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.7689
Improved Garbled Circuit: Free XOR Gates and Applications, Part II, pp.486-498, 2008. ,
DOI : 10.1007/978-3-540-70583-3_40
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.160.5268
Faster secure arithmetic computation using switchable homomorphic encryption, Cryptology ePrint Archive, p.539, 2014. ,
Secure two-party computation via cut-and-choose oblivious transfer, TCC 2011, pp.329-346, 2011. ,
DOI : 10.1007/s00145-011-9107-0
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.7642
Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries, SCN 08, pp.2-20, 2008. ,
DOI : 10.1007/978-3-540-85855-3_2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.161.3864
Secure Equality and Greater-Than Tests with Sublinear Online Complexity, ICALP 2013, Part II, pp.645-656, 2013. ,
DOI : 10.1007/978-3-642-39212-2_56
Fairplay -secure two-party computation system, Proceedings of the 13th USENIX Security Symposium, pp.287-302, 2004. ,
Secure computation (abstract) In: CRYPTO'91, LNCS, vol.576, pp.392-404, 1992. ,
Worst???Case to Average???Case Reductions Based on Gaussian Measures, SIAM Journal on Computing, vol.37, issue.1, pp.267-302, 2007. ,
DOI : 10.1137/S0097539705447360
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.102.7073
Oblivious Polynomial Evaluation, SIAM Journal on Computing, vol.35, issue.5, pp.1254-1281, 2006. ,
DOI : 10.1137/S0097539704383633
A New Approach to Practical Active-Secure Two-Party Computation, CRYPTO 2012, pp.681-700, 2012. ,
DOI : 10.1007/978-3-642-32009-5_40
URL : http://arxiv.org/abs/1202.3052
Public-Key Cryptosystems Based on Composite Degree Residuosity Classes, EUROCRYPT'99, pp.223-238, 1999. ,
DOI : 10.1007/3-540-48910-X_16
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.4035
A threshold cryptosystem without a trusted party (extended abstract) (rump session), EUROCRYPT'91, pp.522-526 ,
DOI : 10.1007/3-540-46416-6_47
Secure Two-Party Computation Is Practical, ASIACRYPT 2009, pp.250-267, 2009. ,
DOI : 10.1007/978-3-642-10366-7_15
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.2341
Securing Threshold Cryptosystems against Chosen Ciphertext Attack, Journal of Cryptology, vol.15, issue.2, pp.75-96, 2002. ,
DOI : 10.1007/s00145-001-0020-9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.1408
Oblivious evaluation of multivariate polynomials, Journal of Mathematical Cryptology, vol.7, issue.1, pp.1-29, 2013. ,
DOI : 10.1515/jmc-2012-0007
Algorithmic Number Theory and Applications to the Cryptanalysis of Cryptographical Primitives. HabilitationàHabilitation`Habilitationà diriger des recherches, 2012. ,
AUTOCRYPT, Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, CCS '13, pp.1297-1310, 2013. ,
DOI : 10.1145/2508859.2516666
Fast Parallel Computation of Polynomials Using Few Processors, SIAM Journal on Computing, vol.12, issue.4, pp.641-644, 1983. ,
DOI : 10.1137/0212043
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.546.3985
Protocols for secure computations (extended abstract) In: 23rd FOCS, pp.160-164, 1982. ,
Efficient Disjointness Tests for Private Datasets, ACISP 08, pp.155-169, 2008. ,
DOI : 10.1007/978-3-540-70500-0_12