1. Lecture Notes in Computer Science;J Balasch,2015
2. Lecture Notes in Computer Science;J Balasch,2012
3. Barthe, G., Belaïd, S., Dupressoir, F., Fouque, P.A., Grégoire, B., Strub, P.Y., Zucchini, R.: Strong non-interference and type-directed higher-order masking. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) ACM CCS 16, pp. 116-129. ACM Press, October 2016
4. Lecture Notes in Computer Science;S Belaïd,2016
5. Belaïd, S., Benhamouda, F., Passelègue, A., Prouff, E., Thillard, A., Vergnaud, D.: Randomness complexity of private circuits for multiplication. Cryptology ePrint Archive, Report 2016/211 (2016). full version of [4].
http://eprint.iacr.org/2016/211