Results 11 to 20 of about 95,453 (277)
Information-Theoretic Security for the Masses [PDF]
, 2013 We combine interactive zero-knowledge protocols and weak physical layer randomness properties to construct a protocol which allows bootstrapping an IT-secure and PF-secure channel from a memorizable shared secret.
Nikitin, Oleksandr
core +2 more sources
Information-theoretic Physical Layer Security for Satellite Channels [PDF]
2017 IEEE Aerospace Conference, 2017 Shannon introduced the classic model of a cryptosystem in 1949, where Eve has access to an identical copy of the cyphertext that Alice sends to Bob. Shannon defined perfect secrecy to be the case when the mutual information between the plaintext and the ...
Hayashi, Masahito +1 more
core +2 more sources
Network Information Theoretic Security [PDF]
2020 IEEE International Symposium on Information Theory (ISIT), 2020 Shannon showed that to achieve perfect secrecy in point-to-point communication, the message rate cannot exceed the shared secret key rate giving rise to the simple one-time pad encryption scheme. In this paper, we extend this work from point-to-point to networks. We consider a connected network with pairwise communication between the nodes.
Zhou, Hongchao, Gamal, Abbas El
openaire +2 more sources
Information Theoretic Secure Aggregation With User Dropouts [PDF]
IEEE Transactions on Information Theory, 2021 In the robust secure aggregation problem, a server wishes to learn and only learn the sum of the inputs of a number of users while some users may drop out (i.e., may not respond). The identity of the dropped users is not known a priori and the server needs to securely recover the sum of the remaining surviving users.
Yizhou Zhao, Hua Sun
openaire +2 more sources
Security notions for information theoretically secure encryptions [PDF]
2011 IEEE International Symposium on Information Theory Proceedings, 2011 This paper is concerned with several security notions for information theoretically secure encryptions defined by the variational (statistical) distance. To ensure the perfect secrecy (PS), the mutual information is often used to evaluate the statistical independence between a message and a cryptogram.
Iwamoto, Mitsugu, Ohta, Kazuo
openaire +2 more sources
Information Leakages in Code-based Masking: A Unified Quantification Approach
Transactions on Cryptographic Hardware and Embedded Systems, 2021 This paper presents a unified approach to quantifying the information leakages in the most general code-based masking schemes. Specifically, by utilizing a uniform representation, we highlight first that all code-based masking schemes’ side-channel ...
Wei Cheng +4 more
doaj +1 more source
Random-Resistor-Random-Temperature Kirchhoff-Law-Johnson-Noise (RRRT-KLJN) Key Exchange
Metrology and Measurement Systems, 2016 We introduce two new Kirchhoff-law-Johnson-noise (KLJN) secure key distribution schemes which are generalizations of the original KLJN scheme. The first of these, the Random-Resistor (RR-) KLJN scheme, uses random resistors with values chosen from a ...
Kish Laszlo B., Granqvist Claes G.
doaj +1 more source
An Optimality Summary: Secret Key Agreement with Physical Unclonable Functions
Entropy, 2020 We address security and privacy problems for digital devices and biometrics from an information-theoretic optimality perspective to conduct authentication, message encryption/decryption, identification or secure and private computations by using a secret
Onur Günlü, Rafael F. Schaefer
doaj +1 more source
Metrology and Measurement Systems, 2014 Recently, Gunn, Allison and Abbott (GAA) [http://arxiv.org/pdf/1402.2709v2.pdf] proposed a new scheme to utilize electromagnetic waves for eavesdropping on the Kirchhoff-law-Johnson-noise (KLJN) secure key distribution. We proved in a former paper [Fluct.
Chen Hsien-Pu +3 more
doaj +1 more source
Universal Hashing for Information-Theoretic Security [PDF]
Proceedings of the IEEE, 2015 Corrected an error in the proof of Lemma ...
Tyagi, Himanshu, Vardy, Alexander
openaire +3 more sources