Results 11 to 20 of about 3,264 (253)
IEEE Access, 2021 In this paper, we concretely formulate to derive the attacker's success probability of obtaining the shared secret keys for the Y00 protocol under a combination of a quantum collective attack with infinitely-long known-plaintext, naming it “ ...
Takehisa Iwakoshi
doaj +1 more source
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 0001
openaire +2 more sources
Efficient Threshold Function Secret Sharing With Information-Theoretic Security
IEEE Access, 2020 Function secret sharing (FSS) is a cryptographic primitive that is introduced by Boyle et al. (Eurocrypt 2015), motivated by application scenarios involving private access to large distributed data while minimising the overhead of communication, for ...
Jinglong Luo +3 more
doaj +1 more source
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.
Mitsugu Iwamoto, Kazuo Ohta
openaire +2 more sources
On the Security of Pseudorandomized Information-Theoretically Secure Schemes [PDF]
IEEE Transactions on Information Theory, 2010 Dubrov and Ishai (STOC 2006) revealed, by generalizing the notion of pseudorandom generators (PRGs), that under a computational assumption, randomness in a protocol can be replaced with pseudorandomness in an indistinguishable way for an adversary even if his algorithm has unbounded complexity.
Koji Nuida, Goichiro Hanaoka
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
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
Security of Quantum Key Distribution
IEEE Access, 2016 The security issues facing quantum key distribution (QKD) are explained, herein focusing on those issues that are cryptographic and information theoretic in nature and not those based on physics. The problem of security criteria is addressed.
Horace P. Yuen
doaj +1 more source
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 +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