Wataru Kishimoto (Selection)

List of publications from the DBLP Bibliography Server - FAQ

Ask others: ACM DL/Guide -

5 Kaoru Kurosawa, Wataru Kishimoto, Takeshi Koshiba: A Combinatorial Approach to Deriving Lower Bounds for Perfectly Secure Oblivious Transfer Reductions. IEEE Transactions on Information Theory 54(6): 2566-2571 (2008)

3 Wataru Kishimoto, Koji Okada, Kaoru Kurosawa, Wakaha Ogata: On the bound for anonymous secret sharing schemes. Discrete Applied Mathematics 121(1-3): 193-202 (2002)

2 Kaoru Kurosawa, Fumio Sato, Takahiro Sakata, Wataru Kishimoto: A relationship between linear complexity and kapa-error linear complexity. IEEE Transactions on Information Theory 46(2): 694-698 (2000)

1 Yvo Desmedt, Brian King, Wataru Kishimoto, Kaoru Kurosawa: A Comment on the Efficiency of Secret Sharing Scheme over Any Finite Abelian Group. ACISP 1998: 391-402

Selection of 4 from 5 records - Wataru Kishimoto has 10 coauthors

5		Kaoru Kurosawa, Wataru Kishimoto, Takeshi Koshiba: A Combinatorial Approach to Deriving Lower Bounds for Perfectly Secure Oblivious Transfer Reductions. IEEE Transactions on Information Theory 54(6): 2566-2571 (2008)
3		Wataru Kishimoto, Koji Okada, Kaoru Kurosawa, Wakaha Ogata: On the bound for anonymous secret sharing schemes. Discrete Applied Mathematics 121(1-3): 193-202 (2002)
2		Kaoru Kurosawa, Fumio Sato, Takahiro Sakata, Wataru Kishimoto: A relationship between linear complexity and kapa-error linear complexity. IEEE Transactions on Information Theory 46(2): 694-698 (2000)
1		Yvo Desmedt, Brian King, Wataru Kishimoto, Kaoru Kurosawa: A Comment on the Efficiency of Secret Sharing Scheme over Any Finite Abelian Group. ACISP 1998: 391-402