Intruder deduction for the equational theory of abelian groups with distributive encryption

DOI10.1016/J.IC.2006.10.008MaRDI QIDQ876047zbMATH OpenOpenAlexWikidataFDO

Authors Pascal Lafourcade, D. Lugiez, Ralf Treinen

Publication date 16 April 2007

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ic.2006.10.008

zbMATH Keywords

cryptographic protocols

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Foundations of differential cryptanalysis in Abelian groups
• Algebraic Intruder Deductions
• A DEXPTIME-complete Dolev-Yao theory with distributive encryption
• scientific article; zbMATH DE number 1222568
• Term Rewriting and Applications
• scientific article; zbMATH DE number 3974951
• Practical witness encryption for algebraic languages or how to encrypt under Groth-Sahai proofs
• scientific article; zbMATH DE number 5380257
• Equivalence elementaire et decidabilite pour des structures du type groupe agissant sur un groupe abelien
• Decompositions of decidable abelian groups

Cites work

• scientific article; zbMATH DE number 1142316 (Why is no real title available?)
• scientific article; zbMATH DE number 1962758 (Why is no real title available?)
• scientific article; zbMATH DE number 1759457 (Why is no real title available?)
• scientific article; zbMATH DE number 3275554 (Why is no real title available?)
• A calculus for cryptographic protocols: The spi calculus
• An attack on the Needham-Schroeder public-key authentication protocol
• An undecidability result for AGh
• Automata, Languages and Programming
• Automata, Languages and Programming
• Automatic recognition of tractability in inference relations
• Easy intruder deduction problems with homomorphisms
• Easy intruder deductions
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Foundations of Software Science and Computation Structures
• On the regular structure of prefix rewriting
• On the security of public key protocols
• Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or
• Term Rewriting and Applications
• The CL-Atse Protocol Analyser

Cited in

(8)

• A Proof Theoretic Analysis of Intruder Theories
• Computing Knowledge in Security Protocols under Convergent Equational Theories
• Computing knowledge in security protocols under convergent equational theories
• Decidability and combination results for two notions of knowledge in security protocols
• Unification modulo homomorphic encryption
• An undecidability result for AGh
• Unification modulo homomorphic encryption
• Easy intruder deduction problems with homomorphisms

Describes a project that uses

Uses Software

• OFMC
• AVISPA

This page was built for publication: Intruder deduction for the equational theory of abelian groups with distributive encryption

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