Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Decidability of a Sound Set of Inference Rules for Computational Indistinguishability

Decidability of a Sound Set of Inference Rules for Computational Indistinguishability 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-CCA2</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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Computational Logic (TOCL) Association for Computing Machinery

Decidability of a Sound Set of Inference Rules for Computational Indistinguishability

Loading next page...
 
/lp/association-for-computing-machinery/decidability-of-a-sound-set-of-inference-rules-for-computational-AuI0Stl0Ar
Publisher
Association for Computing Machinery
Copyright
Copyright © 2021 ACM
ISSN
1529-3785
eISSN
1557-945X
DOI
10.1145/3423169
Publisher site
See Article on Publisher Site

Abstract

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-CCA2</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.

Journal

ACM Transactions on Computational Logic (TOCL)Association for Computing Machinery

Published: Jan 19, 2021

Keywords: Security protocols

References