The following pages link to Yassine Lakhneche (Q673879):
Displaying 48 items.
- (Q287325) (redirect page) (← links)
- Automated proofs of block cipher modes of operation (Q287326) (← links)
- (Q540681) (redirect page) (← links)
- Automated proofs for asymmetric encryption (Q540682) (← links)
- Metric temporal logic with durations (Q673880) (← links)
- On the existence and decidability of unique decompositions of processes in the applied \(\pi\)-calculus (Q896922) (← links)
- Iterating transducers (Q1858440) (← links)
- Verifying untimed and timed aspects of the experimental batch plant (Q2512162) (← links)
- A symbolic decision procedure for cryptographic protocols with time stamps (Q2568115) (← links)
- (Q2709807) (← links)
- (Q2722048) (← links)
- (Q2766662) (← links)
- (Q2768503) (← links)
- CIL Security Proof for a Password-Based Key Exchange (Q2856156) (← links)
- Computational Soundness of Symbolic Analysis for Protocols Using Hash Functions (Q2866733) (← links)
- Automated Verification of Block Cipher Modes of Operation, an Improved Method (Q2889811) (← links)
- A Computational Indistinguishability Logic for the Bounded Storage Model (Q2889822) (← links)
- Vote-Independence: A Powerful Privacy Notion for Voting Protocols (Q2889829) (← links)
- Mind the Gap: Modular Machine-Checked Proofs of One-Round Key Exchange Protocols (Q2948400) (← links)
- Synthesizing different development paradigms: Combining top-down with bottom-up reasoning about distributed systems (Q2956676) (← links)
- (Q3002509) (← links)
- On the Equality of Probabilistic Terms (Q3066090) (← links)
- Beyond Provable Security Verifiable IND-CCA Security of OAEP (Q3073706) (← links)
- Certified Security Proofs of Cryptographic Protocols in the Computational Model: An Application to Intrusion Resilience (Q3100218) (← links)
- Formal Indistinguishability Extended to the Random Oracle Model (Q3182857) (← links)
- A Generalization of DDH with Applications to Protocol Analysis and Computational Soundness (Q3612566) (← links)
- Automated Security Proof for Symmetric Encryption Modes (Q3656840) (← links)
- (Q4341644) (← links)
- (Q4417934) (← links)
- (Q4518895) (← links)
- (Q4551159) (← links)
- (Q4737006) (← links)
- (Q4779118) (← links)
- (Q4782048) (← links)
- (Q4817540) (← links)
- On Unique Decomposition of Processes in the Applied π-Calculus (Q4910411) (← links)
- Networks of Processes with Parameterized State Space (Q4921504) (← links)
- (Q4952305) (← links)
- Automated Proofs for Asymmetric Encryption (Q5187835) (← links)
- Verification: Theory and Practice (Q5305639) (← links)
- Foundations of Software Science and Computation Structures (Q5308441) (← links)
- CONCUR 2004 - Concurrency Theory (Q5311473) (← links)
- Programming Languages and Systems (Q5316563) (← links)
- Formal Verification of e-Auction Protocols (Q5326763) (← links)
- Computationally Sound Typing for Non-interference: The Case of Deterministic Encryption (Q5458849) (← links)
- Static Analysis (Q5466571) (← links)
- Flat Parametric Counter Automata (Q5901227) (← links)
- Flat Parametric Counter Automata (Q5902108) (← links)
