Seguir
Santiago Zanella-Béguelin
Santiago Zanella-Béguelin
Microsoft Research
Dirección de correo verificada de microsoft.com - Página principal
Título
Citado por
Citado por
Año
Imperfect forward secrecy: How Diffie-Hellman fails in practice
D Adrian, K Bhargavan, Z Durumeric, P Gaudry, M Green, JA Halderman, ...
Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications …, 2015
6082015
Formal verification of smart contracts: Short paper
K Bhargavan, A Delignat-Lavaud, C Fournet, A Gollamudi, G Gonthier, ...
Proceedings of the 2016 ACM workshop on programming languages and analysis …, 2016
5802016
Formal certification of code-based cryptographic proofs
G Barthe, B Grégoire, S Zanella-Béguelin
ACM SIGPLAN Notices 44 (1), 90-101, 2009
3842009
Dependent types and multi-monadic effects in F
N Swamy, C Hriţcu, C Keller, A Rastogi, A Delignat-Lavaud, S Forest, ...
Proceedings of the 43rd annual ACM SIGPLAN-SIGACT Symposium on Principles of …, 2016
3372016
Computer-aided security proofs for the working cryptographer
G Barthe, B Grégoire, S Heraud, S Zanella-Béguelin
Advances in Cryptology–CRYPTO 2011, 71-90, 2011
3102011
Probabilistic relational reasoning for differential privacy
G Barthe, B Köpf, F Olmedo, S Zanella-Béguelin
ACM SIGPLAN Notices 47 (1), 97-110, 2012
2432012
Probabilistic relational verification for cryptographic implementations
G Barthe, C Fournet, B Grégoire, PY Strub, N Swamy, S Zanella-Béguelin
ACM SIGPLAN Notices 49 (1), 193-205, 2014
1162014
Verified low-level programming embedded in F.
J Protzenko, JK Zinzindohoué, A Rastogi, T Ramananandro, P Wang, ...
Proc. ACM program. lang. 1 (ICFP), 17:1-17:29, 2017
1062017
Proving the TLS handshake secure (as it is)
K Bhargavan, C Fournet, M Kohlweiss, A Pironti, PY Strub, ...
Annual Cryptology Conference, 235-255, 2014
1022014
Smart meter aggregation via secret-sharing
G Danezis, C Fournet, M Kohlweiss, S Zanella-Béguelin
Proceedings of the first ACM workshop on Smart energy grid security, 75-80, 2013
902013
Verified computational differential privacy with applications to smart metering
G Barthe, G Danezis, B Grégoire, C Kunz, S Zanella-Beguelin
2013 IEEE 26th Computer Security Foundations Symposium, 287-301, 2013
822013
Everest: Towards a verified, drop-in replacement of HTTPS
K Bhargavan, B Bond, A Delignat-Lavaud, C Fournet, C Hawblitzel, ...
2nd Summit on Advances in Programming Languages (SNAPL 2017), 2017
702017
Implementing and proving the TLS 1.3 record layer
A Delignat-Lavaud, C Fournet, M Kohlweiss, J Protzenko, A Rastogi, ...
2017 IEEE Symposium on Security and Privacy (SP), 463-482, 2017
662017
Evercrypt: A fast, verified, cross-platform cryptographic provider
J Protzenko, B Parno, A Fromherz, C Hawblitzel, M Polubelova, ...
2020 IEEE Symposium on Security and Privacy (SP), 983-1002, 2020
622020
Beyond provable security verifiable IND-CCA security of OAEP
G Barthe, B Grégoire, Y Lakhnech, S Zanella-Béguelin
Topics in Cryptology–CT-RSA 2011, 180-196, 2011
602011
Downgrade resilience in key-exchange protocols
K Bhargavan, C Brzuska, C Fournet, M Green, M Kohlweiss, ...
2016 IEEE Symposium on Security and Privacy (SP), 506-525, 2016
522016
Fully automated analysis of padding-based encryption in the computational model
G Barthe, JM Crespo, B Grégoire, C Kunz, Y Lakhnech, B Schmidt, ...
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications …, 2013
492013
Full proof cryptography: verifiable compilation of efficient zero-knowledge protocols
J Bacelar Almeida, M Barbosa, E Bangerter, G Barthe, S Krenn, ...
Proceedings of the 2012 ACM conference on Computer and communications …, 2012
482012
A machine-checked formalization of Sigma-protocols
G Barthe, D Hedin, B Grégoire, S Heraud, S Zanella-Béguelin
Computer Security Foundations Symposium (CSF), 2010 23rd IEEE, 246-260, 2010
452010
Verified security of Merkle-Damgård
M Backes, G Barthe, M Berg, B Grégoire, C Kunz, M Skoruppa, ...
Computer Security Foundations Symposium (CSF), 2012 IEEE 25th, 354-368, 2012
422012
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20