2026 Tatsuaki Okamoto: Computer Science Researcher – H-Index, Publications & Awards

Discipline name	D-Index	World Ranking	Current World Ranking	National Ranking	Current National Ranking	Publications	Citations
Computer Science	59	3336	3240	28	28	261	23823

Research.com Recognitions

2025 - Research.com Computer Science in Japan Leader Award
2022 - Research.com Computer Science in Japan Leader Award

Overview

Tatsuaki Okamoto is affiliated with NTT in Japan and has contributed to the field of computer science with a focus on cryptography and data security. Their research spans topics such as complexity theory, artificial intelligence, and advanced authentication protocols, reflecting a multidisciplinary approach within computer science.

The primary fields of study for Tatsuaki Okamoto include:

Computer Science

Subfields of study encompass:

Artificial Intelligence
Computational Theory and Mathematics
Information Systems
Pharmacy
Computer Networks and Communications

The main research topics addressed by Okamoto are:

Cryptography and Data Security
Complexity and Algorithms in Graphs
Blockchain Technology Applications and Security
Oral and gingival health research
Advanced Authentication Protocols Security
Cryptographic Implementations and Security
Computability, Logic, AI Algorithms

Recent publications offer insight into Okamoto's research scope and collaborations. Key papers include:

"Efficient Attribute-Based Signatures for Unbounded Arithmetic Branching Programs," 2020, IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
"Standard model leakage-resilient authenticated key exchange using inner-product extractors," 2022, Designs Codes and Cryptography
"A New Quantitative Definition of the Complexity of Organized Matters," 2022, Complexity
"Adaptively Simulation-Secure Attribute-Hiding Predicate Encryption," 2020, IEICE Transactions on Information and Systems
"On the Arrow of Time and Organized Complexity in the Universe," 2023, arXiv (Cornell University)

Frequent co-authors with whom Okamoto has collaborated are:

Pratish Datta
Katsuyuki Takashima
Wei Dai
Go Yamamoto
Janaka Alawatugoda

Okamoto's work has appeared predominantly in venues such as:

NTT Technical Review
IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences
Designs Codes and Cryptography
Complexity
IEICE Transactions on Information and Systems

Best Publications

Reducing elliptic curve logarithms to logarithms in a finite field

A.J. Menezes;T. Okamoto;S.A. Vanstone

2136
Citations
Secure Integration of Asymmetric and Symmetric Encryption Schemes

Eiichiro Fujisaki;Tatsuaki Okamoto

1892
Citations
Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption

Allison Lewko;Tatsuaki Okamoto;Amit Sahai;Katsuyuki Takashima

1645
Citations
A Practical Secret Voting Scheme for Large Scale Elections

Atsushi Fujioka;Tatsuaki Okamoto;Kazuo Ohta

1400
Citations
A new public-key cryptosystem as secure as factoring

Tatsuaki Okamoto;Shigenori Uchiyama

972
Citations
Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes

Tatsuaki Okamoto

892
Citations
Statistical Zero-Knowledge Protocols to Prove Modular Polynomial Relations

Eiichiro Fujisaki;Tatsuaki Okamoto

727
Citations
Advances in Cryptology - ASIACRYPT 2000

Tatsuaki Okamoto

693
Citations
Universal Electronic Cash

Tatsuaki Okamoto;Kazuo Ohta

662
Citations
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes

Tatsuaki Okamoto;David Pointcheval

635
Citations
Fully secure functional encryption with general relations from the decisional linear assumption

Tatsuaki Okamoto;Katsuyuki Takashima

633
Citations
Receipt-free electronic voting schemes for large scale elections

T. Okamoto

496
Citations
How to Enhance the Security of Public-Key Encryption at Minimum Cost

Eiichiro Fujisaki;Tatsuaki Okamoto

466
Citations
Provably Secure Partially Blind Signatures

Masayuki Abe;Tatsuaki Okamoto

401
Citations
Reducing elliptic curve logarithms to logarithms in a finite field

Alfred Menezes;Scott Vanstone;Tatsuaki Okamoto

390
Citations
Hierarchical Predicate Encryption for Inner-Products

Tatsuaki Okamoto;Katsuyuki Takashima

382
Citations
RSA-OAEP Is Secure under the RSA Assumption

Eiichiro Fujisaki;Tatsuaki Okamoto;David Pointcheval;Jacques Stern

370
Citations
REACT: Rapid Enhanced-Security Asymmetric Cryptosystem Transform

Tatsuaki Okamoto;David Pointcheval

352
Citations
An Efficient Divisible Electronic Cash Scheme

Tatsuaki Okamoto

334
Citations
New Public-Key Schemes Based on Elliptic Curves over the Ring Zn

Kenji Koyama;Ueli M. Maurer;Tatsuaki Okamoto;Scott A. Vanstone

308
Citations

Frequent Co-Authors

Kazuo Ohta University of Electro-Communications

Masayuki Abe Kyoto University

David Pointcheval École Normale Supérieure

Jacques Stern École Normale Supérieure

Brent Waters The University of Texas at Austin

Eike Kiltz Ruhr University Bochum

Tsuyoshi Takagi University of Tokyo

Kouichi Sakurai Kyushu University

Amit Sahai University of California, Los Angeles

Daniel Wichs Northeastern University

External Links

Personal website of Tatsuaki Okamoto Google Scholar page

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Considering a future in technology? The flexibility of virtual learning offers a variety of options for those eager to begin or advance their journey in computer science—and in related fields. For students looking to take the first step, an online associate's degree in computer science allows you to gain foundational knowledge before pursuing a bachelor’s or entering the workforce.

Affordability is a common concern. If budget is a priority, it’s worth exploring the most affordable online colleges for computer science and related majors. Many accredited schools offer high-quality programs at accessible prices.

Not everyone has a perfect academic record. Students with lower GPAs might worry about access, but there are online graduate programs that accept 2.0 gpa, offering second chances for ambitious learners seeking to advance their careers.

Finally, your career prospects are diverse. Computer science provides pathways in IT, software engineering, and beyond—but interdisciplinary knowledge is valuable, too. For example, see what can you do with an environmental studies degree to discover emerging tech-driven roles in sustainability and environmental protection.