User profiles for G. Bana
Gergei BanaUniversity of MIssouri Verified email at math.upenn.edu Cited by 469 |
mreps: efficient and flexible detection of tandem repeats in DNA
R Kolpakov, G Bana, G Kucherov - Nucleic acids research, 2003 - academic.oup.com
The presence of repeated sequences is a fundamental feature of genomes. Tandemly repeated
DNA appears in both eukaryotic and prokaryotic genomes, it is associated with various …
DNA appears in both eukaryotic and prokaryotic genomes, it is associated with various …
Chondroitin sulfate in the management of hip and knee osteoarthritis: an overview
G Bana, B Jamard, E Verrouil, B Mazières - Advances in Pharmacology, 2006 - Elsevier
… from one study to another, with a minimum daily dose from 800 mg to 2 g, in 1–3 takes. …
least 1 month 1,2 g/d (A) or 3 × 400 mg/d (B) po 3 months 1: LI ↓ S since D14 (A), D42 (B) Yes 6 …
least 1 month 1,2 g/d (A) or 3 × 400 mg/d (B) po 3 months 1: LI ↓ S since D14 (A), D42 (B) Yes 6 …
A computationally complete symbolic attacker for equivalence properties
G Bana, H Comon-Lundh - Proceedings of the 2014 ACM SIGSAC …, 2014 - dl.acm.org
… If we let g ∈ G be a function symbol that represents the attacker’s action, r ∈ N be a name …
Given a first-order structure M, in which all function symbols of F, G are interpreted, we let [[t]]σ …
Given a first-order structure M, in which all function symbols of F, G are interpreted, we let [[t]]σ …
Towards unconditional soundness: Computationally complete symbolic attacker
G Bana, H Comon-Lundh - … Conference on Principles of Security and Trust, 2012 - Springer
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 …
for the verification of security protocols. We neither try to include properties in the symbolic …
Soundness of formal encryption in the presence of key-cycles
… Zieglar, and G. Dinolt for organizing the meetings and providing a conducive and encouraging
atmosphere. Lastly, we also thank the anonymous referees for their extensive comments …
atmosphere. Lastly, we also thank the anonymous referees for their extensive comments …
Computational and information-theoretic soundness and completeness of formal encryption
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 …
expressions. We expand the logic in order to cover cases when partial information of …
Proof of Kolmogorovian censorship
Many argued (Accardi and Fedullo, Pitowsky) that Kolmogorov's axioms of classical probability
theory are incompatible with quantum probabilities, and that this is the reason for the …
theory are incompatible with quantum probabilities, and that this is the reason for the …
Defaults and returns on high-yield bonds
EI Altman, G Bana - Journal of Portfolio Management, 2004 - search.proquest.com
The year 2002 was remarkably difficult on many fronts for most financial markets. For the
high-yield bond market, it was again a year of record amounts of defaults ($97.9 billion), which …
high-yield bond market, it was again a year of record amounts of defaults ($97.9 billion), which …
Formal analysis of vote privacy using computationally complete symbolic attacker
We analyze the FOO electronic voting protocol in the provable security model using the
technique of Computationally Complete Symbolic Attacker (CCSA). The protocol uses …
technique of Computationally Complete Symbolic Attacker (CCSA). The protocol uses …
Soundness and completeness of formal encryption: The cases of key cycles and partial information leakage
… Later, it was shown by Bana [14] and Adão, Bana and Scedrov [5] that … G : ΩG → strings
are also indistinguishable random variables such that F and F are independent and G and G …
are also indistinguishable random variables such that F and F are independent and G and G …