Oblivious transfer and polynomial evaluation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On the constructions of highly nonlinear zigzag functions and unbiased functions
Information Processing Letters
Generalized Zig-zag Functions and Oblivious Transfer Reductions
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
New Results on Unconditionally Secure Distributed Oblivious Transfer
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Oblivious Transfer in the Bounded Storage Model
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Quantum Key Distribution and String Oblivious Transfer in Noisy Channels
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
On Unconditionally Secure Distributed Oblivious Transfer
INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress in Cryptology
A New Efficient All-Or-Nothing Disclosure of Secrets Protocol
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Distributed Oblivious Transfer
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Introduction to Secure Computation
Lectures on Data Security, Modern Cryptology in Theory and Practice, Summer School, Aarhus, Denmark, July 1998
Efficient 1-Out-n Oblivious Transfer Schemes
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Efficient 1-Out-of-n Oblivious Transfer Schemes with Universally Usable Parameters
IEEE Transactions on Computers
Distributed oblivious function evaluation and its applications
Journal of Computer Science and Technology
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
Oblivious transfers and privacy amplification
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
Lower bounds for oblivious transfer reductions
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
On the efficiency of classical and quantum oblivious transfer reductions
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Generalized oblivious transfer by secret sharing
Designs, Codes and Cryptography
Efficient reductions for non-signaling cryptographic primitives
ICITS'11 Proceedings of the 5th international conference on Information theoretic security
Founding cryptography on tamper-proof hardware tokens
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Efficient k-out-of-n oblivious transfer schemes with adaptive and non-adaptive queries
PKC'05 Proceedings of the 8th international conference on Theory and Practice in Public Key Cryptography
t-out-of-n string/bit oblivious transfers revisited
ISPEC'05 Proceedings of the First international conference on Information Security Practice and Experience
Optimal reductions between oblivious transfers using interactive hashing
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Information-Theoretic conditions for two-party secure function evaluation
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Statistically secure linear-rate dimension extension for oblivious affine function evaluation
ICITS'12 Proceedings of the 6th international conference on Information Theoretic Security
| Hi-index | 0.00 |
Assume A owns t secret k-bit strings. She is willing to disclose one of them to B, at his choosing, provided he does not learn anything about the other strings. Conversely, B does not want A to learn which secret he chose to learn. A protocol for the above task is said to implement one-out-of-t string oblivious transfer, denoted (t 1)-OTk2. This primitive is particularly useful in a variety of cryptographic settings. An apparently simpler task corresponds to the case k=1 and t=2 of two 1-bit secrets: this is known as one-out-of-two bit oblivious transfer, denoted (2 1)-OT2. We address the question of implementing ( t1)-OTk2 assuming the existence of a (21)-OT2. In particular, we prove that unconditionally secure (21)-OTk 2 can be implemented from Θ(k) calls to (2 1)-OT2. This is optimal up to a small multiplicative constant. Our solution is based on the notion of self-intersecting codes. Of independent interest, we give several efficient new constructions for such codes. Another contribution of this paper is a set of information-theoretic definitions for correctness and privacy of unconditionally secure oblivious transfer