activity
20092026
most citedSecure Network Code for Adaptive and Active Attacks with No-Randomness in Intermediate Nodes

24 citations · 118 across the 21 of their papers we have counts for

collaborators

21 papers

cs.IT2026

Cryptographic and Information-theoretic Security Capacities for General Arbitrarily Varying Wiretap Channels

Holger Boche, Ning Cai, Yiqi Chen +1

We compare the strong secrecy capacities of Arbitrarily Varying Wiretap Channels (AVWCs) and General Arbitrarily Varying Wiretap Channels (GAVWCs) with their capacities under seman…

quant-ph2020★ 1 cited

Universal classical-quantum superposition coding and universal classical-quantum multiple access channel coding

Masahito Hayashi, Ning Cai

We derive universal classical-quantum superposition coding and universal classical-quantum multiple access channel code by using generalized packing lemmas for the type method. Usi…

cs.IT2020★ 1 cited

Asymptotically Secure Network Code for Active Attacks and its Application to Network Quantum Key Distribution

Masahito Hayashi, Ning Cai

When there exists a malicious attacker in the network, we need to be careful of eavesdropping and contamination. This problem is crucial for network communication when the network…

cs.IT2020★ 11 cited

Secure network code over one-hop relay network

Masahito Hayashi, Ning Cai

When there exists a malicious attacker in the network, we need to consider the possibilities of eavesdropping and the contamination simultaneously. Under an acyclic broadcast netwo…

cs.IT2020★ 11 cited

Reduction Theorem for Secrecy over Linear Network Code for Active Attacks

Masahito Hayashi, Masaki Owari, Go Kato +1

We discuss the effect of sequential error injection on information leakage under a network code. We formulate a network code for the single transmission setting and the multiple tr…

quant-ph2019

Computing the Classical-Quantum channel capacity: experiments on a Blahut-Arimoto type algorithm and an approximate solution for the binary inputs, two-dimensional outputs channel

Haobo Li, Ning Cai

In our previous work, we presented a Blahut-Arimoto type algorithm for computing the discrete memoryless (DM) classical-quantum channel capacity. And the speed of convergence is an…