Publications

  1. F-E. El Orche, R. Géraud-Stewart, P. B. Rønne, G. Bana, D. Naccache, P. Y. A. Ryan, M. Biroli, M. Dervishi, H. Waltsburger, Time, Privacy, Robustness, Accuracy: Trade-Offs for the Open Vote Network Protocol, International Joint Conference on Electronic Voting, 19–35, 2022. paper
  2. G. Bana, M. Okada, A Semantics for "Typically" in First-Order Default Reasoning, JSAI International Symposium on Artificial Intelligence, 3–20, 2021. paper
  3. G. Bana, W. Jamroga, D. Naccache, P. Y. A. Ryan, Convergence voting: From pairwise comparisons to consensus, arXiv:2102.01995, 2021. arXiv
  4. G. Bana, R. Chadha, A. K. Eeralla, M. Okada, Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability, ACM Transactions on Computational Logic, Vol. 21, Issue 1, 2:1–2:44, ACM, 2019. paper pdf
  5. G. Bana, R. Chadha, Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability, Cryptology ePrint Archive, Report 2016/069, 2016. e-print
  6. G. Bana, R. Chadha, A. K. Eeralla, Formal Analysis of Vote Privacy using Computationally Complete Symbolic Attacker, Proceedings of the 23rd European Symposium on Research in Computer Security (ESORICS '18), LNCS 11099, pp. 350–372, Springer, 2018. paper e-print
  7. Gergei Bana, Models of Objective Chance: An Analysis through Examples, in G. Hofer-Szabó, L. Wroński (eds.), Making it Formally Explicit, European Studies in Philosophy of Science 6, Springer. pdf
  8. G. Bana, M. Okada, Semantics for "Enough-Certainty" and Fitting's Embedding of Classical Logic in S4, Proceedings of the 25th EACSL Annual Conference on Computer Science Logic (CSL 2016), LIPIcs 62, pp. 34:1–34:18, Dagstuhl, 2016. paper pdf
  9. Gergei Bana, On the Formal Consistency of the Principal Principle, Philosophy of Science, Vol. 83, Issue 5, 988–1001, University of Chicago Press, 2016. paper e-print
  10. G. Bana, H. Comon-Lundh, A Computationally Complete Symbolic Attacker for Equivalence Properties, in Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security (CCS 2014), 609–620, ACM, 2014. paper pdf
  11. バナ・ゲルゲイ，長谷部 浩二，岡田 光弘，計算論的に完全な記号的攻撃者と鍵交換に関する分析手法，2014年暗号と情報セキュリティシンポジウム予稿集 (SCIS2014), CD-ROM (3C5-3), 2014.
    Gergei Bana, Koji Hasebe, Mitsuhiro Okada, Computationally Complete Symbolic Adversary and Key Exchange (in Japanese), in Proceedings of the 31st Symposium on Cryptography and Information Security, CD-ROM (3C5-3), 2014. pdf (long version)
  12. G. Bana, K. Hasebe, M. Okada, Computationally Complete Symbolic Attacker and Key Exchange, in Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security (CCS 2013), 1231–1246, ACM, 2013. paper pdf (long version) update log
  13. バナ・ゲルゲイ，ウベール・コモン-ルンド，櫻田 英樹，計算論的に完全な記号的攻撃者とセキュリティ・プロトコルの計算論的に健全な検証，2013年暗号と情報セキュリティシンポジウム予稿集 (SCIS2013), CD-ROM (4D1-3), 2013.
    Gergei Bana, Hubert Comon-Lundh, Hideki Sakurada, Computationally Complete Symbolic Adversary and Computationally Sound Verification of Security Protocols (in Japanese), in Proceedings of the 30th Symposium on Cryptography and Information Security, CD-ROM (4D1-3), 2013. pdf
  14. G. Bana, P. Adão, H. Sakurada, Computationally Complete Symbolic Attacker in Action, in Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), Volume 18 of LIPIcs, 546–560, Dagstuhl, 2012. paper e-print (long version)
  15. G. Bana, H. Comon-Lundh, Towards Unconditional Soundness: Computationally Complete Symbolic Attacker, Proceedings of POST '12, Principles of Security and Trust at ETAPS, Volume 7215 of Lecture Notes in Computer Science, 189–208, 2012. paper e-print (long version, improved semantics)
  16. 長谷部 浩二，岡田 光弘，ゲルゲイ・バナ，セキュリティプロトコルの論理的検証法，萩谷・塚田編『数理的技法による情報セキュリティ』第9章（シリーズ応用数理第1巻），共立出版，185–202, 2010.
    Koji Hasebe, Gergei Bana, Mitsuhiro Okada, Logical Verification Methods for Security Protocols (in Japanese), in Formal Approach to Information Security (collection of survey papers), Kyoritsu Shuppan, 185–202, 2010.
  17. G. Bana, K. Hasebe, M. Okada, Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols, in Formal to Practical Security: Papers issued from the 2005–2008 French-Japanese collaboration, Volume 5458 of Lecture Notes in Computer Science, 33–56. paper pdf
  18. P. Adão, G. Bana, J. Herzog, A. Scedrov, Soundness and Completeness of Formal Encryption: The Cases of Key Cycles and Partial Information Leakage, Selected papers of CSFW '05, Journal of Computer Security 17(5), 737–797. paper pdf
  19. G. Bana, K. Hasebe, M. Okada, Computational Semantics for Basic Protocol Logic — A Stochastic Approach, Proceedings of ASIAN '07, the 12th Annual Asian Computing Science Conference, Volume 4846 of Lecture Notes in Computer Science, 86–94. paper e-print (revised, extended; identical to publication 8)
  20. G. Bana, P. Mohassel, T. Stegers, Computational Soundness of Formal Indistinguishability and Static Equivalence, Proceedings of ASIAN '06, the 11th Annual Asian Computing Science Conference, Volume 4435 of Lecture Notes in Computer Science, 182–196. paper e-print
  21. G. Bana, A Note on Portfolios with Risk Free Internal Gains, Expositiones Mathematicae, 25(1), Feb 2007, 83–93. paper e-print (long version)
  22. P. Adão, G. Bana, J. Herzog, A. Scedrov, Soundness of Formal Encryptions in the Presence of Key Cycles, Proceedings of the 10th European Symposium on Research in Computer Security (ESORICS), Volume 3679 of Lecture Notes in Computer Science, 374–396. paper pdf
  23. P. Adão, G. Bana, A. Scedrov, Computational and Information-Theoretic Soundness and Completeness of Formal Encryption, Proceedings of the 18th IEEE Computer Security Foundations Workshop (CSFW), 170–184. paper pdf
  24. G. Bana, T. Durt, Proof of Kolmogorovian Censorship, Foundations of Physics, 27 (1997), 1355–1373. paper e-print