A New Interactive Hashing Theorem

2007 ◽  
Author(s):  
Iftach Haitner ◽  
Omer Reingold
Keyword(s):  
Interactive Hashing

scholarly journals Hashing Functions can Simplify Zero-Knowledge Protocol Design (too)

1994 ◽  
Vol 1 (39) ◽  
Author(s):  
Ivan B. Damgård ◽  
Oded Goldreich ◽  
Avi Wigderson
Keyword(s):  
Protocol Design ◽  
Zero Knowledge ◽  
Round Complexity ◽  
Large Round ◽  
Interactive Hashing

In <em>Crypto93</em>, Damgård showed that any constant-round protocol in which the verifier sends only independent, random bits and which is zero-knowledge against the <em>honest</em> verifier can be transformed into a protocol (for the same problem) that is zero-knowledge <em>in general</em>. His transformation was based on the interactive hashing technique of Naor, Ostrovsky, Venkatesan and Yung, and thus the resulting protocol had very large round-complexity.

Information-Theoretic Interactive Hashing and Oblivious Transfer to a Storage-Bounded Receiver

2015 ◽  
Vol 61 (10) ◽  
pp. 5623-5635 ◽  
Author(s):  
Christian Cachin ◽  
Claude Crepeau ◽  
Julien Marcil ◽  
George Savvides
Keyword(s):  
Oblivious Transfer ◽  
Information Theoretic ◽  
Interactive Hashing

A New Interactive Hashing Theorem

2013 ◽  
Vol 27 (1) ◽  
pp. 109-138 ◽  
Author(s):  
Iftach Haitner ◽  
Omer Reingold
Keyword(s):  
Interactive Hashing
Sign in / Sign up

Export Citation Format

Share Document