Yassine Lakhnech

According to our database1, Yassine Lakhnech authored at least 82 papers between 1992 and 2016.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2016
On the existence and decidability of unique decompositions of processes in the applied π-calculus.
Theor. Comput. Sci., 2016

Automated Proofs of Block Cipher Modes of Operation.
J. Autom. Reasoning, 2016

2015
Mind the Gap: Modular Machine-Checked Proofs of One-Round Key Exchange Protocols.
Proceedings of the Advances in Cryptology - EUROCRYPT 2015, 2015

2014
Formal Verification of e-Reputation Protocols.
Proceedings of the Foundations and Practice of Security - 7th International Symposium, 2014

2013
Information flow control of component-based distributed systems.
Concurrency and Computation: Practice and Experience, 2013

CIL Security Proof for a Password-Based Key Exchange.
Proceedings of the Provable Security - 7th International Conference, 2013

Formal Verification of e-Auction Protocols.
Proceedings of the Principles of Security and Trust - Second International Conference, 2013

A More Realistic Model for Verifying Route Validity in Ad-Hoc Networks.
Proceedings of the Foundations and Practice of Security - 6th International Symposium, 2013

On Unique Decomposition of Processes in the Applied π-Calculus.
Proceedings of the Foundations of Software Science and Computation Structures, 2013

Automated Security Proofs for Almost-Universal Hash for MAC Verification.
Proceedings of the Computer Security - ESORICS 2013, 2013

Fully automated analysis of padding-based encryption in the computational model.
Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security, 2013

2012
Sécuriser les systèmes distribués à base de composants par contrôle de flux d'information.
Technique et Science Informatiques, 2012

Automated Analysis and Synthesis of Padding-Based Encryption Schemes.
IACR Cryptology ePrint Archive, 2012

A formal taxonomy of privacy in voting protocols.
Proceedings of IEEE International Conference on Communications, 2012

Defining Privacy for Weighted Votes, Single and Multi-voter Coercion.
Proceedings of the Computer Security - ESORICS 2012, 2012

Generic Indifferentiability Proofs of Hash Designs.
Proceedings of the 25th IEEE Computer Security Foundations Symposium, 2012

Automation in Computer-Aided Cryptography: Proofs, Attacks and Designs.
Proceedings of the Certified Programs and Proofs - Second International Conference, 2012

2011
Automated Verification of Block Cipher Modes of Operation, an Improved Method.
Proceedings of the Foundations and Practice of Security, 2011

Vote-Independence: A Powerful Privacy Notion for Voting Protocols.
Proceedings of the Foundations and Practice of Security, 2011

A Computational Indistinguishability Logic for the Bounded Storage Model.
Proceedings of the Foundations and Practice of Security, 2011

Beyond Provable Security Verifiable IND-CCA Security of OAEP.
Proceedings of the Topics in Cryptology - CT-RSA 2011, 2011

Certified Security Proofs of Cryptographic Protocols in the Computational Model: An Application to Intrusion Resilience.
Proceedings of the Certified Programs and Proofs - First International Conference, 2011

Automating information flow control in component-based distributed systems.
Proceedings of the 14th International ACM Sigsoft Symposium on Component Based Software Engineering, 2011

2010
On the Equality of Probabilistic Terms.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Computational indistinguishability logic.
Proceedings of the 17th ACM Conference on Computer and Communications Security, 2010

Automated Proofs for Asymmetric Encryption.
Proceedings of the Concurrency, 2010

2009
Formal Indistinguishability Extended to the Random Oracle Model.
Proceedings of the Computer Security, 2009

Automated Security Proof for Symmetric Encryption Modes.
Proceedings of the Advances in Computer Science, 2009

2008
Towards automated proofs for asymmetric encryption schemes in the random oracle model.
Proceedings of the 2008 ACM Conference on Computer and Communications Security, 2008

2007
Computational Soundness of Symbolic Analysis for Protocols Using Hash Functions.
Electr. Notes Theor. Comput. Sci., 2007

Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness.
Proceedings of the Advances in Cryptology, 2007

2006
Certifying cryptographic protocols by abstract model-checking and proof concretization.
SIGBED Review, 2006

Game-Based Criterion Partition Applied to Computational Soundness of Adaptive Security.
Proceedings of the Formal Aspects in Security and Trust, Fourth International Workshop, 2006

Flat Parametric Counter Automata.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
Guidelines for a graduate curriculum on embedded software and systems.
ACM Trans. Embedded Comput. Syst., 2005

A symbolic decision procedure for cryptographic protocols with time stamps.
J. Log. Algebr. Program., 2005

Probabilistic Opacity for a Passive Adversary and its Application to Chaum's Voting Scheme.
IACR Cryptology ePrint Archive, 2005

Computationally Sound Verification of Security Protocols Using Diffie-Hellman Exponentiation.
IACR Cryptology ePrint Archive, 2005

(De)Compositions of Cryptographic Schemes and their Applications to Protocols.
IACR Cryptology ePrint Archive, 2005

Automatic Verification of Security Properties Based on Abstractions.
Proceedings of the Verification of Infinite-State Systems with Applications to Security, 2005

Completing the Picture: Soundness of Formal Encryption in the Presence of Active Adversaries.
Proceedings of the Programming Languages and Systems, 2005

2004
On Logics of Aliasing.
Proceedings of the Static Analysis, 11th International Symposium, 2004

On the Existence of an Effective and Complete Inference System for Cryptographic Protocols.
Proceedings of the Foundations of Software Science and Computation Structures, 2004

A Symbolic Decision Procedure for Cryptographic Protocols with Time Stamps (Extended Abstract).
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003
Pattern-Based Abstraction for Verifying Secrecy in Protocols.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2003

Storeless semantics and alias logic.
Proceedings of the 2003 ACM SIGPLAN Workshop on Partial Evaluation and Semantics-based Program Manipulation, 2003

HERMES: An Automatic Tool for Verification of Secrecy in Security Protocols.
Proceedings of the Computer Aided Verification, 15th International Conference, 2003

Abstraction as the Key for Invariant Verification.
Proceedings of the Verification: Theory and Practice, 2003

2002
Parameterized Verification of a Cache Coherence Protocol: Safety and Liveness.
Proceedings of the Verification, 2002

2001
Verification of Parameterized Protocols.
J. UCS, 2001

Networks of Processes with Parameterized State Space.
Electr. Notes Theor. Comput. Sci., 2001

Verifying Untimed and Timed Aspects of the Experimental Batch Plant.
Eur. J. Control, 2001

Incremental Verification by Abstraction.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2001

Analyzing Fair Parametric Extended Automata.
Proceedings of the Static Analysis, 8th International Symposium, 2001

Iterating Transducers.
Proceedings of the Computer Aided Verification, 13th International Conference, 2001

Concurrency Verification: Introduction to Compositional and Noncompositional Methods
Cambridge Tracts in Theoretical Computer Science 54, Cambridge University Press, ISBN: 0-521-80608-9, 2001

2000
Abstracting WS1S Systems to Verify Parameterized Networks.
Proceedings of the Tools and Algorithms for Construction and Analysis of Systems, 2000

A Transformational Approach for Generating Non-linear Invariants.
Proceedings of the Static Analysis, 7th International Symposium, 2000

Verifying Universal Properties of Parameterized Networks.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 2000

Basic Principles of a textbook on the compositional and noncompositional verification of concurrent programs.
Proceedings of the Formale Beschreibungstechniken für verteilte Systeme, 2000

1999
Automatic Generation of Invariants.
Formal Methods in System Design, 1999

Divide, Abstract, and Model-Check.
Proceedings of the Theoretical and Practical Aspects of SPIN Model Checking, 1999

Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis.
Proceedings of the Computer Aided Verification, 11th International Conference, 1999

1998
Integrating Timed Condition/Event Systems and Timed Automata for the Verification of Hybrid Systems.
Scalable Computing: Practice and Experience, 1998

Implementing Statecharts in PROMELA/SPIN.
Proceedings of the 2nd Workshop on Industrial-Strength Formal Specification Techniques (WIFT '98), 1998

InVeST: A Tool for the Verification of Invariants.
Proceedings of the Computer Aided Verification, 10th International Conference, 1998

Computing Abstractions of Infinite State Systems Compositionally and Automatically.
Proceedings of the Computer Aided Verification, 10th International Conference, 1998

1997
Deductive verification of stabilizing systems.
Proceedings of the 3rd Workshop on Self-stabilizing Systems, 1997

Comparing Timed C/E Systems with Timed Automata (Abstract).
Proceedings of the Hybrid and Real-Time Systems, 1997

Hierarchical Automata as Model for Statecharts.
Proceedings of the Advances in Computing Science, 1997

1996
Specification and verification of hybrid and real time systems.
PhD thesis, 1996

Model-Checking for Extended Timed Temporal Logics.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1996

Modular Completeness: Integrating the Reuse of Specified Software in Top-down Program Development.
Proceedings of the FME '96: Industrial Benefit and Advances in Formal Methods, 1996

Powerful Techniques for the Automatic Generation of Invariants.
Proceedings of the Computer Aided Verification, 8th International Conference, 1996

1995
Metric Temporal Logic with Durations.
Theor. Comput. Sci., 1995

Logics vs. Automata: The Hybrid Case.
Proceedings of the Hybrid Systems III: Verification and Control, 1995

Synthesizing Different Development Paradigms: Combining Top-Down with Bottom-Up Reasoning About Distributed Systems.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

Temporal Logic + Timed Automata: Expressiveness and Decidability.
Proceedings of the CONCUR '95: Concurrency Theory, 1995

From Duration Calculus To Linear Hybrid Automata.
Proceedings of the Computer Aided Verification, 1995

1994
Reasoning about Durations in Metric Temporal Logic.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, Third International Symposium Organized Jointly with the Working Group Provably Correct Systems, 1994

1992
Provably Correct Compiler Development and Implementation.
Proceedings of the Compiler Construction, 1992


  Loading...