Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEICE Technical Report; IEICE Tech. Rep.

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

Yohei Watanabe

Published Sep 1, 2017• 0 citations
OpenAlex

Related papers

Recent Developments and Open Problems in Information Theoretic Cryptography

Shun Watanabe

IEICE Technical Report; IEICE Tech. Rep.•Nov 21, 2017•0 citations

Adaptively secure broadcast, revisited

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

ACM Symposium on Principles of Distributed Computing (PODC)•Jun 6, 2011•54 citations

Physical layer encryption using fixed and reconfigurable antennas

Michael Daly

Traditionally, antenna systems have been designed to achieve reliable wireless communication, while the problem of securing that communication from eavesdropping was left to mathematical cryptography. Recent research into physical layer encryption shows that jointly designing for reliability and secrecy at the physical layer may be a better solution. Physical layer encryption involves techniques that ensure a signal is information-theoretically secure, meaning that an eavesdropper with infinite time and computational resources will not be able to decode a message. Such techniques include purposely broadcasting artificial noise, transmitting direction-dependent signals, and opportunistic communications. This work addresses different methods for broadcasting artificial noise using fixed arrays, including tradeoffs with power usage and computational complexity. In addition, a method of producing direction-dependent distortion using reconfigurable arrays is also shown. These two methods are combined and shown to be more secure and power-efficient than either in isolation. An analysis of secrecy rates through mutual information makes it possible to compare the performance of all the various secure communication techniques. Simulations with various wireless channels as well as an experimental test using a fixed and reconfigurable array are presented.

•Jan 1, 2012•6 citations

Information-Theoretic Cryptography -- Survey and Challenge

Junji Shikata

IEICE Technical Report; IEICE Tech. Rep.•Mar 3, 2014•0 citations

Information Security and Quantum Mechanics: Security of Quantum Protocols

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.

arXiv:quant-ph/0210194•Oct 28, 2002•27 citations

Distributed Broadcast Encryption from Lattices

Jeffrey Champion, David J. Wu

Lecture notes in computer science•Nov 30, 2024•20 citations
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
Traditionally, antenna systems have been designed to achieve reliable wireless communication, while the problem of securing that communication from eavesdropping was left to mathematical cryptography. Recent research into physical layer encryption shows that jointly designing for reliability and secrecy at the physical layer may be a better solution. Physical layer encryption involves techniques that ensure a signal is information-theoretically secure, meaning that an eavesdropper with infinite time and computational resources will not be able to decode a message. Such techniques include purposely broadcasting artificial noise, transmitting direction-dependent signals, and opportunistic communications. This work addresses different methods for broadcasting artificial noise using fixed arrays, including tradeoffs with power usage and computational complexity. In addition, a method of producing direction-dependent distortion using reconfigurable arrays is also shown. These two methods are combined and shown to be more secure and power-efficient than either in isolation. An analysis of secrecy rates through mutual information makes it possible to compare the performance of all the various secure communication techniques. Simulations with various wireless channels as well as an experimental test using a fixed and reconfigurable array are presented.
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.