Sonia Belaïd, Fabrice Benhamouda, Alain Passelègue, Emmanuel Prouff, Adrian Thillard, Damien Vergnaud. Randomness Complexity of Private Circuits for Multiplication. In Marc Fischlin, Jean-Sébastien Coron, editors, Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II. Volume 9666 of Lecture Notes in Computer Science, pages 616-648, Springer, 2016. [doi]
@inproceedings{BelaidBPPTV16-0,
title = {Randomness Complexity of Private Circuits for Multiplication},
author = {Sonia Belaïd and Fabrice Benhamouda and Alain Passelègue and Emmanuel Prouff and Adrian Thillard and Damien Vergnaud},
year = {2016},
doi = {10.1007/978-3-662-49896-5_22},
url = {http://dx.doi.org/10.1007/978-3-662-49896-5_22},
researchr = {https://researchr.org/publication/BelaidBPPTV16-0},
cites = {0},
citedby = {0},
pages = {616-648},
booktitle = {Advances in Cryptology - EUROCRYPT 2016 - 35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Vienna, Austria, May 8-12, 2016, Proceedings, Part II},
editor = {Marc Fischlin and Jean-Sébastien Coron},
volume = {9666},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-662-49895-8},
}