Unification modulo a 2-sorted Equational theory for Cipher-Decipher Block Chaining
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: list and element. By interpreting a particular symbol of this signature suitably, the...
Main Authors: | Siva Anantharaman, Christopher Bouchard, Paliath Narendran, Michaël Rusinowitch |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2014-02-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/808/pdf |
Similar Items
-
On Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry
by: Andrew M Marshall, et al.
Published: (2015-06-01) -
Exact Unification and Admissibility
by: George Metcalfe, et al.
Published: (2015-09-01) -
Efficient Full Higher-Order Unification
by: Petar Vukmirović, et al.
Published: (2021-12-01) -
Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays
by: Makai Mann, et al.
Published: (2022-08-01) -
A Coinductive Reformulation of Milner's Proof System for Regular Expressions Modulo Bisimilarity
by: Clemens Grabmayer
Published: (2023-06-01)