Publications



18. Gergei Bana: Models of Objective Chance: An Analysis through Examples, to appear in G. Hofer-Szabó, L. Wroński (eds.), Making it Formally Explicit European Studies in Philosophy of Science 6, Springer   pdf


17. 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, pp34:1--34:18, Dagstuhl, 2016.     pdf


16. Gergei Bana: On the Formal Consistency of the Principal Principle, Philosophy of Science, Vol 83 Issue 5, 988-1001, University of Chicago Press, 2016.   e-print


15. 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    

 pdf


14. バナ・ゲルゲイ,長谷部 浩二,岡田 光弘.計算論的に完全な記号的攻撃者と鍵交換に関する分析手法. 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)


13. 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     pdf of continually updated long version + update log


12. バナ・ゲルゲイ,ウベール・コモン-ルンド,櫻田 英樹. 計算論的に完全な記号的攻撃者とセキュリティ・プロトコルの 計算論的に健全な検証. 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


11. G. Bana, P. Adão, H. Sakurada: Computationally Complete Symbolic Attacker in Action , in Proceedings of IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012), Volume 18 of Leibniz International Proceedings in Informatics (LIPIcs), 546-560. Dagstuhl, 2012.     e-print long version


10. G. Bana, H. Comon-Lundh: Towards Unconditional Soundness: Computationally Complete Symbolic Attacker, Proceedings of POST'12, Principals of Security and Trust at ETAPS, Volume 7215 of Lecture Notes in Computer Science, 189-208, 2012   e-print long version with improved semantics


9. 長谷部浩二,岡田光弘,ゲルゲイ・バナ. セキュリティプロトコルの論理的検証法. 萩谷,塚田編『数理的技法による情報セキュリティ』第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), Publisher: Kyoritsu Shuppan, 185-202, 2010

 

8. G. Bana, K. Hasebe, M. Okada: Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols, Formal to Practical Security: Papers issued from the 2005-2008 French-Japanese collaboration,  Volume 5458 of Lecture Notes in Computer Science, 33-56   pdf


7. 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 in Journal of Computer Security 17(5) 737-797   pdf

 

6. 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, Vol. 4846 of Lecture Notes  in Computer Science, 86-94     e-print (revised, extended version, contents identical with Publication 8)

 

5. 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, Vol. 4435 of Lecture Notes  in Computer Science, 182-196     e-print

 

4. G. Bana, A Note on Portfolios with Risk Free Internal Gains, Expositiones Mathematicae, 25, 1,1 Feb 2007, 83-93     e-print long version    

 

3. 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), Vol. 3679 of Lecture Notes in Computer Science, 374-396     pdf    

 

2. 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     pdf  

 

1. G. Bana, T. Durt, Proof of Kolmogorovian Censorship, Foundations of Physics, 27 (1997), 1355-1373     e-print