Sciweavers

Share
ACNS
2015
Springer

Secrecy Without Perfect Randomness: Cryptography with (Bounded) Weak Sources

4 years 10 months ago
Secrecy Without Perfect Randomness: Cryptography with (Bounded) Weak Sources
Cryptographic protocols are commonly designed and their security proven under the assumption that the protocol parties have access to perfect (uniform) randomness. Physical randomness sources deployed in practical implementations of these protocols often fall short in meeting this assumption, but instead provide only a steady stream of bits with certain high entropy. Trying to ground cryptographic protocols on such imperfect, weaker sources of randomness has thus far mostly given rise to a multitude of impossibility results, including the impossibility to construct provably secure encryption, commitments, secret sharing, and zero-knowledge proofs based solely on a weak source. More generally, indistinguishability-based properties break down for such weak sources. In this paper, we show that the loss of security induced by using a weak source can be meaningfully quantified if the source is bounded, e.g., for the well-studied Santha-Vazirani (SV) sources. The quantification relies on a...
Michael Backes 0001, Aniket Kate, Sebastian Meiser
Added 13 Apr 2016
Updated 13 Apr 2016
Type Journal
Year 2015
Where ACNS
Authors Michael Backes 0001, Aniket Kate, Sebastian Meiser 0001, Tim Ruffing
Comments (0)
books