activity
20052024
most citedPrivate Information Retrieval for Coded Storage

136 citations · 199 across the 19 of their papers we have counts for

collaborators
Showing 2005Show all

5 papers · 1 filter

cs.IT2005

Secure multiplex coding to attain the channel capacity in wiretap channels

Daisuke Kobayashi, Hirosuke Yamamoto, Tomohiro Ogawa

It is known that a message can be transmitted safely against any wiretapper via a noisy channel without a secret key if the coding rate is less than the so-called secrecy capacity…

cs.IT2005

Asymptotically Optimal Tree-based Group Key Management Schemes

Hideyuki Sakai, Hirosuke Yamamoto

In key management schemes that realize secure multicast communications encrypted by group keys on a public network, tree structures are often used to update the group keys efficien…

cs.CR2005

Strongly secure ramp secret sharing schemes for general access structures

Mitsugu Iwamoto, Hirosuke Yamamoto

Ramp secret sharing (SS) schemes can be classified into strong ramp SS schemes and weak ramp SS schemes. The strong ramp SS schemes do not leak out any part of a secret explicitly…

cs.CR2005★ 2 cited

Optimal multiple assignments based on integer programming in secret sharing schemes with general access structures

Mitsugu Iwamoto, Hirosuke Yamamoto, Hirohisa Ogawa

It is known that for any general access structure, a secret sharing scheme (SSS) can be constructed from an (m,m)-threshold scheme by using the so-called cumulative map or from a (…

quant-ph2005★ 54 cited

Quantum Secret Sharing Schemes and Reversibility of Quantum Operations

Tomohiro Ogawa, Akira Sasaki, Mitsugu Iwamoto +1

Quantum secret sharing schemes encrypting a quantum state into a multipartite entangled state are treated. The lower bound on the dimension of each share given by Gottesman [Phys.…