Pages that link to "Item:Q3968876"

The following pages link to On the security of public key protocols (Q3968876):

Displaying 50 items.

• Privacy and verifiability in voting systems: methods, developments and trends (Q395657) (← links)
• Reducing equational theories for the decision of static equivalence (Q437026) (← links)
• State space reduction in the Maude-NRL protocol analyzer (Q462493) (← links)
• Bounded memory Dolev-Yao adversaries in collaborative systems (Q462499) (← links)
• An inductive approach to strand spaces (Q470008) (← 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)
• Automated type-based analysis of injective agreement in the presence of compromised principals (Q492914) (← links)
• Intruder deducibility constraints with negation. Decidability and application to secured service compositions (Q507348) (← links)
• A Maude environment for CafeOBJ (Q520244) (← links)
• Collaborative planning with confidentiality (Q540688) (← links)
• Dealing with logical omniscience: expressiveness and pragmatics (Q543593) (← links)
• Distributed temporal logic for the analysis of security protocol models (Q549724) (← links)
• An NP decision procedure for protocol insecurity with XOR (Q557799) (← links)
• Simulation relations for alternating Büchi automata (Q557801) (← links)
• A method for symbolic analysis of security protocols (Q557806) (← links)
• A computational interpretation of Dolev-Yao adversaries (Q557888) (← links)
• On the complexity of some extended word problems defined by cancellation rules (Q578921) (← links)
• A game-theoretic framework for specification and verification of cryptographic protocols (Q607405) (← 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)
• Reachability results for timed automata with unbounded data structures (Q707597) (← links)
• Ping-pong protocols as prefix grammars: modelling and verification via program transformation (Q739638) (← links)
• On the design of cryptographic primitives (Q850775) (← links)
• An undecidability result for AGh (Q859845) (← links)
• Complete symbolic reachability analysis using back-and-forth narrowing (Q860885) (← links)
• Deciding knowledge in security protocols under equational theories (Q860894) (← links)
• Formal analysis of Kerberos 5 (Q860899) (← links)
• On the semantics of Alice \& Bob specifications of security protocols (Q860900) (← links)
• A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties (Q860906) (← links)
• A (restricted) quantifier elimination for security protocols (Q860909) (← links)
• Decidability issues for extended ping-pong protocols (Q861694) (← links)
• Attacking group protocols by refuting incorrect inductive conjectures (Q861695) (← links)
• Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks (Q861696) (← links)
• Intruder deduction for the equational theory of abelian groups with distributive encryption (Q876047) (← links)
• Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols (Q880981) (← links)
• Efficient representation of the attacker's knowledge in cryptographic protocols analysis (Q931442) (← links)
• Cryptographic protocol logic: satisfaction for (timed) Dolev-Yao cryptography (Q953531) (← links)
• On a new formal proof model for RFID location privacy (Q990106) (← links)
• Computationally sound implementations of equational theories against passive adversaries (Q1013091) (← links)
• Analyzing security protocols using time-bounded task-PIOAs (Q1020557) (← links)
• Reachability is decidable for weakly extended process rewrite systems (Q1023281) (← links)
• Easy intruder deduction problems with homomorphisms (Q1045939) (← links)
• On the security of name-stamp protocols (Q1071729) (← links)
• On the verifiability of two-party algebraic protocols (Q1083426) (← links)
• On the security of p-party protocols (Q1102922) (← links)
• Three systems for cryptographic protocol analysis (Q1330137) (← links)
• A collusion problem and its solution (Q1383158) (← links)
• Authentication tests and the structure of bundles. (Q1603655) (← links)
• Validating firewalls using flow logics (Q1603656) (← links)
• Finite-state analysis of two contract signing protocols (Q1603658) (← links)