Generalized privacy amplification

@article{Bennett1994GeneralizedPA,
  title={Generalized privacy amplification},
  author={Charles H. Bennett and Gilles Brassard and Claude Cr{\'e}peau and Ueli Maurer},
  journal={Proceedings of 1994 IEEE International Symposium on Information Theory},
  year={1994},
  pages={350-}
}
This paper provides a general treatment of privacy amplification by public discussion, a concept introduced by Bennett, Brassard and Robert (1988) for a special scenario. The results have applications to unconditionally-secure secret-key agreement protocols, quantum cryptography and to a non-asymptotic and constructive treatment of the secrecy capacity of wire-tap and broadcast channels, even for a considerably strengthened definition of secrecy capacity.<<ETX>> 
A wireless secure key distribution system with no couriers: a One-Time-Pad Revival
  • G. Barbosa
  • Computer Science
    Journal of Information Security and Cryptography (Enigma)
  • 2019
TLDR
This work proposes a solution to bring perfect secrecy to in-transit communication and without the above problems and shows the key distribution scheme (nicknamed KeyBITS Platform) based on classical signals carrying information but that carry with them recordings of quantum noise.
9 Quantum Secure Telecommunication Systems
The main features of information security are confidentiality, integrity and availability. Only providing these all gives availability for development secure telecommunication systems.
Code-Hopping Based Transmission Scheme for Wireless Physical-Layer Security
TLDR
A code-hopping based secrecy transmission scheme that uses dynamic nonsystematic low-density parity-check (LDPC) codes and automatic repeat-request (ARQ) mechanism to jointly encode and encrypt source messages at the physical layer and can be compatible with traditional cryptosystems and enhance the security without sacrificing the error-correction performance.
Secret-Key Distribution Based on Bounded Observability
TLDR
An approach to secret-key distribution based on the bounded observability (BO) model, which describes limits on the information obtained by observation of a random object, and models the practical difficulty of completely observing random physical phenomena is reviewed.
Advances in Cryptology – CRYPTO 2014
TLDR
This work presents a quantum position verification scheme in the random oracle model that gives an efficient positionbased authentication protocol that enables secret and authenticated communication with an entity that is only identified by its position in space.
Implementation of physical layer key sharing schemes using Software Defined Radios
TLDR
This work presents implementations of two secret key sharing schemes over a Gaussian wire-tap channel and an error-free public side channel, and shows it is possible to agree on a secret key, if the channel conditions between transmitter and receiver are better than that of the transmitter and any eavesdropper.
Low-density random matrices for secret key extraction
TLDR
This work introduces a numerical method that allows us to tightly estimate the quality of the generated secret key in the regime of finite block length, and uses this method to demonstrate that low-density random matrices achieve very high performance for secret key extraction.
Agreement of a restricted secret key
  • Chung Chan
  • Mathematics, Computer Science
    2012 IEEE International Symposium on Information Theory Proceedings
  • 2012
A secret key agreement problem is proposed with the additional restriction that the key is a function of a given secret source. An inner bound to the achievable rates, error and secrecy exponents is
Device-independent quantum key distribution secure against adversaries with no long-term quantum memory
Device-Independent Quantum Key Distribution (DIQKD) is a formalism that supersedes traditional quantum key distribution, as its security does not rely on any detailed modelling of the internal
Group Secret Key Generation Algorithm from Wireless Signal Strength
TLDR
In order to generate a group secret key in the multiuser network, an algorithm is proposed through all users' collaboration and using the wireless signal strength using the Received Signal Strength (RSS) to demonstrate the method's applicability.
...
1
2
3
4
5
...