Public Key Cryptosystem using a reciprocal number with the same Intractability as Factoring a Large number. - Kaoru Kurosawa; Toshiya Itoh; Masashi Takeuchi (Cryptologia, 1988)

A public-key cryptosystem based on the difficulty of solving a system of nonlinear equations. - Shigeo Tsujii; Toshiya Itoh; Atsushi Fujioka; Kaoru Kurosawa; Tsutomu Matsumoto (Syst. Comput. Jpn., 1988)

A Fast Algorithm for Computing Multiplicative Inverses in GF(2^m) Using Normal Bases - Toshiya Itoh; Shigeo Tsujii (Inf. Comput., 1988)

An Efficient Algorithm for Deciding Quadratic Residuosity in Finite Fields GF(p_m). - Toshiya Itoh; Shigeo Tsujii (Inf. Process. Lett., 1989)

An ID-based cryptosystem based on the discrete logarithm problem. - Shigeo Tsujii; Toshiya Itoh (IEEE J. Sel. Areas Commun., 1989)

Structure of Parallel Multipliers for a Class of Fields GF(2^m) - Toshiya Itoh; Shigeo Tsujii (Inf. Comput., 1989)

Demonstrating Possession without Revealing Factors and its Application. - Hiroki Shizuya; Kenji Koyama; Toshiya Itoh (AUSCRYPT, 1990)

Characterization for a Family of Infinitely Many Irreducible Equally Spaced Polynominals. - Toshiya Itoh (SIGAL International Symposium on Algorithms, 1990)

On the Complexity of Constant Round ZKIP of Possession of Knowledge. - Toshiya Itoh; Kouichi Sakurai (ASIACRYPT, 1991)

Any Language in IP Has a Divertable ZKIP. - Toshiya Itoh; Kouichi Sakurai; Hiroki Shizuya (ASIACRYPT, 1991)

On the Complexity of Hyperelliptic Discrete Logarithm Problem. - Hiroki Shizuya; Toshiya Itoh; Kouichi Sakurai (EUROCRYPT, 1991)

Characterization for a Family of Infinitely Many Irreducible Equally Spaced Polynomials. - Toshiya Itoh (Inf. Process. Lett., 1991)

Provably Secure Key-Updating Schemes in Identity-Based Systems. - Shinji Shinozaki; Atsushi Fujioka; Shigeo Tsujii; Toshiya Itoh (J. Circuits Syst. Comput., 1991)

Subliminal Channels for Signature Transfer and Their Application to Signature Distribution Schemes. - Kouichi Sakurai; Toshiya Itoh (AUSCRYPT, 1992)

On Bit Correlations Among Preimages of "Many to One" One-Way Functions. - Kouichi Sakurai; Toshiya Itoh (AUSCRYPT, 1992)

On the Discrepancy between Serial and Parallel of Zero-Knowledge Protocols (Extended Abstract). - Kouichi Sakurai; Toshiya Itoh (CRYPTO, 1992)

On the Complexity of Composite Numbers. - Toshiya Itoh; Kenji Horikawa (ISAAC, 1992)

Language Dependent Secure Bit Commitment. - Toshiya Itoh; Yuji Ohta; Hiroki Shizuya (CRYPTO, 1994)

A Progress Report on Subliminal-Free Channels. - Mike Burmester; Yvo Desmedt; Toshiya Itoh; Kouichi Sakurai; Hiroki Shizuya; Moti Yung (Information Hiding, 1996)

Simulating Fair Dice with Biased Coins. - Toshiya Itoh (Inf. Comput., 1996)

A Low Communication Competitive Interactive Proof System for Promised Quadratic Residuosity. - Toshiya Itoh; Masafumi Hoshi; Shigeo Tsujii (J. Cryptol., 1996)

A Language-Dependent Cryptographic Primitive. - Toshiya Itoh; Yuji Ohta; Hiroki Shizuya (J. Cryptol., 1997)

Divertible and Subliminal-Free Zero-Knowledge Proofs for Languages. - Mike Burmester; Yvo Desmedt; Toshiya Itoh; Kouichi Sakurai; Hiroki Shizuya (J. Cryptol., 1999)

On permutations with limited independence. - Toshiya Itoh; Yoshinori Takei; Jun Tarui (SODA, 2000)

Min-Wise Independence vs. 3-Wise Independence. - Toshiya Itoh (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002)

A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries. - Jun Tarui; Toshiya Itoh; Yoshinori Takei (RANDOM-APPROX, 2003)

On the sample size of k-restricted min-wise independent permutations and other k-wise distributions. - Toshiya Itoh; Yoshinori Takei; Jun Tarui (STOC, 2003)

A Note on the Relationships among Certified Discrete Log Cryptosystems. - Eikoh Chida; Toshiya Itoh; Hiroki Shizuya (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003)

Improved Lower Bounds for Competitive Ratio of Multi-Queue Switches in QoS Networks. - Toshiya Itoh; Takanobu Nagumo (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005)

Improved Lower Bounds for Families of epsilon-Approximate k-Restricted Min-Wise Independent Permutations - Toshiya Itoh (Electron. Colloquium Comput. Complex., 2006)

Competitive Analysis of Multi-Queue Preemptive QoS Algorithms for General Priorities. - Toshiya Itoh; Noriyuki Takahashi (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006)

Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography. - Ryutaroh Matsumoto; Kaoru Kurosawa; Toshiya Itoh; Toshimitsu Konno; Tomohiko Uyematsu (IEEE Trans. Inf. Theory, 2006)

On (epsilon, k)-min-wise independent permutations. - Noga Alon; Toshiya Itoh; Tatsuya Nagatani (Random Struct. Algorithms, 2007)

New Constructions for Query-Efficient Locally Decodable Codes of Subexponential Length - Toshiya Itoh; Yasuhiro Suzuki (CoRR, 2008)

Improved Approximation Algorithms for Item Pricing with Bounded Degree and Valuation. - Ryoso Hamane; Toshiya Itoh (IEICE Trans. Inf. Syst., 2008)

Approximation Preserving Reductions among Item Pricing Problems. - Ryoso Hamane; Toshiya Itoh; Kouhei Tomita (IEICE Trans. Inf. Syst., 2009)

Approximation Algorithms for the Highway Problem under the Coupon Model. - Ryoso Hamane; Toshiya Itoh; Kouhei Tomita (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009)

Improved Constructions for Query-Efficient Locally Decodable Codes of Subexponential Length. - Toshiya Itoh; Yasuhiro Suzuki (IEICE Trans. Inf. Syst., 2010)

Weighted random popular matchings. - Toshiya Itoh; Osamu Watanabe 001 (Random Struct. Algorithms, 2010)

Greedy Algorithms for Multi-Queue Buffer Management Policies with Class Segregation - Toshiya Itoh; Seiji Yoshimoto (CoRR, 2011)

Buffer management of multi-queue QoS switches with class segregation. - Toshiya Itoh; Seiji Yoshimoto (Theor. Comput. Sci., 2015)

Closed Formulas of the Arithmetic Mean Component Competitive Ratio for the 3-Objective and 4-Objective Time Series Search Problems. - Toshiya Itoh; Yoshinori Takei (CoRR, 2017)

On Aggregating Two Metrics with Relaxed Triangle Inequalities by the Weighted Harmonic Mean. - Toshiya Itoh; Yoshinori Takei (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

Optimal online algorithms for the multi-objective time series search problem. - Shun Hasegawa; Toshiya Itoh (Theor. Comput. Sci., 2018)

AND Protocols Using only Uniform Shuffles. - Suthee Ruangwises; Toshiya Itoh (CSR, 2019)

Stable Noncrossing Matchings. - Suthee Ruangwises; Toshiya Itoh (IWOCA, 2019)

Securely Computing the n-Variable Equality Function with 2n Cards. - Suthee Ruangwises; Toshiya Itoh (CoRR, 2019)

On the Competitive Analysis for the Multi-Objective Time Series Search Problem. - Toshiya Itoh; Yoshinori Takei (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019)

Random Popular Matchings with Incomplete Preference Lists. - Suthee Ruangwises; Toshiya Itoh (J. Graph Algorithms Appl., 2019)

Physical Zero-Knowledge Proof for Connected Spanning Subgraph Problem and Bridges Puzzle. - Suthee Ruangwises; Toshiya Itoh (CoRR, 2020)

Physical Zero-Knowledge Proof for Numberlink. - Suthee Ruangwises; Toshiya Itoh (FUN, 2021)

Physical ZKP for Connected Spanning Subgraph: Applications to Bridges Puzzle and Other Problems. - Suthee Ruangwises; Toshiya Itoh (UCNC, 2021)

Competitive analysis for two variants of online metric matching problem. - Toshiya Itoh; Shuichi Miyazaki; Makoto Satake (Discret. Math. Algorithms Appl., 2021)

Unpopularity Factor in the Marriage and Roommates Problems. - Suthee Ruangwises; Toshiya Itoh (Theory Comput. Syst., 2021)

Physical Zero-Knowledge Proof for Numberlink Puzzle and k Vertex-Disjoint Paths Problem. - Suthee Ruangwises; Toshiya Itoh (New Gener. Comput., 2021)

Securely computing the n-variable equality function with 2n cards. - Suthee Ruangwises; Toshiya Itoh (Theor. Comput. Sci., 2021)

Physical zero-knowledge proof for Ripple Effect. - Suthee Ruangwises; Toshiya Itoh (Theor. Comput. Sci., 2021)

How to Physically Verify a Rectangle in a Grid: A Physical ZKP for Shikaku. - Suthee Ruangwises; Toshiya Itoh (FUN, 2022)

Characterization of the Imbalance Problem on Complete Bipartite Graphs. - Steven Ge; Toshiya Itoh (TAMC, 2022)

Physical ZKP for Makaro Using a Standard Deck of Cards. - Suthee Ruangwises; Toshiya Itoh (TAMC, 2022)

Online Facility Assignment for General Layout of Servers on a Line. - Tsubasa Harada; Toshiya Itoh (COCOA (2), 2023)

Competitive Analysis of Online Facility Assignment for General Layout of Servers on a Line. - Tsubasa Harada; Toshiya Itoh (CoRR, 2023)

Capacity-insensitive algorithms for online facility assignment problems on a line. - Tsubasa Harada; Toshiya Itoh; Shuichi Miyazaki (Discret. Math. Algorithms Appl., 2024)

A Nearly Optimal Deterministic Algorithm for Online Transportation Problem. - Tsubasa Harada; Toshiya Itoh (ICALP, 2025)

Popularity on the 3D-Euclidean Stable Roommates. - Steven Ge; Toshiya Itoh (WALCOM, 2025)

Popularity on the roommate diversity problem. - Steven Ge; Toshiya Itoh (Theor. Comput. Sci., 2025)