Soundness of formal encryption in the presence of key-cycles P Adao, G Bana, J Herzog, A Scedrov Computer Security–ESORICS 2005: 10th European Symposium on Research in …, 2005 | 89 | 2005 |
Towards unconditional soundness: Computationally complete symbolic attacker G Bana, H Comon-Lundh International Conference on Principles of Security and Trust, 189-208, 2012 | 65 | 2012 |
A computationally complete symbolic attacker for equivalence properties G Bana, H Comon-Lundh Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications …, 2014 | 62 | 2014 |
Computational and information-theoretic soundness and completeness of formal encryption P Adao, G Bana, A Scedrov 18th IEEE Computer Security Foundations Workshop (CSFW'05), 170-184, 2005 | 59 | 2005 |
Proof of Kolmogorovian censorship G Bana, T Durt Foundations of Physics 27 (10), 1355-1373, 1997 | 31 | 1997 |
Soundness and completeness of formal encryption: The cases of key cycles and partial information leakage P Adao, G Bana, J Herzog, A Scedrov Journal of Computer Security 17 (5), 737-797, 2009 | 30 | 2009 |
Formal analysis of vote privacy using computationally complete symbolic attacker G Bana, R Chadha, AK Eeralla European Symposium on Research in Computer Security, 350-372, 2018 | 19 | 2018 |
Computational soundness of formal indistinguishability and static equivalence G Bana, P Mohassel, T Stegers Advances in Computer Science-ASIAN 2006. Secure Software and Related Issues …, 2007 | 19 | 2007 |
Verification methods for the computationally complete symbolic attacker based on indistinguishability G Bana, R Chadha, AK Eeralla, M Okada ACM Transactions on Computational Logic (TOCL) 21 (1), 1-44, 2019 | 18 | 2019 |
Computationally complete symbolic attacker and key exchange G Bana, K Hasebe, M Okada Proceedings of the 2013 ACM SIGSAC conference on Computer & communications …, 2013 | 16 | 2013 |
Computationally complete symbolic attacker in action G Bana, P Adão, H Sakurada Cryptology ePrint Archive, 2012 | 16 | 2012 |
Soundness and completeness of formal logics of symmetric encryption G Bana University of Pennsylvania, 2004 | 15 | 2004 |
Computational Semantics for Basic Protocol Logic–A Stochastic Approach G Bana, K Hasebe, M Okada Advances in Computer Science–ASIAN 2007. Computer and Network Security: 12th …, 2007 | 7 | 2007 |
Computational semantics for first-order logical analysis of cryptographic protocols G Bana, K Hasebe, M Okada Formal to Practical Security: Papers Issued from the 2005-2008 French …, 2009 | 6 | 2009 |
Time, privacy, robustness, accuracy: trade offs for the open vote network protocol G Bana, M Biroli, M Dervishi, FE El Orche, R Géraud-Stewart, D Naccache, ... Cryptology ePrint Archive, 2021 | 5 | 2021 |
On the formal consistency of the principal principle G Bana Philosophy of Science 83 (5), 988-1001, 2016 | 5 | 2016 |
Convergence voting: From pairwise comparisons to consensus G Bana, W Jamroga, D Naccache, PYA Ryan arXiv preprint arXiv:2102.01995, 2021 | 4 | 2021 |
Models of objective chance: an analysis through examples G Bana Making it Formally Explicit: Probability, Causality and Indeterminism, 43-60, 2017 | 3 | 2017 |
Semantics for" enough-certainty" and fitting's embedding of classical logic in S4 G Bana, M Okada 25th EACSL Annual Conference on Computer Science Logic (CSL 2016), 2016 | 2 | 2016 |
Secrecy-oriented first-order logical analysis of cryptographic protocols G Bana, K Hasebe, M Okada Cryptology ePrint Archive, 2010 | 2 | 2010 |