Gergei Bana - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 24 from 24

2022

Time, Privacy, Robustness, Accuracy: Trade-Offs for the Open Vote Network ProtocolFatima-Ezzahra El Orche, Rémi Géraud-Stewart, Peter B. Rønne, Gergei Bana, David Naccache, Peter Y. A. Ryan, Marco Biroli, Megi Dervishi, Hugo Waltsburger. evoteid 2022: 19-35 [doi]

2021

Time, Privacy, Robustness, Accuracy: Trade Offs for the Open Vote Network ProtocolGergei 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, 2021:1065, 2021. [doi]

2020

A Semantics for "Typically" in First-Order Default ReasoningGergei Bana, Mitsuhiro Okada. jsai 2021: 3-20 [doi]

Verification Methods for the Computationally Complete Symbolic Attacker Based on IndistinguishabilityGergei Bana, Rohit Chadha, Ajay Kumar Eeralla, Mitsuhiro Okada. tocl, 21(1), 2020. [doi]

2018

Formal Analysis of Vote Privacy Using Computationally Complete Symbolic AttackerGergei Bana, Rohit Chadha, Ajay Kumar Eeralla. esorics 2018: 350-372 [doi]

Formal Analysis of Vote Privacy using Computationally Complete Symbolic AttackerGergei Bana, Rohit Chadha, Ajay Kumar Eeralla. iacr, 2018:624, 2018. [doi]

2016

Semantics for "Enough-Certainty" and Fitting's Embedding of Classical Logic in S4Gergei Bana, Mitsuhiro Okada. csl 2016: [doi]

Verification Methods for the Computationally Complete Symbolic Attacker Based on IndistinguishabilityGergei Bana, Rohit Chadha. iacr, 2016:69, 2016. [doi]

2014

A Computationally Complete Symbolic Attacker for Equivalence PropertiesGergei Bana, Hubert Comon-Lundh. ccs 2014: 609-620 [doi]

2013

Computationally complete symbolic attacker and key exchangeGergei Bana, Koji Hasebe, Mitsuhiro Okada. ccs 2013: 1231-1246 [doi]

2012

2010

Secrecy-Oriented First-Order Logical Analysis of Cryptographic ProtocolsGergei Bana, Koji Hasebe, Mitsuhiro Okada. iacr, 2010:80, 2010. [doi]

2009

Soundness and completeness of formal encryption: The cases of key cycles and partial information leakagePedro Adão, Gergei Bana, Jonathan Herzog, Andre Scedrov. jcs, 17(5):737-797, 2009. [doi]

Computational Semantics for First-Order Logical Analysis of Cryptographic ProtocolsGergei Bana, Koji Hasebe, Mitsuhiro Okada. psec 2009: 33-56 [doi]

2007

Computational Semantics for Basic Protocol Logic - A Stochastic ApproachGergei Bana, Koji Hasebe, Mitsuhiro Okada. asian 2007: 86-94 [doi]

Computational Semantics for Basic Protocol Logic - A Stochastic ApproachGergei Bana, Koji Hasebe, Mitsuhiro Okada. iacr, 2007:156, 2007. [doi]

2006

Computational Soundness of Formal Indistinguishability and Static EquivalenceGergei Bana, Payman Mohassel, Till Stegers. asian 2008: 182-196 [doi]

Computational Soundness of Formal Indistinguishability and Static EquivalenceGergei Bana, Payman Mohassel, Till Stegers. iacr, 2006:323, 2006. [doi]

2005

Soundness of Formal Encryption in the Presence of Key-CyclesPedro Adão, Gergei Bana, Jonathan Herzog, Andre Scedrov. esorics 2005: 374-396 [doi]

Computational and Information-Theoretic Soundness and Completeness of Formal EncryptionPedro Adão, Gergei Bana, Andre Scedrov. csfw 2005: 170-184 [doi]

Soundness and Completeness of Formal Logics of Symmetric EncryptionGergei Bana. iacr, 2005:101, 2005. [doi]

Sign in or sign up to see more results.

runs on WebDSL