Simplifying information-theoretic arguments by post-selection

DOI10.3233/978-1-60750-547-1-66zbMATH Open1197.81107OpenAlexW2403871733MaRDI QIDQ3589462FDOQ3589462

Authors: R. Renner 

Publication date: 20 September 2010

Full work available at URL: https://doi.org/10.3233/978-1-60750-547-1-66

Recommendations

• Simple and tight device-independent security proofs
• Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
• Privacy Amplification by Public Discussion
• Unconditional security in quantum cryptography
• Privacy amplification for quantum key distribution

zbMATH Keywords

symmetryquantum cryptographyquantum information theoryde Finetti theoremspost-selection technique

Mathematics Subject Classification ID

Cryptography (94A60) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum coding (general) (81P70) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cited In (4)

• Quantum conditional mutual information and approximate Markov chains
• Secure certification of mixed quantum states with application to two-party randomness generation
• De Finetti reductions for correlations
• The Power of Self-Reducibility: Selectivity, Information, and Approximation

This page was built for publication: Simplifying information-theoretic arguments by post-selection

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3589462)