Browse > Article
http://dx.doi.org/10.13089/JKIISC.2002.12.3.95

Extended Interactive Hashing Protocol  

홍도원 (한국전자통신연구원 정보보호연구본부)
장구영 (한국전자통신연구원 정보보호연구본부)
류희수 (한국전자통신연구원 정보보호연구본부)
Publication Information
Journal of the Korea Institute of Information Security & Cryptology / v.12, no.3, 2002 , pp. 95-102 More about this Journal
Abstract
Interactive hashing is a protocol introduced by Naor, Ostrovsk Venkatesan, $Yung^{[1]}$ with t-1 round complexity and $t^2$ - 1 bits communication complexity for given t bits string. In this paper, we propose more efficiently extended interactive hashing protocol with t/m- 1 round complexity and $t^2$/m - m bits communication complexity than NOVY protocol when m is a divisor of t, and prove the security of this.
Keywords
Interactive hashing protocol; Universal hash family;
Citations & Related Records
연도 인용수 순위
  • Reference
1 D. R. Stinson, 'Qn the connections between universal hasing, combinatorial designs and error-correcting codes', Congressus Numerantium 114, pp. y-27, 1996
2 I. Damg$\aa$rd and R. Cramer, 'On monotone function closure of perfect and statistical zero-knowledge', CWI technical report, CS-R9618. May 1996
3 D. R. Stinson, 'Universal hash families and the leftover hash lemma, and appli-cations to cryptography and computing', 2002
4 J. L. Carter and M. N. Wegman, 'Universal classes of hash functions', Journal of Computer and System Sciences 18, pp. 143-154, 1979   DOI   ScienceOn
5 C. Cachin, C. Crepeau, and J. Marcil, 'Oblivious tranfser with a memory-bounded receiver', In Proc. 39th IEEE Symposium in Foundations of Computer Science. pp. 493-502, 1998
6 M. Naor, R. Ostrovsky. R. Venkatesan. and M. Yung, 'Perfect sero-knowledge arguments for NP using any one-way function', Journal of Cryptology, 11(2), pp. 87-108, 1998. Preliminary version presented at CRYPTO '92
7 I. Damg$\aa$rd, 'Interactive hashing can simplify zero-knowledge protocol design without computational assumtions', In Advances in Cryptology - CRYPTO '93, pp. 100-109, 1993
8 R. Ostrovsky, R. Venkatesan, and M. Yung, 'Fair games against an all-powerful adversary', SEQUENCES '91, Positano, 1991
9 Y. Z. Ding, 'Oblivious Transfer in the Bounded Storage Model', In Advances in Cryptology - CRYPTO 2001, pp. 155-170, 2001
10 R. Ostrovsky, R. Venkatesan, and M. Yung, 'Interactive hashing simplifies zero-knowledge protocol design', In Advances in Cryptology - EUROCYRPTO '93. pp. 267-273. 1993