A randomized protocol for signing contracts
Communications of the ACM
Privacy amplification by public discussion
SIAM Journal on Computing - Special issue on cryptography
Founding crytpography on oblivious transfer
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Oblivious Transfer with a Memory-Bounded Receiver
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
ACM SIGACT News - A special issue on cryptography
Lower bounds for oblivious transfer reductions
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Generalized privacy amplification
IEEE Transactions on Information Theory - Part 2
Oblivious transfers and intersecting codes
IEEE Transactions on Information Theory - Part 1
Interactive Hashing: An Information Theoretic Tool (Invited Talk)
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Founding Cryptography on Oblivious Transfer --- Efficiently
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Strengthening the Security of Distributed Oblivious Transfer
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Reducing Complexity Assumptions for Oblivious Transfer
IWSEC '09 Proceedings of the 4th International Workshop on Security: Advances in Information and Computer Security
One-way permutations, interactive hashing and statistically hiding commitments
TCC'07 Proceedings of the 4th conference on Theory of cryptography
On the efficiency of classical and quantum oblivious transfer reductions
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Unconditionally secure oblivious transfer based on channel delays
ICICS'11 Proceedings of the 13th international conference on Information and communications security
Bit commitment in the bounded storage model: tight bound and simple optimal construction
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
| Hi-index | 0.00 |
We present an asymptotically optimal reduction of one-out-of-two String Oblivious Transfer to one-out-of-two Bit Oblivious Transfer using Interactive Hashing in conjunction with Privacy Amplification. Interactive Hashing is used in an innovative way to test the receiver's adherence to the protocol. We show that (1 + ε)k uses of Bit OT suffice to implement String OT for k-bit strings. Our protocol represents a two-fold improvement over the best constructions in the literature and is asymptotically optimal. We then show that our construction can also accommodate weaker versions of Bit OT, thereby obtaining a significantly lower expansion factor compared to previous constructions. Besides increasing efficiency, our constructions allow the use of any 2-universal family of Hash Functions for performing Privacy Amplification. Of independent interest, our reduction illustrates the power of Interactive Hashing as an ingredient in the design of cryptographic protocols.