Conditionally-perfect secrecy and a provably-secure randomized cipher
From MaRDI portal
Publication:1184508
DOI10.1007/BF00191321zbMath0746.94013WikidataQ122876894 ScholiaQ122876894MaRDI QIDQ1184508
Publication date: 28 June 1992
Published in: Journal of Cryptology (Search for Journal in Brave)
perfect secrecyperfect with high probabilitypractical and provably secure cryptosystemsprovably secure cipherrandomized encryption
Related Items (32)
Separating adaptive streaming from oblivious streaming using the bounded storage model ⋮ Magnifying computing gaps. Establishing encrypted communication over unidirectional channels ⋮ Information-theoretic secret-key agreement: the asymptotically tight relation between the secret-key rate and the channel quality ratio ⋮ One-Time Programs with Limited Memory ⋮ On the (im)possibility of non-interactive correlation distillation ⋮ Secure multiparty computation in the bounded storage model ⋮ Random oracles and non-uniformity ⋮ On the Impossibility of Strong Encryption Over $\aleph_0$ ⋮ Incompressible cryptography ⋮ Authentication in the bounded storage model ⋮ Leakage Resilience of the Blom’s Key Distribution Scheme ⋮ Infeasibility of instance compression and succinct PCPs for NP ⋮ Puncturable signature: a generic construction and instantiations ⋮ Rate-1 incompressible encryption from standard assumptions ⋮ Speak much, remember little: cryptography in the bounded storage model, revisited ⋮ A storage complexity based analogue of Maurer key establishment using public channels ⋮ Disappearing cryptography in the bounded storage model ⋮ Unnamed Item ⋮ Long term confidentiality: a survey ⋮ Innovative approaches for security of small artefacts ⋮ An operational characterization of mutual information in algorithmic information theory ⋮ Chameleon — A new kind of stream cipher ⋮ Everlasting multi-party computation ⋮ A Lower Bound on the Key Length of Information-Theoretic Forward-Secure Storage Schemes ⋮ Basing Weak Public-Key Cryptography on Strong One-Way Functions ⋮ Fine-grained cryptography revisited ⋮ Non-interactive timestamping in the bounded-storage model ⋮ Fine-Grained Cryptography ⋮ Certified Security Proofs of Cryptographic Protocols in the Computational Model: An Application to Intrusion Resilience ⋮ Bit Commitment in the Bounded Storage Model: Tight Bound and Simple Optimal Construction ⋮ Big-Key Symmetric Encryption: Resisting Key Exfiltration ⋮ An Everlasting Secure Non-interactive Timestamping Scheme in the Bounded Storage Model
Cites Work
This page was built for publication: Conditionally-perfect secrecy and a provably-secure randomized cipher
