Intruder deduction for the equational theory of abelian groups with distributive encryption
DOI10.1016/J.IC.2006.10.008zbMATH Open1112.68048OpenAlexW1992375708WikidataQ122918742 ScholiaQ122918742MaRDI QIDQ876047FDOQ876047
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
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
- Equivalence elementaire et decidabilite pour des structures du type groupe agissant sur un groupe abelien
- Decompositions of decidable abelian groups
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Specification and verification (program logics, model checking, etc.) (68Q60)
Cites Work
- Title not available (Why is that?)
- A calculus for cryptographic protocols: The spi calculus
- Automatic recognition of tractability in inference relations
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the security of public key protocols
- Easy intruder deduction problems with homomorphisms
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Verification: Theory and Practice
- Automata, Languages and Programming
- Term Rewriting and Applications
- Automata, Languages and Programming
- An attack on the Needham-Schroeder public-key authentication protocol
- The CL-Atse Protocol Analyser
- Title not available (Why is that?)
- Foundations of Software Science and Computation Structures
- On the regular structure of prefix rewriting
- Symbolic Protocol Analysis in Presence of a Homomorphism Operator and Exclusive Or
- An undecidability result for AGh
Cited In (8)
- A Proof Theoretic Analysis of Intruder Theories
- Computing Knowledge in Security Protocols under Convergent Equational Theories
- Unification modulo homomorphic encryption
- 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
- Easy intruder deduction problems with homomorphisms
Uses Software
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)
