Gergei Bana
Gergei Bana
University of MIssouri
Verifierad e-postadress på math.upenn.edu
Titel
Citeras av
Citeras av
År
Soundness of formal encryption in the presence of key-cycles
P Adao, G Bana, J Herzog, A Scedrov
European Symposium on Research in Computer Security, 374-396, 2005
822005
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
542005
Towards unconditional soundness: Computationally complete symbolic attacker
G Bana, H Comon-Lundh
International Conference on Principles of Security and Trust, 189-208, 2012
452012
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
302009
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
252014
Proof of Kolmogorovian censorship
G Bana, T Durt
Foundations of Physics 27 (10), 1355-1373, 1997
241997
Computational soundness of formal indistinguishability and static equivalence
G Bana, P Mohassel, T Stegers
Annual Asian Computing Science Conference, 182-196, 2006
192006
Soundness and completeness of formal logics of symmetric encryption
G Bana
152004
Computationally complete symbolic attacker in action
G Bana, P Adão, H Sakurada
IARCS Annual Conference on Foundations of Software Technology and …, 2012
132012
Computationally complete symbolic attacker and key exchange
G Bana, K Hasebe, M Okada
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications …, 2013
112013
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), 2, 2019
92019
Computational Semantics for Basic Protocol Logic–A Stochastic Approach
G Bana, K Hasebe, M Okada
Annual Asian Computing Science Conference, 86-94, 2007
72007
Computational semantics for first-order logical analysis of cryptographic protocols
G Bana, K Hasebe, M Okada
Formal to Practical Security, 33-56, 2009
62009
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
52018
On the formal consistency of the principal principle
G Bana
Philosophy of Science 83 (5), 988-1001, 2016
52016
Models of Objective Chance: An Analysis through Examples
G Bana
Making it Formally Explicit, 43-60, 2017
32017
Secrecy-Oriented First-Order Logical Analysis of Cryptographic Protocols.
G Bana, K Hasebe, M Okada
IACR Cryptology ePrint Archive 2010, 80, 2010
22010
Computationally Sound Verification of the NSL Protocol via Computationally Complete Symbolic Attacker—Long Version
G Bana, P Adao, H Sakurada
1
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
2016
Computationally Complete Symbolic Adversary and Key Exchange
G Bana, K Hasebe, M Okada
2014
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20