Pages that link to "Item:Q1184508"
From MaRDI portal
The following pages link to Conditionally-perfect secrecy and a provably-secure randomized cipher (Q1184508):
Displaying 36 items.
- Magnifying computing gaps. Establishing encrypted communication over unidirectional channels (Q290516) (← links)
- Innovative approaches for security of small artefacts (Q465672) (← links)
- Infeasibility of instance compression and succinct PCPs for NP (Q619903) (← links)
- Some (in)sufficient conditions for secure hybrid encryption (Q710738) (← links)
- Non-interactive timestamping in the bounded-storage model (Q1015360) (← links)
- Information-theoretic secret-key agreement: the asymptotically tight relation between the secret-key rate and the channel quality ratio (Q1629419) (← links)
- Random oracles and non-uniformity (Q1648794) (← links)
- Everlasting multi-party computation (Q1994636) (← links)
- Separating adaptive streaming from oblivious streaming using the bounded storage model (Q2128990) (← links)
- Secure multiparty computation in the bounded storage model (Q2149802) (← links)
- Incompressible cryptography (Q2170026) (← links)
- Authentication in the bounded storage model (Q2170109) (← links)
- On the (im)possibility of non-interactive correlation distillation (Q2381528) (← links)
- Long term confidentiality: a survey (Q2448088) (← links)
- Disappearing cryptography in the bounded storage model (Q2697865) (← links)
- Fine-Grained Cryptography (Q2829959) (← links)
- Big-Key Symmetric Encryption: Resisting Key Exfiltration (Q2835594) (← links)
- Leakage Resilience of the Blom’s Key Distribution Scheme (Q2948266) (← links)
- Certified Security Proofs of Cryptographic Protocols in the Computational Model: An Application to Intrusion Resilience (Q3100218) (← links)
- Bit Commitment in the Bounded Storage Model: Tight Bound and Simple Optimal Construction (Q3104689) (← links)
- One-Time Programs with Limited Memory (Q3454868) (← links)
- (Q4036892) (← links)
- A storage complexity based analogue of Maurer key establishment using public channels (Q4608501) (← links)
- Chameleon — A new kind of stream cipher (Q4639332) (← links)
- A Lower Bound on the Key Length of Information-Theoretic Forward-Secure Storage Schemes (Q4931664) (← links)
- An operational characterization of mutual information in algorithmic information theory (Q5002777) (← links)
- A Probabilistic Error-Correcting Scheme that Provides Partial Secrecy (Q5098765) (← links)
- An Everlasting Secure Non-interactive Timestamping Scheme in the Bounded Storage Model (Q5268454) (← links)
- On the Impossibility of Strong Encryption Over $\aleph_0$ (Q5323010) (← links)
- Basing Weak Public-Key Cryptography on Strong One-Way Functions (Q5445498) (← links)
- Selected Areas in Cryptography (Q5491748) (← links)
- Fine-grained cryptography revisited (Q5918348) (← links)
- Unconditionally secure short key ciphers based on data compression and randomization (Q6041583) (← links)
- (Q6062142) (← links)
- Rate-1 incompressible encryption from standard assumptions (Q6114264) (← links)
- Fine-grained polynomial functional encryption (Q6593672) (← links)
