Incompressible Encryption
Encryption whose ciphertexts cannot be meaningfully compressed, and the bounded-storage adversaries it defends against.
| Status | Statement | Tags |
|---|---|---|
|
Seeded Extractors Are Multi-Instance Posed by the source with both answers live. It proves the property for two code-based extractors via a hinting property it isolates; concurrent independent work of Dinur, Stemmer, Woodruff and Zhou proves it for universal hash functions by a different argument. No extractor is known to fail it and no general proof is known. 4 open |
Incompressible EncryptionRandomness Extractioncharacterization |
No matching items