Pages that link to "Item:Q5451071"
From MaRDI portal
The following pages link to Simple and Tight Bounds for Information Reconciliation and Privacy Amplification (Q5451071):
Displayed 25 items.
- Towards a reverse Newman's theorem in interactive information complexity (Q343858) (← links)
- Simple one-shot bounds for various source coding problems using smooth Rényi quantities (Q522928) (← links)
- Sharp lower bounds on the extractable randomness from non-uniform sources (Q719242) (← links)
- One-way functions using algorithmic and classical information theories (Q1946513) (← links)
- Placing conditional disclosure of secrets in the communication complexity universe (Q2035998) (← links)
- Mosaics of combinatorial designs for information-theoretic security (Q2115738) (← links)
- Entropy accumulation (Q2206013) (← links)
- A joint Shannon cipher and privacy amplification approach to attaining exponentially decaying information leakage (Q2279660) (← links)
- Long term confidentiality: a survey (Q2448088) (← links)
- Precise evaluation of leaked information with secure randomness extraction in the presence of quantum attacker (Q2514199) (← links)
- Quantum key distribution with PRF(Hash, Nonce) achieves everlasting security (Q2690521) (← links)
- Information Theoretic Security for Encryption Based on Conditional Rényi Entropies (Q2948257) (← links)
- When Are Fuzzy Extractors Possible? (Q2958123) (← links)
- Evaluating Entropy for True Random Number Generators: Efficient, Robust and Provably Secure (Q2980880) (← links)
- On the Complexity of Breaking Pseudoentropy (Q2988853) (← links)
- Shannon Entropy Versus Renyi Entropy from a Cryptographic Viewpoint (Q3460111) (← links)
- Composable Security in the Bounded-Quantum-Storage Model (Q3519536) (← links)
- Simple and Tight Device-Independent Security Proofs (Q4629390) (← links)
- On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes (Q4640336) (← links)
- The Complexity of Differential Privacy (Q5021135) (← links)
- The conditional average entropies (Q5079207) (← links)
- Dimension Reduction for Polynomials over Gaussian Space and Applications (Q5121916) (← links)
- Randomness Extraction Via δ-Biased Masking in the Presence of a Quantum Attacker (Q5445521) (← links)
- Wireless-channel key exchange (Q6057200) (← links)
- Bounds for smooth min- and max-entropy (Q6098282) (← links)