Privacy amplification by public discussion
SIAM Journal on Computing - Special issue on cryptography
How to Solve any Protocol Problem - An Efficiency Improvement
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Quantum Bit Commitment and Coin Tossing Protocols
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
The bit extraction problem or t-resilient functions
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Information theoretic reductions among disclosure problems
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Oblivious Transfer in the Bounded Storage Model
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
On the efficiency of classical and quantum oblivious transfer reductions
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Oblivious transfer and n-variate linear function evaluation
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
New monotones and lower bounds in unconditional two-party computation
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Oblivious transfer is symmetric
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
| Hi-index | 0.00 |
A(2 1)-OT2, (one-out-of-two Bit Oblivious Transfer) is a technique by which a party S owning two secret bits b0, b1, can transfer one of them bc, to another party R, who chooses c. This is done in a way that does not release any bias about bt to R nor any bias about c to S. How can one build a 2TO-(2 1) ((2 1)-OT2 from R to S) given a (2 1)-OT2, (from S to R)? This question is interesting because in many scenarios, one of the two parties will be much more powerful than the other. In the current paper we answer this question and show a number of related extensions. One interesting extension of this transfer is the (2 1)-OT2k (one-out-of-two String O.T.) in which the two secrets q0, q1 are elements of GFk(2) instead of bits. We show that 2kTO-(2 1) can be obtained at about the same cost as (2 1)-OT2k, in terms of number of calls to (2 1)-OT2.