Separating sources for encryption and secret sharing Conference Paper


Author(s): Dodis, Yevgeniy; Pietrzak, Krzysztof; Przydatek, Bartosz
Title: Separating sources for encryption and secret sharing
Title Series: LNCS
Affiliation
Abstract: Most cryptographic primitives such as encryption, authentication or secret sharing require randomness. Usually one assumes that perfect randomness is available, but those primitives might also be realized under weaker assumptions. In this work we continue the study of building secure cryptographic primitives from imperfect random sources initiated by Dodis and Spencer (FOCS’02). Their main result shows that there exists a (high-entropy) source of randomness allowing for perfect encryption of a bit, and yet from which one cannot extract even a single weakly random bit, separating encryption from extraction. Our main result separates encryption from 2-out-2 secret sharing (both in the information-theoretic and in the computational settings): any source which can be used to achieve one-bit encryption also can be used for 2-out-2 secret sharing of one bit, but the converse is false, even for high-entropy sources. Therefore, possibility of extraction strictly implies encryption, which in turn strictly implies 2-out-2 secret sharing.
Conference Title: TCC: Theory of Cryptography Conference
Volume: 3876
Conference Dates: March 4-7, 2006
Conference Location: New York, NY, USA
Publisher: Springer  
Date Published: 2006-04-11
Start Page: 601
End Page: 616
Copyright Statement: ⓒ Springer-Verlag Berlin Heidelberg 2006
Sponsor: Supported in part by NSF career award CCR-0133806 and NSF grant CCR-0311095. Supported by the Swiss National Science Foundation, project No. 200020-103847/1.
DOI: 10.1007/11681878_31
Open access: no
IST Austria Authors
Related IST Austria Work