[go: up one dir, main page]

Follow
Santiago Zanella-Béguelin
Santiago Zanella-Béguelin
Microsoft Research
Verified email at microsoft.com - Homepage
Title
Cited by
Cited by
Year
Short paper: Formal verification of smart contracts
K Bhargavan, A Delignat-Lavaud, C Fournet, A Gollamudi, G Gonthier, ...
Proceedings of the 11th ACM Workshop on Programming Languages and Analysis …, 2016
908*2016
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
8052015
Dependent types and multi-monadic effects in F*
N Swamy, C Hriţcu, C Keller, A Rastogi, A Delignat-Lavaud, S Forest, ...
43rd annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming …, 2016
5842016
Formal certification of code-based cryptographic proofs
G Barthe, B Grégoire, S Zanella-Béguelin
ACM SIGPLAN Notices 44 (1), 90-101, 2009
4762009
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
4252011
Analyzing leakage of personally identifiable information in language models
N Lukas, A Salem, R Sim, S Tople, L Wutschitz, S Zanella-Béguelin
2023 IEEE Symposium on Security and Privacy (SP), 346-363, 2023
3842023
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
3202012
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
2102017
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
174*2017
Analyzing information leakage of updates to natural language models
S Zanella-Béguelin, L Wutschitz, S Tople, V Rühle, A Paverd, ...
Proceedings of the 2020 ACM SIGSAC conference on computer and communications …, 2020
1712020
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
1592020
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
1432014
Proving the TLS handshake secure (as it is)
K Bhargavan, C Fournet, M Kohlweiss, A Pironti, PY Strub, ...
Annual Cryptology Conference, 235-255, 2014
1372014
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
1262013
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, 2017
1092017
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
1032013
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
832016
SoK: Let the Privacy Games Begin! A Unified Treatment of Data Inference Privacy in Machine Learning
A Salem, G Cherubin, D Evans, B Köpf, A Paverd, A Suri, S Tople, ...
arXiv preprint arXiv:2212.10986, 2022
762022
Bayesian estimation of differential privacy
S Zanella-Béguelin, L Wutschitz, S Tople, A Salem, V Rühle, A Paverd, ...
arXiv preprint arXiv:2206.05199, 2022
722022
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
642013
The system can't perform the operation now. Try again later.
Articles 1–20