Strengthening the Security of Distributed Oblivious Transfer

Authors:
K. Y. Cheong;Takeshi Koshiba;Shohei Nishiyama
Affiliations:
Division of Mathematics, Electronics and Informatics, Graduate School of Science and Engineering, Saitama University, Saitama, Japan 338-8570;Division of Mathematics, Electronics and Informatics, Graduate School of Science and Engineering, Saitama University, Saitama, Japan 338-8570;Division of Mathematics, Electronics and Informatics, Graduate School of Science and Engineering, Saitama University, Saitama, Japan 338-8570
Venue:
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Year:
2009

Citing 11
Cited 2

A randomized protocol for signing contracts

Communications of the ACM
How to play ANY mental game

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Founding crytpography on oblivious transfer

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
How to share a secret

Communications of the ACM
New Results on Unconditionally Secure Distributed Oblivious Transfer

SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Equivalence Between Two Flavours of Oblivious Transfers

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
On Unconditionally Secure Distributed Oblivious Transfer

INDOCRYPT '02 Proceedings of the Third International Conference on Cryptology: Progress 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
Protocols for secure computations

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
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
Oblivious transfers and intersecting codes

IEEE Transactions on Information Theory - Part 1

Communication-efficient distributed oblivious transfer

Journal of Computer and System Sciences
T-out-of-n distributed oblivious transfer protocols in non-adaptive and adaptive settings

ISPEC'12 Proceedings of the 8th international conference on Information Security Practice and Experience

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the distributed oblivious transfer first proposed by Naor and Pinkas in ASIACRYPT 2000, and generalized by Blundo et al. originally in SAC 2002 and Nikov et al. in INDOCRYPT 2002. One major objective of distributed oblivious transfer is to achieve information theoretic security under specified conditions through the distribution of the functions of traditional oblivious transfer to a set of neutral parties. In this paper we revise the definition of distributed oblivious transfer in order to deal with stronger adversaries and clarify possible ambiguities. Under the new definition, we observe some impossibility results and derive the upper bounds for the system parameters (with respect to the size of coalition). The weak points of previously proposed schemes based on threshold secret sharing schemes using polynomial interpolation are reviewed and resolved. We generalize the results and prove that, by adjusting some technical details, a previous scheme proposed by Nikov et al. is unconditionally secure. This protocol is efficient and achieves the parameter bounds at the same time.