Simple Direct Reduction of String (1,2)-OT to Rabin's OT without Privacy Amplification

Authors:
Kaoru Kurosawa;Takeshi Koshiba
Affiliations:
Department of Computer and Information Sciences, Ibaraki University, Hitachi, Japan 316-8511;Division of Mathematics, Electronics and Informatics, Graduate School of Science and Engineering, Saitama University, Sakura, Japan 338-8570
Venue:
ICITS '08 Proceedings of the 3rd international conference on Information Theoretic Security
Year:
2008

Citing 16
Cited 0

A randomized protocol for signing contracts

Communications of the ACM
Privacy amplification by public discussion

SIAM Journal on Computing - Special issue on cryptography
On the Security Properties of OAEP as an All-or-Nothing Transform

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Equivalence Between Two Flavours of Oblivious Transfers

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
On Perfect and Adaptive Security in Exposure-Resilient Cryptography

EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
All-or-Nothing Encryption and the Package Transform

FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
Exposure-resilient cryptography

Exposure-resilient cryptography
Deterministic Extractors for Bit-Fixing Sources and Exposure-Resilient Cryptography

SIAM Journal on Computing
Deterministic Extractors for Bit-Fixing Sources by Obtaining an Independent Seed

SIAM Journal on Computing
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
Deterministic extractors for independent-symbol sources

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
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 and linear functions

CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
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
A Combinatorial Approach to Deriving Lower Bounds for Perfectly Secure Oblivious Transfer Reductions

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is known that string (1,2)-OT and Rabin's OT are equivalent. Actually, there have been many reductions between them. Many of them use the privacy amplification technique as a basic tool. The privacy amplification technique essentially involves some post-processing of sending random objects (e.g., random indices of pairwise independent hash functions) per each invocation of Rabin's OT is necessary. In this paper, we show a simple direct reduction of string (1,2)-OT to Rabin's OT by using a deterministic randomness extractor for bit-fixing sources. Our reduction can be realized without privacy amplification and thus our protocol is simpler and more efficient with respect to the communication complexity than the previous reductions.