Programming Languages and Systems

DOI10.1007/b96702zbMath1126.94341OpenAlexW2964738244MaRDI QIDQ5308709

Vitaly Shmatikov

Publication date: 28 September 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b96702

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Related Items

Scenario-Based Verification of Uncertain MDPs ⋮ Farkas Certificates and Minimal Witnesses for Probabilistic Reachability Constraints ⋮ Model Checking Security Protocols ⋮ Modular verification of protocol equivalence in the presence of randomness ⋮ To know or not to know: Epistemic approaches to security protocol verification ⋮ Deducibility constraints and blind signatures ⋮ Transducer-based analysis of cryptographic protocols ⋮ Intruder deduction problem for locally stable theories with normal forms and inverses ⋮ Hierarchical combination of intruder theories ⋮ A method for symbolic analysis of security protocols ⋮ Symbolic protocol analysis in the union of disjoint intruder theories: combining decision procedures ⋮ Current-state opacity enforcement in discrete event systems under incomparable observations ⋮ Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables ⋮ Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions ⋮ Limits of the Cryptographic Realization of Dolev-Yao-Style XOR