A dichotomy for local small-bias generators, TCC 2012, vol.7194, pp.600-617, 2012. ,
A dichotomy for local small-bias generators, Journal of Cryptology, vol.29, issue.3, pp.577-596, 2016. ,
Secure arithmetic computation with constant computational overhead. Cryptology ePrint Archive, 2017. ,
Secure arithmetic computation with constant computational overhead, Crypto'17, pp.223-254, 2017. ,
Exponential lower bounds for the running time of dpll algorithms on satisfiable formulas, 45th FOCS, vol.35, pp.166-175, 2004. ,
On pseudorandom generators with linear stretch in nc 0, Computational Complexity, vol.17, issue.1, pp.38-69, 2008. ,
Algebraic attacks against random local functions and their countermeasures, 48th ACM STOC, pp.1087-1100, 2016. ,
Pseudorandom generators with long stretch and low locality from random local one-way functions, 44th ACM STOC, pp.805-816, 2012. ,
Pseudorandom generators with long stretch and low locality from random local one-way functions, SIAM J. Comput, vol.42, issue.5, pp.2008-2037, 2013. ,
The cryptographic hardness of random local functions-survey, Cryptology ePrint Archive, 2015. ,
Ciphers for MPC and FHE, EUROCRYPT 2015, Part I, vol.9056, pp.430-454, 2015. ,
Homomorphic secret sharing: Optimizations and applications, Bet11. L. Bettale. Cryptanalyse algebrique : outils et applications, pp.2105-2122, 2011. ,
Asymptotic behaviour of the degree of regularity of semi-regular polynomial systems, MEGA05, 2005. Eighth International Symposium on Effective Methods in Algebraic Geometry ,
On the (im)possibility of obfuscating programs, CRYPTO 2001, vol.2139, pp.1-18, 2001. ,
The rank of diluted random graphs, Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms, pp.1389-1402, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00630917
Buc76. B. Buchberger. A theoretical basis for the reduction of polynomials to canonical forms, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, vol.10, pp.19-29, 1976. ,
On the higher order nonlinearities of algebraic immune functions, CRYPTO 2006, vol.4117, pp.584-601, 2006. ,
Stream ciphers: A practical solution for efficient homomorphic-ciphertext compression, FSE 2016, vol.9783, pp.313-333, 2016. ,
On the one-way function candidate proposed by goldreich, ACM Transactions on Computation Theory (TOCT), vol.6, issue.3, p.14, 2014. ,
Algebraic attacks on stream ciphers with linear feedback, Cou03. N. T. Courtois. Fast algebraic attacks on stream ciphers with linear feedback, vol.2656, pp.176-194, 2001. ,
Cryptographically significant Boolean functions: Construction and analysis in terms of algebraic immunity, FSE 2005, vol.3557, pp.98-111, 2005. ,
Cryptanalysis of the FLIP family of stream ciphers, CRYPTO 2016, Part I, vol.9814, pp.457-475, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01404145
Basic theory in construction of Boolean functions with maximum possible annihilator immunity, Journal of Pure and Applied Algebra, vol.139, issue.1, pp.61-88, 1999. ,
A new efficient algorithm for computing grobner bases without reduction to zero (f5), Proceedings of the 2002 International Symposium on Symbolic and Algebraic Computation, ISSAC '02, pp.75-83, 2002. ,
Gol00. O. Goldreich. Candidate one-way functions based on expander graphs, 25th FOCS, pp.464-479, 1984. ,
MPC-friendly symmetric key primitives, ACM CCS 16, pp.430-443, 2016. ,
Cryptography with constant computational overhead, 40th ACM STOC, pp.433-442, 2008. ,
Secure arithmetic computation with no honest majority, Cryptology ePrint Archive, 2008. ,
Urn models and their application: an approach to modern discrete probability theory ,
Random allocations. Scripta series in mathematics, Wiley Series in Probability and Statistics: Applied Probability and Statist ICS Sesction Series, 1977. ,
Resolution des systemes d'equations algebriques, Theoretical Computer Science, vol.15, issue.1, pp.77-110, 1981. ,
Indistinguishability obfuscation from SXDH on 5-linear maps and locality-5 PRGs, CRYPTO 2017, Part I, vol.10401, pp.599-629, 2017. ,
Indistinguishability obfuscation from trilinear maps and block-wise local PRGs, CRYPTO 2017, Part I, vol.10401, pp.630-660, 2017. ,
Limits on the locality of pseudorandom generators and applications to indistinguishability obfuscation, TCC 2017, Part I, pp.119-137, 2017. ,
The Algebraic Theory of Modular Systems. Cambridge tracts in mathematics and mathematical physics, Stechert-Hafner Service Agency, 1964. ,
Towards stream ciphers for efficient FHE with low-noise ciphertexts, EUROCRYPT 2016, Part I, vol.9665, pp.311-343, 2016. ,
On e-biased generators in NC0, 44th FOCS, pp.136-145, 2003. ,
Goldreich's prg: evidence for near-optimal polynomial stretch, Computational Complexity (CCC), 2014 IEEE 29th Conference on, pp.1-12, 2014. ,
The satisfiability threshold for k-xorsat, Combinatorics, Probability and Computing, vol.25, issue.2, pp.236-268, 2016. ,
Correlation-immunity of nonlinear combining functions for cryptographic applications (corresp.), IEEE Transactions on Information theory, vol.30, issue.5, pp.776-780, 1984. ,
How to use indistinguishability obfuscation: deniable encryption, and more, 46th ACM STOC, pp.475-484, 2014. ,
Solving sparse linear equations over finite fields, IEEE transactions on information theory, vol.32, issue.1, pp.54-62, 1986. ,