Results 231 to 240 of about 95,453 (277)
Some of the next articles are maybe not open access.
INFORMATION THEORETICALLY SECURE KEY EXCHANGE ALGORITHM
Advances and Applications in Discrete Mathematics, 2023Summary: We propose an algorithm that enables secure information and communication channel based on perfect end-to-end key-exchange scheme. The secure channel between two users enables each user to use the public key of the other user to derive a specific private key for both users.
Besoul, Khaldoun +2 more
openaire +1 more source
Wireless Information-Theoretic Security
IEEE Transactions on Information Theory, 2008This paper considers the transmission of confidential data over wireless channels. Based on an information-theoretic formulation of the problem, in which two legitimates partners communicate over a quasi-static fading channel and an eavesdropper observes their transmissions through a second independent quasi-static fading channel, the important role of
Matthieu Bloch +3 more
openaire +1 more source
Information-Theoretic Security
2015Information theory is one of the foundations of computer science. In this chapter we will examine its relationship to cryptography. But we shall not assume any prior familiarity with information theory.
openaire +2 more sources
Cryptography with information theoretic security
Proceedings of the IEEE Information Theory Workshop, 2003Summary form only given. We discuss information-theoretic methods to prove the security of cryptosystems. We study what is called, unconditionally secure (or information-theoretically secure) cryptographic schemes in search for a system that can provide long-term security and that does not impose limits on the adversary's computational power.
H. Imai +4 more
openaire +1 more source
Information-theoretically secure keyless authentication
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060), 2002We consider a cryptographic scenario of two honest parties A and B facing an active eavesdropper E. They share no secret key initially but their final goal is to generate a shared information-theoretically secure key. We develop the special case represented in Maurer (1997) where a random binary string is broadcast by some center (like a satellite ...
V. Korjik, M. Bakin
openaire +1 more source
Information-theoretic security in wireless multicasting
International Conference on Electrical & Computer Engineering (ICECE 2010), 2010In this paper, a wireless multicast scenario is considered in which the transmitter sends a common message to a group of client receivers through quasi-static Rayleigh fading channel in the presence of an eavesdropper. The communication between transmitter and each client receiver is said to be secured if the eavesdropper is unable to decode any ...
Md. Zahurul I. Sarkar +1 more
openaire +1 more source
Information-theoretic secure identification
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252), 2002Secure identification has been based on unproven computational complexity assumptions or the correctness of quantum physics. In this paper we present unconditionally secure identification allowing active attacks.
openaire +1 more source
Wireless Information-Theoretic Security in MANETs
2013 IEEE International Conference on Communications Workshops (ICC), 2013In this work, the relation between the key parameters of Wireless Information-Theoretic Security, namely the probability of non-zero secrecy capacity, the outage probability, and the shadowing deviation is investigated. The purpose is to provide a framework to identify the boundaries of secure communication from a physical layer standpoint in MANETs ...
Theofilos Chrysikos +2 more
openaire +1 more source
Hash Functions and Information Theoretic Security
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2009Information theoretic security is an important security notion in cryptography as it provides a true lower bound for attack complexities. However, in practice attacks often have a higher cost than the information theoretic bound. In this paper we study the relationship between information theoretic attack costs and real costs.
Nasour BAGHERI +3 more
openaire +1 more source
Information-Theoretic Secure Multiparty Computation
2013Most of this book has considered two-party and multiparty computation with security with (unfair) abort. This security notion allows the adversary to force the honest parties to abort even depending on the outputs of corrupted parties. (Note, however, that the adversary is not allowed to bias the output of honest parties in any other manner.) This ...
Maurer Ueli, Zikas Vassilis
openaire +1 more source