The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Toshiya Itoh: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Toshiya Itoh, Kouichi Sakurai
    On the Complexity of Constant Round ZKIP of Possession of Knowledge. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1991, pp:331-345 [Conf]
  2. Toshiya Itoh, Kouichi Sakurai, Hiroki Shizuya
    Any Language in IP Has a Divertable ZKIP. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1991, pp:382-396 [Conf]
  3. Kouichi Sakurai, Toshiya Itoh
    Subliminal Channels for Signature Transfer and Their Application to Signature Distribution Schemes. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1992, pp:231-243 [Conf]
  4. Kouichi Sakurai, Toshiya Itoh
    On Bit Correlations Among Preimages of "Many to One" One-Way Functions. [Citation Graph (0, 0)][DBLP]
    ASIACRYPT, 1992, pp:435-446 [Conf]
  5. Hiroki Shizuya, Kenji Koyama, Toshiya Itoh
    Demonstrating Possession without Revealing Factors and its Application. [Citation Graph (0, 0)][DBLP]
    AUSCRYPT, 1990, pp:273-293 [Conf]
  6. Toshiya Itoh, Masafumi Hoshi, Shigeo Tsujii
    A Low Communication Competitive Interactive Proof System for Promised Quadratic Residuosity. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1993, pp:61-72 [Conf]
  7. Toshiya Itoh, Yuji Ohta, Hiroki Shizuya
    Language Dependent Secure Bit Commitment. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1994, pp:188-201 [Conf]
  8. Kouichi Sakurai, Toshiya Itoh
    On the Discrepancy between Serial and Parallel of Zero-Knowledge Protocols (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1992, pp:246-259 [Conf]
  9. S. Shinozaki, Toshiya Itoh, Atsushi Fujioka, Shigeo Tsujii
    Provably Secure Key-Updating Schemes in Identity-Based Systems. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1990, pp:16-30 [Conf]
  10. Hiroki Shizuya, Toshiya Itoh, Kouichi Sakurai
    On the Complexity of Hyperelliptic Discrete Logarithm Problem. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1991, pp:337-351 [Conf]
  11. Mike Burmester, Yvo Desmedt, Toshiya Itoh, Kouichi Sakurai, Hiroki Shizuya, Moti Yung
    A Progress Report on Subliminal-Free Channels. [Citation Graph (0, 0)][DBLP]
    Information Hiding, 1996, pp:157-168 [Conf]
  12. Toshiya Itoh, Kenji Horikawa
    On the Complexity of Composite Numbers. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:229-238 [Conf]
  13. Jun Tarui, Toshiya Itoh, Yoshinori Takei
    A Nearly Linear Size 4-Min-Wise Independent Permutation Family by Finite Geometries. [Citation Graph (0, 0)][DBLP]
    RANDOM-APPROX, 2003, pp:396-408 [Conf]
  14. Toshiya Itoh
    Characterization for a Family of Infinitely Many Irreducible Equally Spaced Polynominals. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:181-190 [Conf]
  15. Toshiya Itoh, Yoshinori Takei, Jun Tarui
    On permutations with limited independence. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:137-146 [Conf]
  16. Toshiya Itoh, Yoshinori Takei, Jun Tarui
    On the sample size of k-restricted min-wise independent permutations and other k-wise distributions. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:710-719 [Conf]
  17. Toshiya Itoh
    Improved Lower Bounds for Families of epsilon-Approximate k-Restricted Min-Wise Independent Permutations [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2006, v:, n:017, pp:- [Journal]
  18. Toshiya Itoh
    Simulating Fair Dice with Biased Coins. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:126, n:1, pp:78-82 [Journal]
  19. Toshiya Itoh, Shigeo Tsujii
    A Fast Algorithm for Computing Multiplicative Inverses in GF(2^m) Using Normal Bases [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1988, v:78, n:3, pp:171-177 [Journal]
  20. Toshiya Itoh, Shigeo Tsujii
    Structure of Parallel Multipliers for a Class of Fields GF(2^m) [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1989, v:83, n:1, pp:21-40 [Journal]
  21. Toshiya Itoh
    Characterization for a Family of Infinitely Many Irreducible Equally Spaced Polynomials. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:37, n:5, pp:273-277 [Journal]
  22. Toshiya Itoh, Shigeo Tsujii
    An Efficient Algorithm for Deciding Quadratic Residuosity in Finite Fields GF(p_m). [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:30, n:3, pp:111-114 [Journal]
  23. Mike Burmester, Yvo Desmedt, Toshiya Itoh, Kouichi Sakurai, Hiroki Shizuya
    Divertible and Subliminal-Free Zero-Knowledge Proofs for Languages. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1999, v:12, n:3, pp:197-223 [Journal]
  24. Toshiya Itoh, Masafumi Hoshi, Shigeo Tsujii
    A Low Communication Competitive Interactive Proof System for Promised Quadratic Residuosity. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1996, v:9, n:2, pp:101-109 [Journal]
  25. Toshiya Itoh, Yuji Ohta, Hiroki Shizuya
    A Language-Dependent Cryptographic Primitive. [Citation Graph (0, 0)][DBLP]
    J. Cryptology, 1997, v:10, n:1, pp:37-50 [Journal]
  26. Toshiya Itoh, Osamu Watanabe
    Weighted Random Popular Matchings [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  27. Primal-dual distance bounds of linear codes with application to cryptography [Citation Graph (, )][DBLP]


  28. Approximation Algorithms for the Highway Problem under the Coupon Model [Citation Graph (, )][DBLP]


  29. New Constructions for Query-Efficient Locally Decodable Codes of Subexponential Length [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.303secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002