Non-interactive Provably Secure Attestations for Arbitrary RSA Prime Generation Algorithms - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Fabrice Benhamouda, Houda Ferradi, Rémi Géraud, David Naccache. Non-interactive Provably Secure Attestations for Arbitrary RSA Prime Generation Algorithms. In Simon N. Foley, Dieter Gollmann, Einar Snekkenes, editors, Computer Security - ESORICS 2017 - 22nd European Symposium on Research in Computer Security, Oslo, Norway, September 11-15, 2017, Proceedings, Part I. Volume 10492 of Lecture Notes in Computer Science, pages 206-223, Springer, 2017. [doi]

This author has not been identified. Look up 'Fabrice Benhamouda' in GoogleThis author has not been identified. Look up 'Houda Ferradi' in GoogleThis author has not been identified. Look up 'Rémi Géraud' in GoogleThis author has not been identified. Look up 'David Naccache' in Google

runs on WebDSL