Results 11 to 20 of about 95,453 (278)
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
EURASIP Journal on Wireless Communications and Networking, 2009 A method of overloading subcarriers by multiple transmitters to secure OFDM in wireless time-varying channels is proposed and analyzed. The method is based on reverse piloting, superposition modulation, and joint decoding.
Wulich Dov, Tsouri GillR
doaj +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
Unconditionally Secure Quantum Signatures
Entropy, 2015 Signature schemes, proposed in 1976 by Diffie and Hellman, have become ubiquitous across modern communications. They allow for the exchange of messages from one sender to multiple recipients, with the guarantees that messages cannot be forged or tampered
Ryan Amiri, Erika Andersson
doaj +1 more source
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
Information-theoretically secure protocols and security under composition [PDF]
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing, 2006 We investigate the question of whether security of protocols in the information-theoretic setting (where the adversary is computationally unbounded) implies security under concurrent composition. This question is motivated by the folklore that all known protocols that are secure in the information-theoretic setting are indeed secure under concurrent ...
Eyal Kushilevitz +2 more
openaire +1 more source