DeepAI
Log In Sign Up

Deciding Indistinguishability

11/16/2018
by   Adrien Koutsos, et al.
0

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, axiomatizing what an adversary cannot distinguish. We prove the decidability of a set of first-order axioms that are both computationally sound and expressive enough. This can be viewed as the decidability of a family of cryptographic game transformations. Our proof relies on term rewriting and automated deduction techniques.

READ FULL TEXT

page 1

page 2

page 3

page 4

07/03/2019

Cryptographic One-way Function Based on Boson Sampling

The quest for practical cryptographic primitives that are robust against...
07/06/2021

A Framework for Proof-carrying Logical Transformations

In various provers and deductive verification tools, logical transformat...
11/06/2022

DeepSec: Deciding Equivalence Properties for Security Protocols – Improved theory and practice

Automated verification has become an essential part in the security eval...
11/07/2018

Efficient semiquantum key distribution

Quantum cryptography has attracted much attention in recent years. In mo...
09/15/2021

Beating Classical Impossibility of Position Verification

Chandran et al. (SIAM J. Comput.'14) formally introduced the cryptograph...
05/19/2020

Free2Shard: Adaptive-adversary-resistant sharding via Dynamic Self Allocation

Propelled by the growth of large-scale blockchain deployments, much rece...
07/03/2018

Automated Proofs of Unique Normal Forms w.r.t. Conversion for Term Rewriting Systems

The notion of normal forms is ubiquitous in various equivalent transform...