Broadcast Encryption with Information Theoretic Security -- Classical Results and Recent Progress

Juan A. Garay, Jonathan I. Katz, Ranjit Kumaresan +1 more

We consider the classical problem of synchronous broadcast with dishonest majority, when a public-key infrastructure and digital signatures are available. In a surprising result, Hirt and Zikas (Eurocrypt 2010) recently observed that all existing protocols for this task are insecure against an adaptive adversary who can choose which parties to corrupt as the protocol progresses. Moreover, they prove an impossibility result for adaptively secure broadcast in their setting. We argue that the communication model adopted by Hirt and Zikas is unrealistically pes-simistic. We revisit the problem of adaptively secure broadcast in a more natural synchronous model (with rushing), and show that broadcast is possible in this setting for an arbitrary num-ber of corruptions. Our positive result holds under a strong, simulation-based definition in the universal-composability framework. We also study the impact of adaptive attacks on protocols for secure multi-party computation where broadcast is used as a sub-routine. 1

Junji Shikata

P. Oscar Boykin

The problem of security of quantum key protocols is examined. In addition to the distribution of classical keys, the problem of encrypting quantum data and the structure of the operators which perform quantum encryption is studied. It is found that unitary bases are central to both encryption of quantum information, as well as the generation of states used in generalized quantum key distribution (which are called mutually unbiased bases). A one-to-one correspondence between certain unitary bases and mutually unbiased bases is found. Finally, a new protocol for making anonymous classical broadcasts is given along with a security proof. An experimental procedure to implement this protocol is also given. In order to prove these new results, some new bounds for accessible information of quantum sources are obtained.

Shun Watanabe

Jeffrey Champion, David J. Wu

Kentaro Kato, Osamu Hirota

The quantum noise based direct encryption protocol Y-OO is expected to provide physical complexity based security, which is thought to be comparable to information theoretic security in mathematical cryptography, for the. physical layer of fiber-optic communication systems. So far, several randomization techniques for the quantum stream cipher by Y-OO protocol have been proposed, but most of them were developed under the assumption that phase shift keying is used as the modulation format. On the other hand, the recent progress in the experimental study on the intensity modulation based quantum stream cipher by Y-OO protocol raises expectations for its realization. The purpose of this paper is to present design and implementation methods of a composite model of the intensity modulation based quantum stream cipher with some randomization techniques. As a result this paper gives a viewpoint of how the Y-OO cryptosystem is miniaturized.