Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with KL-hardness:
TR15-149 | 8th September 2015
Mohammad Hajiabadi, Bruce Kapron

Gambling, Computational Information, and Encryption Security

We revisit the question, originally posed by Yao (1982), of whether encryption security may be characterized using computational information. Yao provided an affirmative answer, using a compression-based notion of computational information to give a characterization equivalent to the standard computational notion of semantic security. We give two other equivalent characterizations. ... more >>>

ISSN 1433-8092 | Imprint