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

Kota Isayama

dblp:392/2937 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
0009-0007-1684-5568ORCID · corroborated

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

Security and privacy · 2 · 1 first-author · 2 since 2021

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%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation
secure multiparty computation
0.812024
Secure Parallel Computation with Oblivious State Transitions · CCS 2024
Parallel and multicore computing
parallel computing
0.212024
Secure Parallel Computation with Oblivious State Transitions · CCS 2024

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

oblivious state transitions · 1.5
YearPublicationVenuePosition
2025 Oblivious Suffix Sorting: A Multi-Party Computation Scheme for Secure and Efficient Suffix Sorting
Kota Isayama, Koki Jimbo, Naohiro Okamoto, Kunihiko Sadakane, Kazunari Tozawa
ACNS (1)1
2024 Secure Parallel Computation with Oblivious State Transitions
abstract
We introduce Oblivious Parallel Stateful Computation (OPSC), a form of secure multi-party computation (MPC) tailored for stateful machine computation models emphasizing parallel execution across multiple data. OPSC enables parties to compute multiple results simultaneously in a parallel fashion, leveraging all data from current states and auxiliary inputs dynamically entered at that point. With its parallel and dynamic nature, OPSC holds promise for privacy-preserving applications in intricate decision-making scenarios involving multiple agents, such as traffic analyses, individual consumer behavior economics, and epidemiological simulations.
Nuttapong Attrapadung, Kota Isayama, Kunihiko Sadakane, Kazunari Tozawa
CCS2