Pages that link to "Item:Q1874404"

The following pages link to Protocol insecurity with a finite number of sessions and composed keys is NP-complete. (Q1874404):

Displaying 48 items.

• 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)
• Deducibility constraints and blind signatures (Q462488) (← links)
• Bounded memory Dolev-Yao adversaries in collaborative systems (Q462499) (← links)
• Bounding messages for free in security protocols -- extension to various security properties (Q476179) (← links)
• Intruder deducibility constraints with negation. Decidability and application to secured service compositions (Q507348) (← links)
• Satisfiability of general intruder constraints with and without a set constructor (Q507349) (← links)
• Multi-attacker protocol validation (Q540676) (← links)
• An NP decision procedure for protocol insecurity with XOR (Q557799) (← links)
• A method for symbolic analysis of security protocols (Q557806) (← links)
• An undecidability result for AGh (Q859845) (← links)
• A (restricted) quantifier elimination for security protocols (Q860909) (← links)
• Decidability issues for extended ping-pong protocols (Q861694) (← links)
• Decision procedures for the security of protocols with probabilistic encryption against offline dictionary attacks (Q861696) (← 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)
• Safely composing security protocols (Q1028731) (← links)
• On the symbolic reduction of processes with cryptographic functions. (Q1853612) (← links)
• A decidable class of security protocols for both reachability and equivalence properties (Q2031426) (← links)
• Modular verification of protocol equivalence in the presence of randomness (Q2167715) (← links)
• Bounded memory protocols (Q2339157) (← links)
• Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is NP-complete (Q2453106) (← links)
• Transducer-based analysis of cryptographic protocols (Q2464141) (← links)
• Symbolic protocol analysis for monoidal equational theories (Q2482449) (← links)
• Hierarchical combination of intruder theories (Q2482450) (← links)
• Automatic verification of secrecy properties for linear logic specifications of cryptographic protocols (Q2643568) (← links)
• Explicit Randomness is not Necessary when Modeling Probabilistic Encryption (Q2866728) (← links)
• Computational Soundness of Symbolic Analysis for Protocols Using Hash Functions (Q2866733) (← links)
• Emerging Issues and Trends in Formal Methods in Cryptographic Protocol Analysis: Twelve Years Later (Q2945721) (← links)
• Active Linking Attacks (Q2946424) (← links)
• Deciding knowledge in security protocols under some e-voting theories (Q3095038) (← links)
• Model Checking Security Protocols (Q3176380) (← links)
• Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties (Q3184784) (← links)
• Verifying Cryptographic Protocols with Subterms Constraints (Q3498465) (← links)
• Deciding Knowledge in Security Protocols for Monoidal Equational Theories (Q3498466) (← links)
• Challenges in the Automated Verification of Security Protocols (Q3541719) (← links)
• Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables (Q3631368) (← links)
• Flat and One-Variable Clauses for Single Blind Copying Protocols: The XOR Case (Q3636822) (← links)
• Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions (Q3636823) (← links)
• Computing Knowledge in Security Protocols under Convergent Equational Theories (Q5191113) (← links)
• Formalization in PVS of Balancing Properties Necessary for Proving Security of the Dolev-Yao Cascade Protocol Model (Q5195250) (← links)
• Deciding Security for Protocols with Recursive Tests (Q5200014) (← links)
• Automatic Verification of Security Protocols in the Symbolic Model: The Verifier ProVerif (Q5253587) (← links)
• From Security Protocols to Pushdown Automata (Q5277904) (← links)
• The Complexity of Disjunction in Intuitionistic Logic (Q5283439) (← links)
• Safely Composing Security Protocols (Q5458848) (← links)
• Automating Security Analysis: Symbolic Equivalence of Constraint Systems (Q5747780) (← links)