# Unification modulo a 2-sorted Equational theory for Cipher-Decipher Block Chaining

@article{Anantharaman2014UnificationMA,
title={Unification modulo a 2-sorted Equational theory for Cipher-Decipher Block Chaining},
author={Siva Anantharaman and Christopher Bouchard and Paliath Narendran and Micha{\"e}l Rusinowitch},
journal={Log. Methods Comput. Sci.},
year={2014},
volume={10}
}
• Published 2 January 2014
• Computer Science, Mathematics
• Log. Methods Comput. Sci.
We investigate unification problems related to the Cipher Block Chaining (CBC) mode of encryption. We first model chaining in terms of a simple, convergent, rewrite system over a signature with two disjoint sorts: {\em list\/} and {\em element.\/} By interpreting a particular symbol of this signature suitably, the rewrite system can model several practical situations of interest. An inference procedure is presented for deciding the unification problem modulo this rewrite system. The procedure…
2 Citations
Distinguishability in Protocol Analysis: Formally Analyzing Guessing Attacks
• Computer Science, Mathematics
• 2017
This paper is providing saturation based procedures for deciding static equivalence over classes of intruder theories and the form of distinguishability that is focused on is static inclusion and its sub-casestatic equivalence.
The application of block chain technology in spot exchange
• Computer Science
J. Intell. Fuzzy Syst.
• 2018

## References

SHOWING 1-10 OF 35 REFERENCES
Unification Modulo Chaining
• Computer Science
LATA
• 2012
This work model chaining in terms of a simple, convergent, rewrite system over a signature with two disjoint sorts: list and element so that this rewrite system can model several practical situations of interest.
Unification Modulo Homomorphic Encryption
• Computer Science, Mathematics
Journal of Automated Reasoning
• 2010
It is shown that unification is decidable for an equational theory HE specifying such an encryption, and HE-unification is shown to be NP-hard and in EXPTIME.
Efficient General Unification for XOR with Homomorphism
• Computer Science, Mathematics
• 2011
This work gives a mostly deterministic set of inference rules for solving general E-unification modulo XOR with (or without) a homomorphism, and proves that it is sound, complete and terminating.
Intruder deductions, constraint solving and insecurity decision in presence of exclusive or
• Mathematics, Computer Science
18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings.
• 2003
It is shown that the ground reachability problem in NP for the extended intruder theories in the cases of xor and Abelian groups is decidable, and how to lift this result in the xor case is shown.
Intruders with Caps
• Computer Science, Mathematics
RTA
• 2007
Enough conditions are given on the rewrite system modeling the intruder's abilities, such as using encryption and decryption functions, to ensure that it is decidable if such caps exist, which is shown to be in P, NP-complete, decidable, and undecidable.
XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions
• Computer Science, Mathematics
CRYPTO
• 1995
We describe a new approach for authenticating a message using a finite pseudorandom function (PRF). Our "XOR MACs" have several nice features, including parallelisability, incrementality, and
Tag Size Does Matter: Attacks and Proofs for the TLS Record Protocol
• Computer Science, Mathematics
ASIACRYPT
• 2011
It is shown that when tags are longer, the TLS Record Protocol meets a new length-hiding authenticated encryption security notion that is stronger than IND-CCA.
Deciding security of protocols against off-line guessing attacks
• M. Baudet
• Computer Science, Mathematics
CCS '05
• 2005
To the best of the knowledge, this is the first decidability result to use the generic definition of off-line guessing attacks due to Corin et al. based on static equivalence in the applied pi calculus.
On the Relationship of Congruence Closure and Unification
• Mathematics
J. Symb. Comput.
• 1989
If the number of repeated variables in the input terms is fixed, then term unification can be performed in NQ this ex~ends the known parallelizable cases of term unification and the relationship of unification closure and the testing of deterministic finite automata for equivalence is clarified.