Paper 2018/1057 Original: eprint.iacr.org/2018/1057 ↗

Limiting the impact of unreliable randomness in deployed security protocols

Liliya Akhmetzyanova
Cas Cremers
Luke Garratt
Stanislav V. Smyshlyaev
Nick Sullivan
Abstract

Many cryptographic mechanisms depend upon the availability of securely generated random numbers. In practice, the sources of random numbers can be unreliable for many reasons, including bugs, compromise or subversion of standards. While there exist ways to significantly reduce the impact of unreliable randomness, these typically do not work well with practical constraints, such as long-term keys stored in hardware security modules. In practice, even modern protocols like TLS 1.3 lack such mechanisms and are therefore highly vulnerable to unreliable randomness. We propose a wrapper construction that reduces the impact of untrusted randomness, and which is is compatible with, and effective in, existing deployments of protocols such as TLS. We provide a security analysis of the construction and elaborate on design choices and practical interpretations. Our findings show that it is possible to effectively harden deployed protocols against unreliable randomness.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
History
2019-10-16: last updated
2018-11-02: published
Short URL
https://ia.cr/2018/1057
License
https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2018/1057,
      author = {Liliya Akhmetzyanova and Cas Cremers and Luke Garratt and Stanislav V.  Smyshlyaev and Nick Sullivan},
      title = {Limiting the impact of unreliable randomness in deployed security protocols},
      howpublished = {Cryptology {ePrint} Archive, Paper 2018/1057},
      year = {2018},
      url = {https://eprint.iacr.org/2018/1057}
}
Note: In order to protect the privacy of readers, this archive does not use cookies or embedded third party content.