Gergei Bana

According to our database, Gergei Bana authored at least 20 papers between 2005 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Time, Privacy, Robustness, Accuracy: Trade Offs for the Open Vote Network Protocol.

Gergei Bana, Marco Biroli, Megi Dervishi, Fatima-Ezzahra El Orche, Rémi Géraud-Stewart, David Naccache, Peter B. Rønne, Peter Y. A. Ryan, Hugo Waltsburger

IACR Cryptol. ePrint Arch., 2021

Convergence Voting: From Pairwise Comparisons to Consensus.

Gergei Bana, Wojciech Jamroga, David Naccache, Peter Y. A. Ryan

CoRR, 2021

2020

Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability.

Gergei Bana, Rohit Chadha, Ajay Kumar Eeralla, Mitsuhiro Okada

ACM Trans. Comput. Log., 2020

A Semantics for "Typically" in First-Order Default Reasoning.

Gergei Bana, Mitsuhiro Okada

Proceedings of the New Frontiers in Artificial Intelligence, 2020

2018

Formal Analysis of Vote Privacy using Computationally Complete Symbolic Attacker.

Gergei Bana, Rohit Chadha, Ajay Kumar Eeralla

IACR Cryptol. ePrint Arch., 2018

2016

Verification Methods for the Computationally Complete Symbolic Attacker Based on Indistinguishability.

Gergei Bana, Rohit Chadha

IACR Cryptol. ePrint Arch., 2016

Semantics for "Enough-Certainty" and Fitting's Embedding of Classical Logic in S4.

Gergei Bana, Mitsuhiro Okada

Proceedings of the 25th EACSL Annual Conference on Computer Science Logic, 2016

2014

A Computationally Complete Symbolic Attacker for Equivalence Properties.

Gergei Bana, Hubert Comon-Lundh

Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

2013

Computationally complete symbolic attacker and key exchange.

Gergei Bana, Koji Hasebe, Mitsuhiro Okada

Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013

2012

Towards Unconditional Soundness: Computationally Complete Symbolic Attacker.

Gergei Bana, Hubert Comon-Lundh

IACR Cryptol. ePrint Arch., 2012

Computationally Sound Verification of the NSL Protocol via Computationally Complete Symbolic Attacker.

Gergei Bana, Pedro Adão, Hideki Sakurada

IACR Cryptol. ePrint Arch., 2012

Computationally Complete Symbolic Attacker in Action.

Gergei Bana, Pedro Adão, Hideki Sakurada

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2012

2010

Secrecy-Oriented First-Order Logical Analysis of Cryptographic Protocols.

Gergei Bana, Koji Hasebe, Mitsuhiro Okada

IACR Cryptol. ePrint Arch., 2010

2009

Soundness and completeness of formal encryption: The cases of key cycles and partial information leakage.

Pedro Adão, Gergei Bana, Jonathan Herzog, Andre Scedrov

J. Comput. Secur., 2009

Computational Semantics for First-Order Logical Analysis of Cryptographic Protocols.

Gergei Bana, Koji Hasebe, Mitsuhiro Okada

Proceedings of the Formal to Practical Security, 2009

2007

Computational Semantics for Basic Protocol Logic - A Stochastic Approach.

Gergei Bana, Koji Hasebe, Mitsuhiro Okada

IACR Cryptol. ePrint Arch., 2007

2006

Computational Soundness of Formal Indistinguishability and Static Equivalence.

Gergei Bana, Payman Mohassel, Till Stegers

IACR Cryptol. ePrint Arch., 2006

2005

Soundness and Completeness of Formal Logics of Symmetric Encryption.

Gergei Bana

IACR Cryptol. ePrint Arch., 2005

Soundness of Formal Encryption in the Presence of Key-Cycles.

Pedro Adão, Gergei Bana, Jonathan Herzog, Andre Scedrov

Proceedings of the Computer Security, 2005

Computational and Information-Theoretic Soundness and Completeness of Formal Encryption.

Pedro Adão, Gergei Bana, Andre Scedrov

Proceedings of the 18th IEEE Computer Security Foundations Workshop, 2005