A New Interactive Hashing Theorem

Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO '92), plays an important role in many cryptographic protocols. In particular, it is a major component in all known constructions of statistically- hiding commitment schemes and of zero-knowledge arguments based on g...

Full description

Saved in:
Bibliographic Details
Published inTwenty-Second Annual IEEE Conference on Computational Complexity (CCC'07) pp. 319 - 332
Main Authors Haitner, I., Reingold, O.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2007
Subjects
Online AccessGet full text

Cover

Loading…