Cryptographic logical relations

DOI10.1016/J.TCS.2007.09.033MaRDI QIDQ2481976zbMATH OpenOpenAlexFDO

Authors Yu Zhang

Publication date 15 April 2008

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2007.09.033

zbMATH Keywords

dynamic key generationlogical relationmonadverification of cryptographic protocols

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Categorical logic, topoi (03G30) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Computer Science Logic
• Proof techniques for cryptographic processes
• Computer Science Logic
• scientific article; zbMATH DE number 1948186
• Logical relations for monadic types

Cites work

• A calculus for cryptographic protocols: The spi calculus
• An attack on the Needham-Schroeder public-key authentication protocol
• Computer Science Logic
• Computer Science Logic
• scientific article; zbMATH DE number 1670816 (Why is no real title available?)
• scientific article; zbMATH DE number 3959364 (Why is no real title available?)
• scientific article; zbMATH DE number 3735770 (Why is no real title available?)
• scientific article; zbMATH DE number 45228 (Why is no real title available?)
• scientific article; zbMATH DE number 1251177 (Why is no real title available?)
• scientific article; zbMATH DE number 512784 (Why is no real title available?)
• scientific article; zbMATH DE number 515743 (Why is no real title available?)
• scientific article; zbMATH DE number 1948186 (Why is no real title available?)
• scientific article; zbMATH DE number 195102 (Why is no real title available?)
• Kripke logical relations and PCF
• Kripke-style models for typed lambda calculus
• Notions of computation and monads
• On a monadic semantics for freshness
• Parametricity and local variables
• Security protocols and their properties
• Types, abstraction, and parametric polymorphism, part 2
• Using encryption for authentication in large networks of computers

Cited in

(2)

• Computer Science Logic
• Chasing diagrams in cryptography

This page was built for publication: Cryptographic logical relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2481976)