Our framework uses three abstract tools, i.e., information-theoretically binding commitment, information-theoretically hiding commitment and our new smooth projective hash. This allows a simple and intuitive understanding of its security.
We instantiate the new smooth projective hash under the lattice assumption, the decisional Diffie-Hellman assumption, the decisional $N$-th residuosity assumption, the decisional quadratic residuosity assumption. This indeed shows that the folklore that it is technically difficult to instantiate the projective hash framework under the lattice assumption is not true. What's more, by using this lattice-based hash and lattice-based commitment scheme, we gain a concrete protocol for $OT^{n}_{h}$ which is secure against quantum algorithms.
Category / Keywords: cryptographic protocols / oblivious transfer,public-key cryptography, quantum cryptography,lattice techniques Date: received 9 Apr 2010, last revised 10 Jul 2011 Contact author: zeng bing zb at gmail com; Available formats: PDF | BibTeX Citation Note: Submitted for Publication. Version: 20110711:011342 (All versions of this report) Discussion forum: Show discussion | Start new discussion