Towards Quantum-Secure Authentication and Key Agreement via Abstract Multi-Agent Interaction

@inproceedings{Ahmed2021TowardsQA,
  title={Towards Quantum-Secure Authentication and Key Agreement via Abstract Multi-Agent Interaction},
  author={Ibrahim H. Ahmed and Josiah P. Hanna and Elliot Fosong and Stefano V. Albrecht},
  booktitle={PAAMS},
  year={2021}
}
Current methods for authentication and key agreement based on public-key cryptography are vulnerable to quantum computing. We propose a novel approach based on artificial intelligence research in which communicating parties are viewed as autonomous agents which interact repeatedly using their private decision models. Authentication and key agreement are decided based on the agents’ observed behaviors during the interaction. The security of this approach rests upon the difficulty of modeling the… 
View PDF on arXiv
View With Semantic Reader

References

SHOWING 1-10 OF 30 REFERENCES
Are You Doing What I Think You Are Doing? Criticising Uncertain Agent Models
TLDR
A novel algorithm is presented which decides this question in the form of a frequentist hypothesis test, which allows for multiple metrics in the construction of the test statistic and learns its distribution during the interaction process, with asymptotic correctness guarantees.
A Practical Adaptive Key Recovery Attack on the LGM (GSW-like) Cryptosystem
We present an adaptive key recovery attack on the leveled homomorphic encryption scheme suggested by Li, Galbraith and Ma (Provsec 2016), which itself is a modification of the GSW cryptosystem…
Dealing with Non-Stationarity in Multi-Agent Deep Reinforcement Learning
TLDR
This paper surveys recent works that address the non-stationarity problem in multi-agent deep reinforcement learning, and methods range from modifications in the training procedure, to learning representations of the opponent's policy, meta-learning, communication, and decentralized learning.
Symmetric-key Authenticated Key Exchange (SAKE) with Perfect Forward Secrecy
TLDR
This paper proposes an authenticated key exchange protocol in the symmetric-key setting that guarantees perfect forward secrecy, and proves that the protocol is sound, and provides a formal proof of its security.
Maximum Likelihood Estimation
TLDR
The maximum likelihood estimator (MLE) is an alternative to the minimum variance unbiased estimators (MVUE), and is one of the most common estimation procedures used in practice.
Maximum likelihood estimation: Logic and practice.
Introduction The Logic of Maximum Likelihood A General Modeling Framework Using Maximum Likelihood Methods An Introduction to Basic Estimation Techniques Further Empirical Examples Additional…
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
  • 1999
The Complexity of Computing a Nash Equilibrium
TLDR
It is shown that finding a Nash equilibrium in three-player games is indeed PPAD-complete; and this result is resolved by a reduction from Brouwer's problem, thus establishing that the two problems are computationally equivalent.
An Identity-Based Key-Exchange Protocol
TLDR
An identity-based approach to the distribution of cryptographic keys is proposed, which is simple and applicable to networks of arbitrary size and can, furthermore, be extended at will.
A Mathematical Theory of Communication
TLDR
It is proved that the authors can get some positive data rate that has the same small error probability and also there is an upper bound of the data rate, which means they cannot achieve the data rates with any encoding scheme that has small enough error probability over the upper bound.
...
...