Results 31 to 40 of about 13,748 (278)
Secret-Key Capacity Regions for Multiple Enrollments With an SRAM-PUF [PDF]
We introduce the multiple enrollment scheme for SRAM-PUFs. During each enrollment the binary power-on values of the SRAM are observed, and a corresponding key and helper data are generated. Each key can later be reconstructed from an additional observation and the helper data. The helper data do not reveal information about the keys to an attacker.
Lieneke Kusters, Frans M. J. Willems
openaire +2 more sources
A novel approach is presented in this paper for hiding the data using Fractional Grey Wolf Optimization. In this work, the key frames are extracted using the Structural Similarity Index measurement (SSIM).
Meenu Suresh, I. Shatheesh Sam
doaj +1 more source
Secret-key-assisted private classical communication capacity over quantum channels
We prove a regularized formula for the secret key-assisted capacity region of a quantum channel for transmitting private classical information. This result parallels the work of Devetak on entanglement assisted quantum communication capacity \cite ...
Brun, T, Luo, Z, Hsieh, M
core +2 more sources
Recent Advances on Quantum Key Distribution Overcoming the Linear Secret Key Capacity Bound [PDF]
Abstract A crucial goal for quantum key distribution (QKD) is to transmit unconditionally secure keys over long distances. Previous studies show that the key rate of point‐to‐point QKD is limited by a secret key rate capacity bound, and higher key rates would require quantum repeaters. In 2018, the seminal twin‐field (TF) QKD protocol
Yingqiu Mao, Pei Zeng, Teng‐Yun Chen
openaire +2 more sources
Breaking the Rate-Loss Bound of Quantum Key Distribution with Asynchronous Two-Photon Interference
Twin-field quantum key distribution can overcome the secret key capacity of repeaterless quantum key distribution via single-photon interference. However, to compensate for the channel fluctuations and lock the laser fluctuations, the techniques of phase
Yuan-Mei Xie +9 more
doaj +1 more source
Secret Sharing over Fast-Fading MIMO Wiretap Channels
Secret sharing over the fast-fading MIMO wiretap channel is considered. A source and a destination try to share secret information over a fast-fading MIMO channel in the presence of an eavesdropper who also makes channel observations that are different ...
Tan F. Wong +2 more
doaj +2 more sources
An Electronic Lattice Construction Method Based on Game Padding
The concealment, the steganography success rate, and the steganographic capacity are key performance indicators to text steganography. The existing text steganography methods still have a low steganographic capacity, some syntactic or semantic ambiguity ...
Congfei Sun, Kaixi Wang
doaj +1 more source
Impact of Realistic Propagation Conditions on Reciprocity-Based Secret-Key Capacity [PDF]
Secret-key generation exploiting the channel reciprocity between two legitimate parties is an interesting alternative solution to cryptographic primitives for key distribution in wireless systems as it does not rely on an access infrastructure and provides information-theoretic security.
Rottenberg, François +4 more
openaire +4 more sources
A NEW AND ADAPTIVE SECURITY MODEL FOR PUBLIC COMMUNICATION BASED ON CORRELATION OF DATA FRAMES
Recent developments in communication and information technologies, plus the emerging of the Internet of Things (IoT) and machine to machine (M2M) principles, create the need to protect data from multiple types of attacks. In this paper, a secure and high
Haider Tarish Haider +3 more
doaj +1 more source
Secrecy Rate Region Enhancement in Multiple Access Wiretap Channel
It is commonly known that physical layer security is achieved with a trade-off in terms of the achievable rate. Hence, security constraints generate rate losses in wiretap channels.
Shahid Mehraj Shah
doaj +1 more source

