#### Filter Results:

- Full text PDF available (17)

#### Publication Year

2005

2016

- This year (0)
- Last 5 years (9)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Pedro Adão, Gergei Bana, Jonathan Herzog, Andre Scedrov
- ESORICS
- 2005

Both the formal and the computational models of cryptography contain the notion of message equivalence or indistinguishability. An encryption scheme provides soundness for indistinguishability if, when mapping formal messages into the computational model, equivalent formal messages are mapped to indistinguishable computational distributions. Previous… (More)

- Pedro Adão, Gergei Bana, Andre Scedrov
- 18th IEEE Computer Security Foundations Workshop…
- 2005

We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information of the encrypted plaintext is revealed. We consider not only computational, but also purely probabilistic, information-theoretic interpretations. We present a general, systematic… (More)

- Gergei Bana, Hubert Comon-Lundh
- POST
- 2012

We consider the question of the adequacy of symbolic models versus computational models for the verification of security protocols. We neither try to include properties in the symbolic model that reflect the properties of the computational primitives nor add computational requirements that enforce the soundness of the symbolic model. We propose in this… (More)

- Pedro Adão, Gergei Bana, Jonathan Herzog, Andre Scedrov
- Journal of Computer Security
- 2009

In their seminal work, Abadi and Rogaway [2, 3] show that the formal (Dolev-Yao) notion of indistinguishability is sound with respect to the computational model: messages that are indistinguishable in the formal model become indistinguishable messages in the computational model. However, this result leaves two problems unsolved. First, it cannot tolerate… (More)

- Gergei Bana, Hubert Comon-Lundh
- ACM Conference on Computer and Communications…
- 2014

We consider the problem of computational indistinguishability of protocols. We design a symbolic model, amenable to automated deduction, such that a successful inconsistency proof implies computational indistinguishability. Conversely, symbolic models of distinguishability provide clues for likely computational attacks. We follow the idea we introduced… (More)

- Gergei Bana, Payman Mohassel, Till Stegers
- ASIAN
- 2006

In the investigation of the relationship between the formal and the computational view of cryptography, a recent approach, first proposed in [10], uses static equivalence from cryptographic pi calculi as a notion of formal indistinguishability. Previous work [10, 1] has shown that this yields the soundness of natural interpretations of some interesting… (More)

- Gergei Bana
- IACR Cryptology ePrint Archive
- 2005

SOUNDNESS AND COMPLETENESS OF FORMAL LOGICS OF SYMMETRIC ENCRYPTION Gergei Bana Supervisor: Andre Scedrov In the last two decades, two major directions in cryptography have developed: formal and computational. The formal approach uses simple, manageable formal languages to describe cryptographic protocols; this approach is amenable to automatization,… (More)

- Gergei Bana, Pedro Adão, Hideki Sakurada
- FSTTCS
- 2012

We show that the recent technique of computationally complete symbolic attackers proposed by Bana and Comon-Lundh [6] for computationally sound verification of security protocols is powerful enough to verify actual protocols. In their work, Bana and Comon-Lundh presented only the general framework, but they did not introduce sufficiently many axioms to… (More)

- Gergei Bana, Koji Hasebe, Mitsuhiro Okada
- IACR Cryptology ePrint Archive
- 2010

We present a computationally sound first-order system for security-analysis of protocols that places secrecy of nonces and keys in its center. Even trace properties such as agreement and authentication are proven via proving a non-trace property, namely, secrecy first with an inductive method. This results a very powerful system, the working of which we… (More)

- Gergei Bana, Koji Hasebe, Mitsuhiro Okada
- ACM Conference on Computer and Communications…
- 2013

Recently, Bana and Comon-Lundh introduced the notion of computationally complete symbolic attacker to deliver unconditional computational soundness to symbolic protocol verification. First we explain the relationship between their technique and Fitting's embedding of classical logic into S4. Then, based on predicates for "key usability", we provide an… (More)