VLDB 2026 Research / reviewers in the wild / expert
Koji Okada
dblp:55/2187
· DBLP profile ↗
11ranked-venue papers
2as first author
0since 2021 · last 2002
0000-0002-4317-8808ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 5 · 1 first-authorTheory of computation · 4 · 1 first-authorSoftware engineering, systems software and programming languages · 2Databases, data management, data science and information retrieval · 2
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
5 papers |
Cryptographic protocols and secure computation · 79% Cryptographic primitives and cryptanalysis · 21% | |
| Theoretical computer science
1 paper |
Coding theory · 100% | |
| Software engineering, system software, and programming languages
2 papers |
Programming languages and type systems · 80% Requirements engineering and software design · 20% |
Topics — the 11 heaviest of 12, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic protocols and secure computation
secret sharing |
0.1 | 3 | 2000 | MDS secret-sharing scheme secure against cheaters · IEEE Trans. Inf. Theory 2000 Lower Bound on the Size of Shares of Nonperfect Secret Sharing Schemes · ASIACRYPT 1994 Combinatorial Interpretation of Secret Sharing Schemes · ASIACRYPT 1994 |
Cryptographic protocols and secure computation › secret sharing
cheating detection |
0.0 | 1 | 2000 | MDS secret-sharing scheme secure against cheaters · IEEE Trans. Inf. Theory 2000 |
Coding theory
error-correcting codes |
0.0 | 1 | 2000 | MDS secret-sharing scheme secure against cheaters · IEEE Trans. Inf. Theory 2000 |
Cryptographic protocols and secure computation › key management
key distribution |
0.0 | 1 | 1994 | Security of the Center in Key Distribution Schemes · ASIACRYPT 1994 |
Cryptographic primitives and cryptanalysis › cryptanalysis
low exponent attack |
0.0 | 1 | 1994 | Low Exponent Attack against Elliptic Curve RSA · ASIACRYPT 1994 |
Cryptographic primitives and cryptanalysis › public-key cryptography
RSA cryptosystem |
0.0 | 1 | 1994 | Low Exponent Attack against Elliptic Curve RSA · ASIACRYPT 1994 |
Cryptographic protocols and secure computation › secret sharing › share size
share size lower bounds |
0.0 | 1 | 1994 | Lower Bound on the Size of Shares of Nonperfect Secret Sharing Schemes · ASIACRYPT 1994 |
Programming languages and type systems
module systems |
0.0 | 1 | 1987 | Parameterized Programming in OBJ2 · ICSE 1987 |
Programming languages and type systems › module systems
parameterized programming |
0.0 | 1 | 1987 | Parameterized Programming in OBJ2 · ICSE 1987 |
Cryptographic primitives and cryptanalysis › public-key cryptography
elliptic curve cryptography |
0.0 | 1 | 1994 | Low Exponent Attack against Elliptic Curve RSA · ASIACRYPT 1994 |
Requirements engineering and software design
software architecture |
0.0 | 1 | 1982 | A Hierarchical Structuring Method for Functional Software Systems · ICSE 1982 |
Methods — techniques the papers use, named apart from their topics
access structure analysis · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2002 | On the bound for anonymous secret sharing schemes
Wataru Kishimoto, Koji Okada, Kaoru Kurosawa, Wakaha Ogata |
Discret. Appl. Math. | 2 |
| 2000 | MDS secret-sharing scheme secure against cheatersabstractFor the problem of cheaters in secret-sharing schemes, we introduce d/sub cheat/ which is more appropriate than the minimum Hamming distance d/sub min/ of the related error-correcting code when it is needed only to recover the correct secret s (i.e., when it is not needed to identity the cheaters in the scheme). We then prove that d/sub min//spl les/d/sub cheat/=n-max/B/spl notin//spl Gamma/|B| where /spl Gamma/ denotes the access structure. Koji Okada, Kaoru Kurosawa |
IEEE Trans. Inf. Theory | 1 |
| 1998 | New Combinatorial Bounds for Authentication Codes and Key Predistribution Schemes
Kaoru Kurosawa, Koji Okada, Hajime Saido, Douglas Robert Stinson |
Des. Codes Cryptogr. | 2 |
| 1996 | Combinatorial Lower Bounds for Secret Sharing Schemes
Kaoru Kurosawa, Koji Okada |
Inf. Process. Lett. | 2 |
| 1995 | Low Exponent Attack Against Elliptic Curve RSA
Kaoru Kurosawa, Koji Okada, Shigeo Tsujii |
Inf. Process. Lett. | 2 |
| 1994 | Combinatorial Interpretation of Secret Sharing Schemes
Kaoru Kurosawa, Koji Okada |
ASIACRYPT | 2 |
| 1994 | Security of the Center in Key Distribution Schemes
Kaoru Kurosawa, Koji Okada, Keiichi Sakano |
ASIACRYPT | 2 |
| 1994 | Low Exponent Attack against Elliptic Curve RSA
Kaoru Kurosawa, Koji Okada, Shigeo Tsujii |
ASIACRYPT | 2 |
| 1994 | Lower Bound on the Size of Shares of Nonperfect Secret Sharing Schemes
Koji Okada, Kaoru Kurosawa |
ASIACRYPT | 1 |
| 1987 | Parameterized Programming in OBJ2
Kokichi Futatsugi, Joseph A. Goguen, José Meseguer 0001, Koji Okada |
ICSE | 4 |
| 1982 | A Hierarchical Structuring Method for Functional Software Systems
Kokichi Futatsugi, Koji Okada |
ICSE | 2 |