 | 2008 |
|---|
| 13 |       | Takuya Yoshida,
Koji Okada:
Simple and Efficient Group Signature Scheme Assuming Tamperproof Devices.
IWSEC 2008: 83-99 |
| 2002 |
|---|
| 12 |  | 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 |
|---|
| 11 | | Koji Okada,
Kaoru Kurosawa:
MDS secret-sharing scheme secure against cheaters.
IEEE Transactions on Information Theory 46(3): 1078-1081 (2000) |
| 1998 |
|---|
| 10 | | Kaoru Kurosawa,
Koji Okada,
Hajime Saido,
Douglas R. Stinson:
New Combinatorial Bounds for Authentication Codes and Key Predistribution Schemes.
Des. Codes Cryptography 15(1): 87-100 (1998) |
| 1996 |
|---|
| 9 | | Kaoru Kurosawa,
Koji Okada:
Combinatorial Lower Bounds for Secret Sharing Schemes.
Inf. Process. Lett. 60(6): 301-304 (1996) |
| 1995 |
|---|
| 8 | | Kaoru Kurosawa,
Koji Okada,
Shigeo Tsujii:
Low Exponent Attack Against Elliptic Curve RSA.
Inf. Process. Lett. 53(2): 77-83 (1995) |
| 1994 |
|---|
| 7 | | Koji Okada,
Kaoru Kurosawa:
Lower Bound on the Size of Shares of Nonperfect Secret Sharing Schemes.
ASIACRYPT 1994: 33-41 |
| 6 | | Kaoru Kurosawa,
Koji Okada,
Keiichi Sakano:
Security of the Center in Key Distribution Schemes.
ASIACRYPT 1994: 333-341 |
| 5 | | Kaoru Kurosawa,
Koji Okada,
Shigeo Tsujii:
Low Exponent Attack against Elliptic Curve RSA.
ASIACRYPT 1994: 376-383 |
| 4 | | Kaoru Kurosawa,
Koji Okada:
Combinatorial Interpretation of Secret Sharing Schemes.
ASIACRYPT 1994: 55-64 |
| 1993 |
|---|
| 3 | | Kaoru Kurosawa,
Koji Okada,
Keiichi Sakano,
Wakaha Ogata,
Shigeo Tsujii:
Nonperfect Secret Sharing Schemes and Matroids.
EUROCRYPT 1993: 126-141 |
| 1982 |
|---|
| 2 | | Kokichi Futatsugi,
Koji Okada:
A Hierarchical Structuring Method for Functional Software Systems.
ICSE 1982: 393-402 |
| 1980 |
|---|
| 1 | | Kokichi Futatsugi,
Koji Okada:
Specification Writing as Construction of Hierarchically Structured Clusters of Operators.
IFIP Congress 1980: 287-292 |
