Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from SIGIR 2026 / reviewers in the wild / expert

Kiyomiche Araki

dblp:66/6664 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1993
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1

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
1 paper
Cryptographic protocols and secure computation · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › key management
key sharing		 0.011993
A Simple ID-Based Scheme for Key Sharing · IEEE J. Sel. Areas Commun. 1993
Cryptographic protocols and secure computation › key management
key distribution		 0.011993
A Simple ID-Based Scheme for Key Sharing · IEEE J. Sel. Areas Commun. 1993

Methods — techniques the papers use, named apart from their topics

iterative elimination of additive random numbers · 0.0
YearPublicationVenuePosition
1993 A Simple ID-Based Scheme for Key Sharing
abstract
A noninteractive ID-based key sharing scheme based on a method of iterative elimination of additive random numbers is proposed. With this method, a common key is generated step by step, leaving no opportunity for conspiracy attacks. The integrity of the scheme is discussed, and a method for improving computational efficiency is proposed.>
Shigeo Tsujii, Jinhui Chao, Kiyomiche Araki
 IEEE J. Sel. Areas Commun.3