activity
20042020
most citedAncilla-Driven Universal Blind Quantum Computation

79 citations · 157 across the 15 of their papers we have counts for

collaborators
Showing cs.CRShow all

5 papers · 1 filter

cs.CR2020

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…

cs.CR2017

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 ->…

cs.CR2017

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…

cs.CR2017★ 3 cited

Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters Based on Message Authentication

Masahito Hayashi, Takeshi Koshiba

For conventional secret sharing, if cheaters can submit possibly forged shares after observing shares of the honest users in the reconstruction phase then they cannot only disturb…

cs.CR2014

Linear Programming Relaxations for Goldreich's Generators over Non-Binary Alphabets

Ryuhei Mori, Takeshi Koshiba, Osamu Watanabe +1

Goldreich suggested candidates of one-way functions and pseudorandom generators included in . It is known that randomly generated Goldreich's generator using …