Decentralized management of One-Time Pad key material for a group

• Jeroen van de Graaf UFMG

DOI: https://doi.org/10.5753/sbseg.2014.20145

Resumo

Suppose a group of users share copies of a large file of truly random bits, possibly distributed through portable USB sticks or external hard drives. In this note we present a randomized, distributed key management scheme allowing these users to use this file as a One-Time Pad key, without fear of two users using the same key material twice.

Referências

A. Rukhin, J. Soto, J. Nechvatal, M. Smid, E. Barker, S. Leigh, M. Levenson, M. Vangel, D. Banks, A. Heckert, J. Dray, S. Vo A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications. NIST Special Publication 800-22 Revision 1a, April 2010.

C. Shannon, Communication Theory of Secrecy Systems. Bell System Technical Journal 28 (4): 656–715..

P. Halmos. I Want to Be a Mathematician. Springer-Verlag. ISBN 978-0387960784.

Anonymous. Birthday Problem http://en.wikipedia.org/wiki/Birthday_problem

Stinson, D. Something About All or Nothing (Transforms). Designs, Codes and Cryptography, Volume 22 Issue 2, March 2001, Pages 133–138

K. Nishimura and M. Sibuya, Probability To Meet in the Middle. J. Cryptology, vol 2 (1), 1990.