Results 211 to 220 of about 2,320 (256)
Some of the next articles are maybe not open access.

Secure E-mail protocols providing perfect forward secrecy

IEEE Communications Letters, 2005
Electronic mail, E-mail in short, has been used to transfer various types of electronic data on Internet. In order to deliver the E-mail from the sender to the receiver both efficiently and securely, the E-mail system usually employs both conventional and public key cryptographic systems.
Hung-Min Sun
exaly   +2 more sources

Three Constructions of Authentication Codes with Perfect Secrecy

Designs, Codes, and Cryptography, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ding, Cunsheng
exaly   +3 more sources

E-mail protocols with perfect forward secrecy

International Journal of Security and Networks, 2012
In IEEE Communication Letters, Kim et al. and Sun et al. proposed several e-mail protocols and claimed that they provide perfect forward secrecy. In this paper, we show that under the assumption that the e-mail server is also malicious, Kim et al.'s two e-mail protocols do not provide perfect forward secrecy.
Duncan S. Wong, Xiaojian Tian
exaly   +2 more sources

Perfect secrecy, perfect omniscience and steiner tree packing

2009 IEEE International Symposium on Information Theory, 2009
We investigate perfect secret key generation for a “pairwise independent network” model in which every pair of terminals observes correlated sources that are independent of sources observed by all other pairs of terminals. The terminals are then allowed to communicate interactively in multiple rounds over a public noiseless channel of unlimited ...
S. Nitinawarat   +4 more
openaire   +1 more source

Perfect secrecy in wireless networks

2003 International Conference on Parallel Processing Workshops, 2003. Proceedings., 2004
In a classic paper, among a multitude of other security issues, Claude E. Shannon defined perfect secrecy for a pair of secure computers communicating over an insecure link. The present paper extends Shannon's notion of perfect secrecy to ad hoc wireless networks of computers. All of the wireless transmissions are insecure.
P.G. Bradford   +2 more
openaire   +1 more source

Perfect secrecy and combinatorial tree packing

2010 IEEE International Symposium on Information Theory, 2010
We consider perfect secret key generation for a “pairwise independent network” model in which every pair of terminals share a random binary string, with the strings shared by distinct terminal pairs being mutually independent. The terminals are then allowed to communicate interactively over a public noiseless channel of unlimited capacity.
S. Nitinawarat, P. Narayan
openaire   +1 more source

Distributed Compressive Detection with Perfect Secrecy

2014 IEEE 11th International Conference on Mobile Ad Hoc and Sensor Systems, 2014
This paper considers the problem of distributed compressive detection under a perfect secrecy constraint. More specifically, we consider the problem where the distributed inference network operates in the presence of an eavesdropper who wants to discover the state of the nature being monitored by the system.
Bhavya Kailkhura   +3 more
openaire   +1 more source

State estimation codes for perfect secrecy

2017 IEEE 56th Annual Conference on Decision and Control (CDC), 2017
We study the problem of remote state estimation, in the presence of a passive eavesdropper. An authorized user estimates the state of an unstable linear plant, based on the packets received from a sensor, while the packets may also be intercepted by the eavesdropper.
Anastasios Tsiamis   +2 more
openaire   +1 more source

Perfect secrecy

Abstract The discussion of historical cryptography is continued from Chapter 3, but from the viewpoint of whether a cipher is unbreakable. In this context, Mary Queen of Scots’ Nomenclator Cipher and the Enigma cipher machine are discussed.
Sean Murphy, Rachel Player
openaire   +1 more source

Home - About - Disclaimer - Privacy