publication . Part of book or chapter of book . Preprint . 2018

Deep Random Based Key Exchange Protocol Resisting Unlimited MITM

de Valroger, Thibault;
Open Access
  • Published: 03 Jan 2018
  • Publisher: Springer International Publishing
Abstract
We present a protocol enabling two legitimate partners sharing an initial secret to mutually authenticate and to exchange an encryption session key. The opponent is an active Man In The Middle (MITM) with unlimited computation and storage capacities. The resistance to unlimited MITM is obtained through the combined use of Deep Random secrecy, formerly introduced and proved as unconditionally secure against passive opponent for key exchange, and universal hashing techniques. We prove the resistance to MITM interception attacks, and show that (i) upon successful completion, the protocol leaks no residual information about the current value of the shared secret to ...
Subjects
free text keywords: Encryption, business.industry, business, Authentication, Secrecy, Key exchange, Shared secret, Hash function, Man-in-the-middle attack, Computer science, Session key, Computer security, computer.software_genre, computer, Computer Science - Cryptography and Security
Download fromView all 2 versions
http://arxiv.org/pdf/1801.0145...
Part of book or chapter of book
Provider: UnpayWall
http://link.springer.com/conte...
Part of book or chapter of book
Provider: Crossref

C. E. Shannon, « Communication theory of secrecy systems », Bell Syst. Tech. J., Vol. 28, pp. 656-715, Oct. 1949 [OpenAIRE]

A. N. Kolmogorov, « On Tables of Random Numbers », Sankhya. Indian Journal of Statistics A, 25(4) :369-376

C. H. Bennet and G. Brassard, « Quantum cryptography and its application to provable secure key expansion, public-key distribution and coin-tossing », Proc. IEEE International Conference on Computers, Systems and Signal Processing, Bangalore, India, pp. 175-179, Dec. 1984 C. H. Bennet, G. Brassard and J.-M. Robert, « Privacy Amplification by Public Discussion », SIAM J. COMPUT., Vol. 17, No. 2, Apr. 1988

U. M. Maurer, « Secret Key Agreement by Public Discussion from Common Information », IEEE Transactions on Information Theory, Vol. 39, No. 3, May 1993 C. Cachin and U. M. Maurer, « Unconditional Security Against Memory-Bounded Adversaries », Proceeding of CRYPTO '97, Lecture Notes in Computer Science, Springer, 1997 E. T. Jaynes, « Prior Probabilities », IEEE Transactions On Systems Science and Cybernetics, vol. sec-4, no. 3, 1968, pp. 227-241

R. T. Cox, « Probability, frequency and reasonable expectation », American Journal of Physics 17 (1946) 1-13

T. de Valroger, « Perfect Secrecy under (http://arxiv.org/abs/1507.08258 full version) [10] P. S. de Laplace, « A philosophical essay on Probabilities », Paris 1814 [11] Wegman, M.N., Carter, L., New hash functions and their use in authentication and set equality, 1980

[12] T. Beth, Y. Desmedt, Identification Tokens or: Solving the Chess Grand-master problem. Advances in Cryptology - CRYPTO'90 Proceedings, p.169-176. Springer-Verlag 1991 [13] G. Brassard and L. Salvail, « Secret-Key Reconciliation by Public Discussion »

Powered by OpenAIRE Open Research Graph
Any information missing or wrong?Report an Issue
publication . Part of book or chapter of book . Preprint . 2018

Deep Random Based Key Exchange Protocol Resisting Unlimited MITM

de Valroger, Thibault;