A storage complexity based analogue of Maurer key establishment using public channels

DOI10.1007/3-540-60693-9_11zbMATH Open1383.94033OpenAlexW1537527298MaRDI QIDQ4608501FDOQ4608501

Authors:

Publication date: 21 March 2018

Published in: Cryptography and Coding (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60693-9_11

Recommendations

• On the Algorithmic Computability of the Secret Key and Authentication Capacity Under Channel, Storage, and Privacy Leakage Constraints
• A lower bound on the key length of information-theoretic forward-secure storage schemes
• Information and Communications Security
• Trade-offs between communication and storage in unconditionally secure schemes for broadcast encryption and interactive key distribution
• Public-key encryption in the bounded-retrieval model
• Constructing confidential channels from authenticated channels-public-key encryption revisited
• Cryptographic primitives enforcing communication and storage complexity
• Memory-tight multi-challenge security of public-key encryption
• A Noiseless Key-Homomorphic PRF: Application on Distributed Storage Systems

zbMATH Keywords

storage complexitykey agreement systempublic broadcast channel

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• New directions in cryptography
• Conditionally-perfect secrecy and a provably-secure randomized cipher
• Secret key agreement by public discussion from common information
• The Wire-Tap Channel

Cited In (3)

• Fine-grained cryptography revisited
• A Noiseless Key-Homomorphic PRF: Application on Distributed Storage Systems
• Fine-grained non-interactive key-exchange without idealized assumptions

This page was built for publication: A storage complexity based analogue of Maurer key establishment using public channels

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