Toshiya Itoh

2008
34	EE	Toshiya Itoh, Yasuhiro Suzuki: New Constructions for Query-Efficient Locally Decodable Codes of Subexponential Length CoRR abs/0810.4576: (2008)
33	EE	Ryoso Hamane, Toshiya Itoh: Improved Approximation Algorithms for Item Pricing with Bounded Degree and Valuation. IEICE Transactions 91-D(2): 187-199 (2008)
2007
32	EE	Toshiya Itoh, Osamu Watanabe: Weighted Random Popular Matchings CoRR abs/0710.5338: (2007)
31	EE	Ryoso Hamane, Toshiya Itoh, Kouhei Tomita: Approximation Algorithms for the Highway Problem under the Coupon Model CoRR abs/0712.2629: (2007)
30	EE	Noga Alon, Toshiya Itoh, Tatsuya Nagatani: On (epsilon, k)-min-wise independent permutations. Random Struct. Algorithms 31(3): 384-389 (2007)
2006
29	EE	Toshiya Itoh: Improved Lower Bounds for Families of epsilon-Approximate k-Restricted Min-Wise Independent Permutations Electronic Colloquium on Computational Complexity (ECCC)(017): (2006)
28	EE	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)
27	EE	Toshiya Itoh, Noriyuki Takahashi: Competitive Analysis of Multi-Queue Preemptive QoS Algorithms for General Priorities. IEICE Transactions 89-A(5): 1186-1197 (2006)
2005
26	EE	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)
25	EE	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)
2003
24	EE	Jun Tarui, Toshiya Itoh, Yoshinori Takei: A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries. RANDOM-APPROX 2003: 396-408
23	EE	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
2000
22	EE	Toshiya Itoh, Yoshinori Takei, Jun Tarui: On permutations with limited independence. SODA 2000: 137-146
1999
21	EE	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)
1997
20		Toshiya Itoh, Yuji Ohta, Hiroki Shizuya: A Language-Dependent Cryptographic Primitive. J. Cryptology 10(1): 37-50 (1997)
1996
19		Mike Burmester, Yvo Desmedt, Toshiya Itoh, Kouichi Sakurai, Hiroki Shizuya, Moti Yung: A Progress Report on Subliminal-Free Channels. Information Hiding 1996: 157-168
18		Toshiya Itoh: Simulating Fair Dice with Biased Coins. Inf. Comput. 126(1): 78-82 (1996)
17		Toshiya Itoh, Masafumi Hoshi, Shigeo Tsujii: A Low Communication Competitive Interactive Proof System for Promised Quadratic Residuosity. J. Cryptology 9(2): 101-109 (1996)
1994
16	EE	Toshiya Itoh, Yuji Ohta, Hiroki Shizuya: Language Dependent Secure Bit Commitment. CRYPTO 1994: 188-201
1993
15	EE	Toshiya Itoh, Masafumi Hoshi, Shigeo Tsujii: A Low Communication Competitive Interactive Proof System for Promised Quadratic Residuosity. CRYPTO 1993: 61-72
1992
14		Kouichi Sakurai, Toshiya Itoh: Subliminal Channels for Signature Transfer and Their Application to Signature Distribution Schemes. AUSCRYPT 1992: 231-243
13		Kouichi Sakurai, Toshiya Itoh: On Bit Correlations Among Preimages of "Many to One" One-Way Functions. AUSCRYPT 1992: 435-446
12	EE	Kouichi Sakurai, Toshiya Itoh: On the Discrepancy between Serial and Parallel of Zero-Knowledge Protocols (Extended Abstract). CRYPTO 1992: 246-259
11		Toshiya Itoh, Kenji Horikawa: On the Complexity of Composite Numbers. ISAAC 1992: 229-238
1991
10		Toshiya Itoh, Kouichi Sakurai: On the Complexity of Constant Round ZKIP of Possession of Knowledge. ASIACRYPT 1991: 331-345
9		Toshiya Itoh, Kouichi Sakurai, Hiroki Shizuya: Any Language in IP Has a Divertable ZKIP. ASIACRYPT 1991: 382-396
8	EE	Hiroki Shizuya, Toshiya Itoh, Kouichi Sakurai: On the Complexity of Hyperelliptic Discrete Logarithm Problem. EUROCRYPT 1991: 337-351
7		Toshiya Itoh: Characterization for a Family of Infinitely Many Irreducible Equally Spaced Polynomials. Inf. Process. Lett. 37(5): 273-277 (1991)
1990
6		Hiroki Shizuya, Kenji Koyama, Toshiya Itoh: Demonstrating Possession without Revealing Factors and its Application. AUSCRYPT 1990: 273-293
5	EE	S. Shinozaki, Toshiya Itoh, Atsushi Fujioka, Shigeo Tsujii: Provably Secure Key-Updating Schemes in Identity-Based Systems. EUROCRYPT 1990: 16-30
4		Toshiya Itoh: Characterization for a Family of Infinitely Many Irreducible Equally Spaced Polynominals. SIGAL International Symposium on Algorithms 1990: 181-190
1989
3		Toshiya Itoh, Shigeo Tsujii: Structure of Parallel Multipliers for a Class of Fields GF(2^m) Inf. Comput. 83(1): 21-40 (1989)
2		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)
1988
1		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)

Coauthor Index

1	Noga Alon	[30]
2	Mike Burmester	[19] [21]
3	Yvo Desmedt	[19] [21]
4	Atsushi Fujioka	[5]
5	Ryoso Hamane	[31] [33]
6	Kenji Horikawa	[11]
7	Masafumi Hoshi	[15] [17]
8	Toshimitsu Konno	[26] [28]
9	Kenji Koyama	[6]
10	Kaoru Kurosawa	[26] [28]
11	Ryutaroh Matsumoto	[26] [28]
12	Tatsuya Nagatani	[30]
13	Takanobu Nagumo	[25]
14	Yuji Ohta	[16] [20]
15	Kouichi Sakurai	[8] [9] [10] [12] [13] [14] [19] [21]
16	S. Shinozaki	[5]
17	Hiroki Shizuya	[6] [8] [9] [16] [19] [20] [21]
18	Yasuhiro Suzuki	[34]
19	Noriyuki Takahashi	[27]
20	Yoshinori Takei	[22] [23] [24]
21	Jun Tarui	[22] [23] [24]
22	Kouhei Tomita	[31]
23	Shigeo Tsujii	[1] [2] [3] [5] [15] [17]
24	Tomohiko Uyematsu	[26] [28]
25	Osamu Watanabe	[32]
26	Moti Yung (Mordechai M. Yung)	[19]

Colors in the list of coauthors