default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKoji Okada
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c14]Koji Sekiguchi, Koji Okada:
Applying Business Ecosystem Analysis Methods into Edge Computing Device Business for E-Solutions. IIAI-AAI-Winter 2021: 373-384- 2020
- [c13]Shu Kawanami, Ken Hidema, Koji Okada:
Proposal of a Method Extracting Strategic Phrases from Japanese Enterprise Disclosure Documents. IIAI-AAI 2020: 506-511
2010 – 2019
- 2018
- [c12]Koji Okada, Hayato Nishizono, Kosuke Tsubouchi, Tatsuya Hirukawa:
Proposal of a Method to Understand and Model Dynamic Mechanisms Existing in Business Context. IIAI-AAI 2018: 781-786 - 2017
- [c11]Ayaka Oshima, Koji Okada:
Estimation of Risk Countermeasure Effects Based Upon Project-Behavior Simulation System. IIAI-AAI 2017: 307-312 - 2011
- [c10]Ryotaro Hayashi, Tatsuyuki Matsushita, Takuya Yoshida, Yoshihiro Fujii, Koji Okada:
Unforgeability of Re-Encryption Keys against Collusion Attack in Proxy Re-Encryption. IWSEC 2011: 210-229
2000 – 2009
- 2008
- [c9]Takuya Yoshida, Koji Okada:
Simple and Efficient Group Signature Scheme Assuming Tamperproof Devices. IWSEC 2008: 83-99 - 2002
- [j5]Wataru Kishimoto, Koji Okada, Kaoru Kurosawa, Wakaha Ogata
:
On the bound for anonymous secret sharing schemes. Discret. Appl. Math. 121(1-3): 193-202 (2002) - 2000
- [j4]Koji Okada, Kaoru Kurosawa:
MDS secret-sharing scheme secure against cheaters. IEEE Trans. Inf. Theory 46(3): 1078-1081 (2000)
1990 – 1999
- 1998
- [j3]Kaoru Kurosawa, Koji Okada, Hajime Saido, Douglas R. Stinson:
New Combinatorial Bounds for Authentication Codes and Key Predistribution Schemes. Des. Codes Cryptogr. 15(1): 87-100 (1998) - 1996
- [j2]Kaoru Kurosawa, Koji Okada:
Combinatorial Lower Bounds for Secret Sharing Schemes. Inf. Process. Lett. 60(6): 301-304 (1996) - 1995
- [j1]Kaoru Kurosawa, Koji Okada, Shigeo Tsujii:
Low Exponent Attack Against Elliptic Curve RSA. Inf. Process. Lett. 53(2): 77-83 (1995) - 1994
- [c8]Koji Okada, Kaoru Kurosawa:
Lower Bound on the Size of Shares of Nonperfect Secret Sharing Schemes. ASIACRYPT 1994: 33-41 - [c7]Kaoru Kurosawa, Koji Okada:
Combinatorial Interpretation of Secret Sharing Schemes. ASIACRYPT 1994: 55-64 - [c6]Kaoru Kurosawa, Koji Okada, Keiichi Sakano:
Security of the Center in Key Distribution Schemes. ASIACRYPT 1994: 333-341 - [c5]Kaoru Kurosawa, Koji Okada, Shigeo Tsujii:
Low Exponent Attack against Elliptic Curve RSA. ASIACRYPT 1994: 376-383 - 1993
- [c4]Kaoru Kurosawa, Koji Okada, Keiichi Sakano, Wakaha Ogata, Shigeo Tsujii:
Nonperfect Secret Sharing Schemes and Matroids. EUROCRYPT 1993: 126-141
1980 – 1989
- 1987
- [c3]Kokichi Futatsugi, Joseph A. Goguen, José Meseguer, Koji Okada:
Parameterized Programming in OBJ2. ICSE 1987: 51-60 - 1982
- [c2]Kokichi Futatsugi, Koji Okada:
A Hierarchical Structuring Method for Functional Software Systems. ICSE 1982: 393-402 - 1980
- [c1]Kokichi Futatsugi, Koji Okada:
Specification Writing as Construction of Hierarchically Structured Clusters of Operators. IFIP Congress 1980: 287-292
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-27 21:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
