79 citations · 157 across the 15 of their papers we have counts for
17 papers
Guesswork of a quantum ensemble
Michele Dall'Arno, Francesco Buscemi, Takeshi Koshiba
The guesswork of a quantum ensemble quantifies the minimum number of guesses needed in average to correctly guess the state of the ensemble, when only one state can be queried at a…
Perfectly Secure Message Transmission against Rational Adversaries
Maiki Fujita, Takeshi Koshiba, Kenji Yasunaga
Secure Message Transmission (SMT) is a two-party cryptographic protocol by which the sender can securely and reliably transmit messages to the receiver using multiple channels. An…
Verifiable Quantum Secure Modulo Summation
Masahito Hayashi, Takeshi Koshiba
We propose a new cryptographic task, which we call verifiable quantum secure modulo summation. Secure modulo summation is a calculation of modulo summation when $…
Fourier-based Function Secret Sharing with General Access Structure
Takeshi Koshiba
Function secret sharing (FSS) scheme is a mechanism that calculates a function f(x) for x in {0,1}^n which is shared among p parties, by using distributed functions f_i:{0,1}^n ->…
Arbitrable Blind Quantum Computation
Go Sato, Takeshi Koshiba, Tomoyuki Morimae
Blind quantum computation is a two-party protocol which involves a server Bob who has rich quantum computational resource and provides quantum computation service and a client Alic…
Non-Malleable Codes Against Affine Errors
Ryota Iwamoto, Takeshi Koshiba
Non-malleable code is a relaxed version of error-correction codes and the decoding of modified codewords results in the original message or a completely unrelated value. Thus, if a…