Broadcast Authentication in Group Communication

Wang, Huaxiong

doi:10.1007/978-3-540-48000-6_32

Cited by 7 publications

(5 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Optimal construction of DMRA in terms of memory sizes for both a user's secret information and an authenticated message is an interesting open problem. We further point out that schemes in [14] and [9] are optimal only for memory sizes for an authenticated message.…”

Section: Methods To Fix the Problemmentioning

confidence: 92%

“…Earlier MRA schemes required the sender himself to be designated. In order to ease the requirement of the designated sender, several variations of MRA with dynamic sender or DMRA have been proposed [13,14,15]. Among these schemes, we especially looked into Safavi-Naini and Wang's DMRA [13,15] which we thought has an interesting construction.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Efficient and Unconditionally Secure Digital Signatures and a Security Analysis of a Multireceiver Authentication Code

Hanaoka

Shikata

Zheng

et al. 2002

Public Key Cryptography

View full text Add to dashboard Cite

Digital signatures whose security does not rely on any unproven computational assumption have recently received considerable attention. While these unconditionally secure digital signatures provide a foundation for long term integrity and non-repudiation of data, currently known schemes generally require a far greater amount of memory space for the storage of users' secret information than a traditional digital signature. The focus of this paper is on methods for reducing memory requirements of unconditionally secure digital signatures. A major contribution of this paper is to propose two novel unconditionally secure digital signature schemes that have significantly shortened secret information for users. As a specific example, with a typical parameter setting the required memory size for a user is reduced to approximately 1 10 of that in previously known schemes. Another contribution of the paper is to demonstrate an attack on a multireceiver authentication code proposed by Safavi-Naini and Wang, and present a method to fix the problem of the code.

show abstract

Section: Methods To Fix the Problemmentioning

confidence: 92%

Section: Related Workmentioning

confidence: 99%

Efficient and Unconditionally Secure Digital Signatures and a Security Analysis of a Multireceiver Authentication Code

Hanaoka

Shikata

Zheng

et al. 2002

Public Key Cryptography

View full text Add to dashboard Cite

show abstract

“…However, ABA is constructed based on (computationally secure) symmetric-key cryptography, and its model and security formalization is not given in the information-theoretic security setting. In addition, there are several schemes targeting one-to-many or many-to-many authenticated communications [24][25][26][27][28], however, those work is quite different from the MDRA-codes with information theoretic security.…”

Section: Related Workmentioning

confidence: 99%

Multi-Designated Receiver Authentication Codes: Models and Constructions

Watanabe

Seito

Shikata

2023

IEICE Trans. Fundamentals

View full text Add to dashboard Cite

An authentication code (A-code) is a two-party message authentication code in the information-theoretic security setting. One of the variants of A-codes is a multi-receiver authentication code (MRA-code), where there are a single sender and multiple receivers and the sender can create a single authenticator so that all receivers accepts it unless it is maliciously modified. In this paper, we introduce a multi-designated receiver authentication code (MDRA-code) with information-theoretic security as an extension of MRA-codes. The purpose of MDRA-codes is to securely transmit a message via a broadcast channel from a single sender to an arbitrary subset of multiple receivers that have been designated by the sender, and only the receivers in the subset (i.e., not all receivers) should accept the message if an adversary is absent. This paper proposes a model and security formalization of MDRA-codes, and provides constructions of MDRA-codes.

show abstract

“…Broadcast authentication [10,36,37,40,42,45] aims to broadcast a single piece of data to many receivers with data authenticity. However, with the exception of Watanabe et al's work [50], the existing works do not support the functionality that a sender chooses an arbitrary subset of receivers; data is always broadcast to all receivers.…”

Section: Related Workmentioning

confidence: 99%

IoT-REX: A Secure Remote-Control System for IoT Devices from Centralized Multi-Designated Verifier Signatures

Watanabe¹,

Yanai²,

Shikata³

2022

Preprint

View full text Add to dashboard Cite

IoT technology has been developing rapidly, while at the same time, notorious IoT malware such as Mirai is a severe and inherent threat. We believe it is essential to consider systems that enable us to remotely control infected devices in order to prevent or limit malicious behaviors of infected devices. In this paper, we design a promising candidate for such remote-control systems, called IoT-REX (REmote-Control System for IoT devices). IoT-REX allows a systems manager to designate an arbitrary subset of all IoT devices in the system and every device can confirm whether or not the device itself was designated; if so, the device executes a command given from the systems manager. Towards realizing IoT-REX, we introduce a novel cryptographic primitive called centralized multi-designated verifier signatures (CMDVS). Although CMDVS works under a restricted condition compared to conventional MDVS, it is sufficient for realizing IoT-REX. We provide an efficient CMDVS construction from any approximate membership query structures and digital signatures, yielding compact communication sizes and efficient verification procedures for IoT-REX. We then discuss the feasibility of IoT-REX through cryptographic implementation of the CMDVS construction on a Raspberry Pi. Our promising results demonstrate that the CMDVS construction can compress communication size to about 30% and thus its resulting IoT-REX becomes three times faster than a trivial construction over typical low-power wide area networks with an IoT device. It is expected that IoT-REX can control 12,000 devices within a second.

show abstract

Broadcast Authentication in Group Communication

Cited by 7 publications

References 24 publications

Efficient and Unconditionally Secure Digital Signatures and a Security Analysis of a Multireceiver Authentication Code

Efficient and Unconditionally Secure Digital Signatures and a Security Analysis of a Multireceiver Authentication Code

Multi-Designated Receiver Authentication Codes: Models and Constructions

IoT-REX: A Secure Remote-Control System for IoT Devices from Centralized Multi-Designated Verifier Signatures

Contact Info

Product

Resources

About