 | 2011 |
|---|
| 7 |       | Wataru Kishimoto:
A Method for Obtaining the Maximum (δ, η)-Balanced Flow in a Network.
INOC 2011: 230-242 |
| 2008 |
|---|
| 6 | | 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) |
| 2007 |
|---|
| 5 | | Kaoru Kurosawa,
Wataru Kishimoto,
Takeshi Koshiba:
How to Derive Lower Bound on Oblivious Transfer Reduction.
IACR Cryptology ePrint Archive 2007: 65 (2007) |
| 2006 |
|---|
| 4 | | Paolo D'Arco,
Wataru Kishimoto,
Douglas R. Stinson:
Properties and constraints of cheating-immune secret sharing schemes.
Discrete Applied Mathematics 154(2): 219-233 (2006) |
| 2002 |
|---|
| 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) |
| 2000 |
|---|
| 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) |
| 1998 |
|---|
| 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 |
Data released under the ODC-BY 1.0 license — See also our legal information page