On the (Im)possibility of cryptography with imperfect randomness

Yevgeniy Dodis, Manoj Prabhakaran, Shien Jin Ong, Amit Sahai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We investigate the feasibility of a variety of cryptographic tasks with imperfect randomness. The kind of imperfect randomness we consider are entropy sources, such as those considered by Santha and Vazirani, Chor and Goldreich, and Zuckerman. We show the following: Certain cryptographic tasks like bit commitment, encryption, secret sharing, zero-knowledge, non-interactive zero-knowledge, and secure two-party computation for any non-trivial function are impossible to realize if parties have access to entropy sources with slightly less-than-perfect entropy, i.e., sources with imperfect randomness. These results are unconditional and do not rely on any unproven assumption. On the other hand, based on stronger variants of standard assumptions, secure signature schemes are possible with imperfect entropy sources. As another positive result, we show (without any unproven assumption) that interactive proofs can be made sound with respect to imperfect entropy sources.

Original languageEnglish (US)
Title of host publicationProceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Pages196-205
Number of pages10
StatePublished - 2004
EventProceedings - 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004 - Rome, Italy
Duration: Oct 17 2004Oct 19 2004

Other

OtherProceedings - 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004
CountryItaly
CityRome
Period10/17/0410/19/04

Fingerprint

Cryptography
Entropy
Acoustic waves

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Dodis, Y., Prabhakaran, M., Ong, S. J., & Sahai, A. (2004). On the (Im)possibility of cryptography with imperfect randomness. In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS (pp. 196-205)

On the (Im)possibility of cryptography with imperfect randomness. / Dodis, Yevgeniy; Prabhakaran, Manoj; Ong, Shien Jin; Sahai, Amit.

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. 2004. p. 196-205.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Dodis, Y, Prabhakaran, M, Ong, SJ & Sahai, A 2004, On the (Im)possibility of cryptography with imperfect randomness. in Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. pp. 196-205, Proceedings - 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004, Rome, Italy, 10/17/04.
Dodis Y, Prabhakaran M, Ong SJ, Sahai A. On the (Im)possibility of cryptography with imperfect randomness. In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. 2004. p. 196-205
Dodis, Yevgeniy ; Prabhakaran, Manoj ; Ong, Shien Jin ; Sahai, Amit. / On the (Im)possibility of cryptography with imperfect randomness. Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS. 2004. pp. 196-205
@inproceedings{960de2735e014a319ea45fe5b42368c0,
title = "On the (Im)possibility of cryptography with imperfect randomness",
abstract = "We investigate the feasibility of a variety of cryptographic tasks with imperfect randomness. The kind of imperfect randomness we consider are entropy sources, such as those considered by Santha and Vazirani, Chor and Goldreich, and Zuckerman. We show the following: Certain cryptographic tasks like bit commitment, encryption, secret sharing, zero-knowledge, non-interactive zero-knowledge, and secure two-party computation for any non-trivial function are impossible to realize if parties have access to entropy sources with slightly less-than-perfect entropy, i.e., sources with imperfect randomness. These results are unconditional and do not rely on any unproven assumption. On the other hand, based on stronger variants of standard assumptions, secure signature schemes are possible with imperfect entropy sources. As another positive result, we show (without any unproven assumption) that interactive proofs can be made sound with respect to imperfect entropy sources.",
author = "Yevgeniy Dodis and Manoj Prabhakaran and Ong, {Shien Jin} and Amit Sahai",
year = "2004",
language = "English (US)",
pages = "196--205",
booktitle = "Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS",

}

TY - GEN

T1 - On the (Im)possibility of cryptography with imperfect randomness

AU - Dodis, Yevgeniy

AU - Prabhakaran, Manoj

AU - Ong, Shien Jin

AU - Sahai, Amit

PY - 2004

Y1 - 2004

N2 - We investigate the feasibility of a variety of cryptographic tasks with imperfect randomness. The kind of imperfect randomness we consider are entropy sources, such as those considered by Santha and Vazirani, Chor and Goldreich, and Zuckerman. We show the following: Certain cryptographic tasks like bit commitment, encryption, secret sharing, zero-knowledge, non-interactive zero-knowledge, and secure two-party computation for any non-trivial function are impossible to realize if parties have access to entropy sources with slightly less-than-perfect entropy, i.e., sources with imperfect randomness. These results are unconditional and do not rely on any unproven assumption. On the other hand, based on stronger variants of standard assumptions, secure signature schemes are possible with imperfect entropy sources. As another positive result, we show (without any unproven assumption) that interactive proofs can be made sound with respect to imperfect entropy sources.

AB - We investigate the feasibility of a variety of cryptographic tasks with imperfect randomness. The kind of imperfect randomness we consider are entropy sources, such as those considered by Santha and Vazirani, Chor and Goldreich, and Zuckerman. We show the following: Certain cryptographic tasks like bit commitment, encryption, secret sharing, zero-knowledge, non-interactive zero-knowledge, and secure two-party computation for any non-trivial function are impossible to realize if parties have access to entropy sources with slightly less-than-perfect entropy, i.e., sources with imperfect randomness. These results are unconditional and do not rely on any unproven assumption. On the other hand, based on stronger variants of standard assumptions, secure signature schemes are possible with imperfect entropy sources. As another positive result, we show (without any unproven assumption) that interactive proofs can be made sound with respect to imperfect entropy sources.

UR - http://www.scopus.com/inward/record.url?scp=17744370165&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=17744370165&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:17744370165

SP - 196

EP - 205

BT - Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

ER -