Search Results for author: Masahito Hayashi

Found 5 papers, 0 papers with code

Two-Server Oblivious Transfer for Quantum Messages

no code implementations7 Nov 2022 Masahito Hayashi, Seunghoan Song

Oblivious transfer is considered as a cryptographic primitive task for quantum information processing over quantum network.

Vocal Bursts Valence Prediction

Unified Approach to Secret Sharing and Symmetric Private Information Retrieval with Colluding Servers in Quantum Systems

no code implementations29 May 2022 Masahito Hayashi, Seunghoan Song

This paper unifiedly addresses two kinds of key quantum secure tasks, i. e., quantum versions of secret sharing (SS) and symmetric private information retrieval (SPIR) by using multi-target monotone span program (MMSP), which characterizes the classical linear protocols of SS and SPIR.

Information Retrieval Retrieval

On the Capacity of Quantum Private Information Retrieval from MDS-Coded and Colluding Servers

no code implementations28 Jun 2021 Matteo Allaix, Seunghoan Song, Lukas Holzbaur, Tefjol Pllaha, Masahito Hayashi, Camilla Hollanti

A general statement on the converse bound for QPIR with coded and colluding servers is derived showing that the capacities of stabilizer QPIR and dimension-squared QPIR induced from any class of PIR are upper bounded by twice the classical capacity of the respective PIR class.

Information Retrieval Retrieval

Representation matching for delegated quantum computing

no code implementations14 Sep 2020 Yuxiang Yang, Masahito Hayashi

Many quantum computational tasks have inherent symmetries, suggesting a path to enhancing their efficiency and performance.

Quantum Physics

Dual universality of hash functions and its applications to quantum cryptography

no code implementations30 Dec 2010 Toyohiro Tsurumaru, Masahito Hayashi

Then we show that this generalized (and thus broader) class of hash functions is in fact sufficient for the security of quantum cryptography.

Quantum Physics Information Theory Information Theory

Cannot find the paper you are looking for? You can Submit a new open access paper.