External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Randomness Complexity of Private Circuits for Multiplication

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]

Authors

Sonia Belaïd

This author has not been identified. Look up 'Sonia Belaïd' in Google

Fabrice Benhamouda

This author has not been identified. Look up 'Fabrice Benhamouda' in Google

Alain Passelègue

This author has not been identified. Look up 'Alain Passelègue' in Google

Emmanuel Prouff

This author has not been identified. Look up 'Emmanuel Prouff' in Google

Adrian Thillard

This author has not been identified. Look up 'Adrian Thillard' in Google

Damien Vergnaud

This author has not been identified. Look up 'Damien Vergnaud' in Google
runs on