A Comment on the Efficiency of Secret Sharing Scheme over Any Finite Abelian Group. - Yvo Desmedt; Brian King; Wataru Kishimoto; Kaoru Kurosawa (ACISP, 1998)

A relationship between linear complexity and kapa-error linear complexity. - Kaoru Kurosawa; Fumio Sato; Takahiro Sakata; Wataru Kishimoto (IEEE Trans. Inf. Theory, 2000)

On the bound for anonymous secret sharing schemes. - Wataru Kishimoto; Koji Okada; Kaoru Kurosawa; Wakaha Ogata (Discret. Appl. Math., 2002)

Properties and constraints of cheating-immune secret sharing schemes. - Paolo D'Arco; Wataru Kishimoto; Douglas R. Stinson (Discret. Appl. Math., 2006)

How to Derive Lower Bound on Oblivious Transfer Reduction. - Kaoru Kurosawa; Wataru Kishimoto; Takeshi Koshiba (IACR Cryptol. ePrint Arch., 2007)

A Combinatorial Approach to Deriving Lower Bounds for Perfectly Secure Oblivious Transfer Reductions. - Kaoru Kurosawa; Wataru Kishimoto; Takeshi Koshiba (IEEE Trans. Inf. Theory, 2008)

A Method for Obtaining the Maximum (δ, η)-Balanced Flow in a Network. - Wataru Kishimoto (INOC, 2011)

An Extension of a Balanced Flow in a Network. - Wataru Kishimoto (Electron. Notes Discret. Math., 2013)

Dressi: A Hardware-Agnostic Differentiable Renderer with Reactive Shader Packing and Soft Rasterization. - Yusuke Takimoto; Hiroyuki Sato; Hikari Takehara; Keishiro Uragaki; Takehiro Tawara; Xiao Liang; Kentaro Oku; Wataru Kishimoto; Bo Zheng (Comput. Graph. Forum, 2022)