The following pages link to (Q2754157):
Displaying 22 items.
- Weakening the perfect encryption assumption in Dolev-Yao adversaries (Q557896) (← links)
- Reachability results for timed automata with unbounded data structures (Q707597) (← links)
- Decidability issues for extended ping-pong protocols (Q861694) (← links)
- Linearity and bisimulation (Q997996) (← links)
- Formal models and analysis of secure multicast in wired and wireless networks (Q1040779) (← links)
- Primitives for authentication in process algebras. (Q1603653) (← links)
- Noninterference for concurrent programs and thread systems (Q1603688) (← links)
- The security pi-calculus and non-interference (Q1772311) (← links)
- Analysis of security protocols as open systems (Q1853583) (← links)
- A comparison of three authentication properties. (Q1853750) (← links)
- Checking noninterference in timed CSP (Q1941887) (← links)
- Gaining trust by tracing security protocols (Q2095430) (← links)
- Secure non-interactive reduction and spectral analysis of correlations (Q2170114) (← links)
- System-level non-interference of constant-time cryptography. I: Model (Q2417947) (← links)
- A general language-based framework for specifying and verifying notions of opacity (Q2673762) (← links)
- A formalization of credit and responsibility within the GNDC schema (Q2804933) (← links)
- Techniques for security checking: non-interference vs control flow analysis (Q2841279) (← links)
- Formal models of timing attacks on web privacy (Q2841280) (← links)
- Dynamics Security Policies and Process Opacity for Timed Process Algebras (Q3179174) (← links)
- (Q4782713) (← links)
- Persistent Stochastic Non-Interference (Q5158656) (← links)
- Cryptographic defense against traffic analysis (Q5248538) (← links)
