A new interactive hashing theorem

Proceedings of the Annual IEEE Conference on Computational Complexity

Volumn , Issue , 2007, Pages 319-332

  Haitner, Iftach ^a   Reingold, Omer ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTATIONAL METHODS; SIGNAL RECEIVERS; STATISTICAL METHODS; THEOREM PROVING;

CRYPTOGRAPHIC PROTOCOLS; GENERALIZATION; HASHING THEOREM; INTERACTIVE HASHING;

CRYPTOGRAPHY;

EID: 34748815778     PISSN: 10930159     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CCC.2007.3     Document Type: Conference Paper

References (18)

1. G. Brassard, D. Chaum, and C. Crépeau. Minimum disclosure proofs of knowledge. J. Computer and System Sciences, 37(2).
2. C. Cachin, C. Crépeau, and J. Marcil. Oblivious transfer with a memory-bound receiver.
3. I. Carter and M. Wegman. Universal classes of hash functions. In 9th STOC.
4. C. Crpeau and G. Savvides. Optimal reductions between oblivious transfers using interactive hashing. In Eurocrypt '06, LNCS, 2006.
5. Y. Ding, D. Harnik, R. Shaltiel, and A. Rosen. Constant round oblivious transfer in the bounded storage model. In 1st TCC, 2004.
6. O. Goldreich. Randomized methods in computation - lecture notes. 2001.
7. I. Haitner, O. Horvitz, J. Katz, C. Koo, R. Morselli, and R. Shaltiel. Reducing complexity assumptions for statistically-hiding commitment. In EUROCRYPT.
8. I. Haitner and O. Reingold. Statistically-hiding commitment from any one-way function. ePrint, Report 2006/436, 2006.
9. A. Herzberg and M. Luby. Pubic randomness in cryptography.
10. T. Koshiba and Y. Seri. Round-efficient one-way permutation based perfectly concealing bit commitment scheme. ECCC, TR06-093, 2006.
11. Y. Lindell. Parallel coin-tossing and constant-round secure two-party computation. JCRYPTOLOGY, 16(3).
12. M. Naor, R. Ostrovsky, R. Venkatesan, and M. Yung. Perfect zero-knowledge arguments for NP using any one-way permutation. JCRYPTOLOGY, 11(2).
13. M. Nguyen, S. Ong, and S. Vadhan. Statistical zero-knowledge arguments for NP from any one-way function. In 39th FOCS, 2006.
14. M. Nguyen and S. Vadhan. Zero knowledge with efficient provers. In 38th STOC, 2006.
15. R. Ostrovsky, R. Venkatesan, and M. Yung. Fair games against an all-powerful adversary, May 07 1991.
16. R. Ostrovsky, R. Venkatesan, and M. Yung. Secure commitment against A powerful adversary. In 9th Annual Symposium on Theoretical Aspects of Computer Science, volume 577 of Ines, Cachan, France, 13-15 Feb. 1992. Springer.
17. R. Ostrovsky, R. Venkatesan, and M. Yung. Interactive hashing simplifies zero-knowledge protocol design. In EUROCRYPT, 1993.
18. H. Wee. One-way permutations, interactive hashing and statistically hiding commitments. In 4th TCC, 2007.