Long term confidentiality: a survey
From MaRDI portal
Publication:2448088
DOI10.1007/s10623-012-9747-6zbMath1311.68056OpenAlexW2021694961MaRDI QIDQ2448088
Ciaran Mullan, Alex Wiesmaier, Johannes Braun, Johannes A. Buchmann
Publication date: 29 April 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-012-9747-6
Related Items (2)
A Linear Algebra Attack on the Non-commuting Cryptography Class Based on Matrix Power Function ⋮ Cryptanalysis of schemes based on pseudoinverse matrix
Cites Work
- A Mathematical Theory of Communication
- Quantum cryptography: public key distribution and coin tossing
- Long-term security and universal composability
- Conditionally-perfect secrecy and a provably-secure randomized cipher
- Optimal randomizer efficiency in the bounded-storage model
- Encryption against storage-bounded adversaries from on-line strong extractors
- Constructing locally computable extractors and cryptosystems in the bounded-storage model
- Construction of extractors using pseudo-random generators (extended abstract)
- Semantic Security for the Wiretap Channel
- Secret Keys from Channel Noise
- Secret-Sharing Schemes: A Survey
- How to share a secret
- Cryptography in the Bounded-Quantum-Storage Model
- Tight security proofs for the bounded-storage model
- Correcting errors without leaking partial information
- On Everlasting Security in the Hybrid Bounded Storage Model
- The Bare Bounded-Storage Model: The Tight Bound on the Storage Requirement for Key Agreement
- Key Distribution Protocols Based on Noisy Channels in Presence of an Active Adversary: Conventional and New Versions With Parameter Optimization
- The Bounded-Storage Model in the Presence of a Quantum Adversary
- Introduction to post-quantum cryptography
- Privacy Amplification by Public Discussion
- The Wire-Tap Channel
- Broadcast channels with confidential messages
- Secret key agreement by public discussion from common information
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On Unconditionally Secure Robust Distributed Key Distribution Centers
- Parameter estimation for three-parameter generalized Pareto distribution by weighted non linear least squares
- Everlasting security in the bounded storage model
- Unconditionally secure key agreement and the intrinsic conditional information
- Generalized privacy amplification
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- A single quantum cannot be cloned
- Quantum cryptography
- Advances in Cryptology - CRYPTO 2003
- Simple and Tight Bounds for Information Reconciliation and Privacy Amplification
- Elements of Information Theory
- Selected Areas in Cryptography
- Theory of Cryptography
- Selecting cryptographic key sizes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Long term confidentiality: a survey
