Pages that link to "Item:Q5178877"

The following pages link to Mobile values, new names, and secure communication (Q5178877):

Displaying 50 items.

• Declarative event based models of concurrency and refinement in psi-calculi (Q272301) (← links)
• Deciding equivalence-based properties using constraint solving (Q391121) (← links)
• Reducing equational theories for the decision of static equivalence (Q437026) (← links)
• Decidability of equivalence of symbolic derivations (Q437031) (← links)
• Computing knowledge in security protocols under convergent equational theories (Q437033) (← links)
• Decidability and combination results for two notions of knowledge in security protocols (Q437043) (← links)
• Computing strong and weak bisimulations for psi-calculi (Q444457) (← links)
• Modeling and verifying ad hoc routing protocols (Q462483) (← links)
• Deducibility constraints and blind signatures (Q462488) (← links)
• Improvement of a chaotic maps-based three-party password-authenticated key exchange protocol without using server's public key and smart card (Q490466) (← links)
• Formal methods for web security (Q511944) (← links)
• A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols (Q511946) (← links)
• Encoding cryptographic primitives in a calculus with polyadic synchronisation (Q540687) (← links)
• Rigid tree automata and applications (Q553317) (← links)
• A method for symbolic analysis of security protocols (Q557806) (← links)
• Models for name-passing processes: Interleaving and causal (Q598191) (← links)
• A game-theoretic framework for specification and verification of cryptographic protocols (Q607405) (← links)
• A pure labeled transition semantics for the applied pi calculus (Q621583) (← links)
• To know or not to know: Epistemic approaches to security protocol verification (Q625717) (← links)
• Intruder deduction problem for locally stable theories with normal forms and inverses (Q683746) (← links)
• Algorithmic problems in the symbolic approach to the verification of automatically synthesized cryptosystems (Q831949) (← links)
• A closer look at constraints as processes (Q844200) (← links)
• Deciding knowledge in security protocols under equational theories (Q860894) (← links)
• A framework for security analysis of mobile wireless networks (Q860908) (← links)
• Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks (Q861696) (← links)
• A behavioural theory for a \(\pi\)-calculus with preorders (Q890617) (← links)
• On the existence and decidability of unique decompositions of processes in the applied \(\pi\)-calculus (Q896922) (← links)
• Parametric synchronizations in mobile nominal calculi (Q935464) (← links)
• Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography (Q953531) (← links)
• A spatial equational logic for the applied \(\pi \)-calculus (Q992517) (← links)
• Computationally sound implementations of equational theories against passive adversaries (Q1013091) (← links)
• On the relationships between notions of simulation-based security (Q1021241) (← links)
• Dynamic management of capabilities in a network aware coordination language (Q1035673) (← links)
• Formally sound implementations of security protocols with JavaSPI (Q1707348) (← links)
• A complete symbolic bisimulation for full applied pi calculus (Q1758155) (← links)
• A hierarchy of equivalences for asynchronous calculi (Q1772314) (← links)
• Private authentication (Q1881255) (← links)
• The \(C_\pi\)-calculus: a model for confidential name passing (Q1996859) (← links)
• A procedure for deciding symbolic equivalence between sets of constraint systems (Q2013557) (← links)
• Safe abstractions of data encodings in formal security protocol models (Q2018750) (← links)
• A decidable class of security protocols for both reachability and equivalence properties (Q2031426) (← links)
• Compositional analysis of protocol equivalence in the applied \(\pi \)-calculus using quasi-open bisimilarity (Q2119978) (← links)
• Moving the bar on computationally sound exclusive-or (Q2148759) (← links)
• Modular verification of protocol equivalence in the presence of randomness (Q2167715) (← links)
• POR for security protocol equivalences. Beyond action-determinism (Q2167736) (← links)
• Efficiently deciding equivalence for standard primitives and phases (Q2167745) (← links)
• Composition of password-based protocols (Q2248082) (← links)
• Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures (Q2268100) (← links)
• Combining proverif and automated theorem provers for security protocol verification (Q2305427) (← links)
• A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols (Q2368990) (← links)