Ş
Ştefan Ciobâcă
Researcher at Alexandru Ioan Cuza University
Publications - 22
Citations - 457
Ştefan Ciobâcă is an academic researcher from Alexandru Ioan Cuza University. The author has contributed to research in topics: Correctness & Operational semantics. The author has an hindex of 10, co-authored 20 publications receiving 417 citations. Previous affiliations of Ştefan Ciobâcă include French Institute for Research in Computer Science and Automation & École normale supérieure de Cachan.
Papers
More filters
Journal ArticleDOI
Automated Verification of Equivalence Properties of Cryptographic Protocols
TL;DR: A novel procedure to verify equivalence properties for a bounded number of sessions of cryptographic protocols that can handle a large set of cryptographic primitives, namely those whose equational theory is generated by an optimally reducing convergent rewrite system.
Book ChapterDOI
Automated verification of equivalence properties of cryptographic protocols
TL;DR: A novel procedure to verify equivalence properties for bounded number of sessions able to verify trace equivalence for determinate cryptographic protocols and can handle a large set of cryptographic primitives, namely those which can be modeled by an optimally reducing convergent rewrite system.
Book ChapterDOI
All-Path Reachability Logic
Andrei Stefanescu,Ştefan Ciobâcă,Radu Mereuta,Brandon Moore,Traian Florin Serbanuta,Grigore Rosu +5 more
TL;DR: The proof system takes as axioms any unconditional operational semantics, and is sound (partially correct) and (relatively) complete, independent of the object language; the soundness has also been mechanized (Coq).
Proceedings ArticleDOI
Protocol Composition for Arbitrary Primitives
Ştefan Ciobâcă,Véronique Cortier +1 more
TL;DR: It is shown (in a Dolev-Yao model) that if two protocols use disjoint cryptographic primitives, their composition is secure if the individual protocols are secure, even if they share data.
Journal ArticleDOI
Computing Knowledge in Security Protocols Under Convergent Equational Theories
TL;DR: A procedure is proposed for solving two classical notions of knowledge, deducibility and indistinguishability, under arbitrary convergent equational theories that yield corresponding decision problems in the analysis of security protocols.