Computational indistinguishability is a key property in cryptography and verification of security protocols. Current tools for proving it rely on cryptographic game transformations. We follow Bana and Comon’s approach [7, 8], axiomatizing what an adversary cannot distinguish. We prove the decidability of a set of first-order axioms that are computationally sound, though incomplete, for protocols with a bounded number of sessions whose security is based on an <small>IND-CCA 2 </small> encryption scheme. Alternatively, our result can be viewed as the decidability of a family of cryptographic game transformations. Our proof relies on term rewriting and automated deduction techniques.

中文翻译：

---

用于计算不可区分性的一组合理推理规则的可判定性

计算不可区分性是密码学和安全协议验证的关键属性。当前证明它的工具依赖于加密游戏转换。我们遵循 Bana 和 Comon 的方法 [7, 8]，公理化对手无法区分的内容。我们证明了一组一阶公理的可判定性，这些公理在计算上是合理的，但不完整，对于具有有限数量会话的协议，其安全性基于 <small>IND-CCA2</small> 加密方案。或者，我们的结果可以被视为一系列密码游戏转换的可判定性。我们的证明依赖于术语重写和自动演绎技术。