Toshiya Itoh

Toshiya Itoh, Seiji Yoshimoto: Buffer Management of Multi-Queue QoS Switches with Class Segregation. CoRR abs/1304.3172 (2013)

Toshiya Itoh, Seiji Yoshimoto: Greedy Algorithms for Multi-Queue Buffer Management Policies with Class Segregation. CoRR abs/1109.6060 (2011)

Toshiya Itoh, Yasuhiro Suzuki: Improved Constructions for Query-Efficient Locally Decodable Codes of Subexponential Length. IEICE Transactions 93-D(2): 263-270 (2010)

Toshiya Itoh, Osamu Watanabe: Weighted random popular matchings. Random Struct. Algorithms 37(4): 477-494 (2010)

Ryoso Hamane, Toshiya Itoh, Kouhei Tomita: Approximation Preserving Reductions among Item Pricing Problems. IEICE Transactions 92-D(2): 149-157 (2009)

Ryoso Hamane, Toshiya Itoh, Kouhei Tomita: Approximation Algorithms for the Highway Problem under the Coupon Model. IEICE Transactions 92-A(8): 1779-1786 (2009)

Ryoso Hamane, Toshiya Itoh: Improved Approximation Algorithms for Item Pricing with Bounded Degree and Valuation. IEICE Transactions 91-D(2): 187-199 (2008)

Toshiya Itoh, Yasuhiro Suzuki: New Constructions for Query-Efficient Locally Decodable Codes of Subexponential Length. CoRR abs/0810.4576 (2008)

Noga Alon, Toshiya Itoh, Tatsuya Nagatani: On (epsilon, k)-min-wise independent permutations. Random Struct. Algorithms 31(3): 384-389 (2007)

Toshiya Itoh, Osamu Watanabe: Weighted Random Popular Matchings. CoRR abs/0710.5338 (2007)

Ryoso Hamane, Toshiya Itoh, Kouhei Tomita: Approximation Algorithms for the Highway Problem under the Coupon Model. CoRR abs/0712.2629 (2007)

Toshiya Itoh, Noriyuki Takahashi: Competitive Analysis of Multi-Queue Preemptive QoS Algorithms for General Priorities. IEICE Transactions 89-A(5): 1186-1197 (2006)

Ryutaroh Matsumoto, Kaoru Kurosawa, Toshiya Itoh, Toshimitsu Konno, Tomohiko Uyematsu: Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography. IEEE Transactions on Information Theory 52(9): 4251-4256 (2006)

Toshiya Itoh: Improved Lower Bounds for Families of epsilon-Approximate k-Restricted Min-Wise Independent Permutations. Electronic Colloquium on Computational Complexity (ECCC)(017) (2006)

Toshiya Itoh, Takanobu Nagumo: Improved Lower Bounds for Competitive Ratio of Multi-Queue Switches in QoS Networks. IEICE Transactions 88-A(5): 1155-1165 (2005)

Ryutaroh Matsumoto, Kaoru Kurosawa, Toshiya Itoh, Toshimitsu Konno, Tomohiko Uyematsu: Primal-dual distance bounds of linear codes with application to cryptography. CoRR abs/cs/0506087 (2005)

Ryutaroh Matsumoto, Kaoru Kurosawa, Toshiya Itoh, Toshimitsu Konno, Tomohiko Uyematsu: Primal-Dual Distance Bounds of Linear Codes with Application to Cryptography. IACR Cryptology ePrint Archive 2005: 194 (2005)

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

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

Toshiya Itoh, Yoshinori Takei, Jun Tarui: On permutations with limited independence. SODA 2000: 137-146

Mike Burmester, Yvo Desmedt, Toshiya Itoh, Kouichi Sakurai, Hiroki Shizuya: Divertible and Subliminal-Free Zero-Knowledge Proofs for Languages. J. Cryptology 12(3): 197-223 (1999)

Toshiya Itoh, Yuji Ohta, Hiroki Shizuya: A Language-Dependent Cryptographic Primitive. J. Cryptology 10(1): 37-50 (1997)

Toshiya Itoh: Simulating Fair Dice with Biased Coins. Inf. Comput. 126(1): 78-82 (1996)

Toshiya Itoh, Masafumi Hoshi, Shigeo Tsujii: A Low Communication Competitive Interactive Proof System for Promised Quadratic Residuosity. J. Cryptology 9(2): 101-109 (1996)

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

Toshiya Itoh, Yuji Ohta, Hiroki Shizuya: Language Dependent Secure Bit Commitment. CRYPTO 1994: 188-201

Toshiya Itoh, Masafumi Hoshi, Shigeo Tsujii: A Low Communication Competitive Interactive Proof System for Promised Quadratic Residuosity. CRYPTO 1993: 61-72

Kouichi Sakurai, Toshiya Itoh: Subliminal Channels for Signature Transfer and Their Application to Signature Distribution Schemes. AUSCRYPT 1992: 231-243

Kouichi Sakurai, Toshiya Itoh: On Bit Correlations Among Preimages of "Many to One" One-Way Functions. AUSCRYPT 1992: 435-446

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

Toshiya Itoh, Kenji Horikawa: On the Complexity of Composite Numbers. ISAAC 1992: 229-238

Toshiya Itoh: Characterization for a Family of Infinitely Many Irreducible Equally Spaced Polynomials. Inf. Process. Lett. 37(5): 273-277 (1991)

Toshiya Itoh, Kouichi Sakurai: On the Complexity of Constant Round ZKIP of Possession of Knowledge. ASIACRYPT 1991: 331-345

Toshiya Itoh, Kouichi Sakurai, Hiroki Shizuya: Any Language in IP Has a Divertable ZKIP. ASIACRYPT 1991: 382-396

Hiroki Shizuya, Toshiya Itoh, Kouichi Sakurai: On the Complexity of Hyperelliptic Discrete Logarithm Problem. EUROCRYPT 1991: 337-351

Hiroki Shizuya, Kenji Koyama, Toshiya Itoh: Demonstrating Possession without Revealing Factors and its Application. AUSCRYPT 1990: 273-293

S. Shinozaki, Toshiya Itoh, Atsushi Fujioka, Shigeo Tsujii: Provably Secure Key-Updating Schemes in Identity-Based Systems. EUROCRYPT 1990: 16-30

Toshiya Itoh: Characterization for a Family of Infinitely Many Irreducible Equally Spaced Polynominals. SIGAL International Symposium on Algorithms 1990: 181-190

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

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

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