Strengthening the security of distributed oblivious transfer

K. Y. Cheong, Takeshi Koshiba, Shohei Nishiyama

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationInformation Security and Privacy - 14th Australasian Conference, ACISP 2009, Proceedings
Pages377-388
Number of pages12
Volume5594 LNCS
DOIs
Publication statusPublished - 2009
Externally publishedYes
Event14th Australasian Conference on Information Security and Privacy, ACISP 2009 - Brisbane, QLD, Australia
Duration: 2009 Jul 12009 Jul 3

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5594 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other14th Australasian Conference on Information Security and Privacy, ACISP 2009
CountryAustralia
CityBrisbane, QLD
Period09/7/109/7/3

Fingerprint

Oblivious Transfer
Security of data
Strengthening
Interpolation
Polynomials
Information-theoretic Security
Threshold Scheme
Secret Sharing Scheme
Polynomial Interpolation
Coalitions
Upper bound
Generalise

Keywords

  • Information theoretic security
  • Oblivious transfer
  • Secret sharing scheme

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Cheong, K. Y., Koshiba, T., & Nishiyama, S. (2009). Strengthening the security of distributed oblivious transfer. In Information Security and Privacy - 14th Australasian Conference, ACISP 2009, Proceedings (Vol. 5594 LNCS, pp. 377-388). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5594 LNCS). https://doi.org/10.1007/978-3-642-02620-1_26

Strengthening the security of distributed oblivious transfer. / Cheong, K. Y.; Koshiba, Takeshi; Nishiyama, Shohei.

Information Security and Privacy - 14th Australasian Conference, ACISP 2009, Proceedings. Vol. 5594 LNCS 2009. p. 377-388 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5594 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cheong, KY, Koshiba, T & Nishiyama, S 2009, Strengthening the security of distributed oblivious transfer. in Information Security and Privacy - 14th Australasian Conference, ACISP 2009, Proceedings. vol. 5594 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5594 LNCS, pp. 377-388, 14th Australasian Conference on Information Security and Privacy, ACISP 2009, Brisbane, QLD, Australia, 09/7/1. https://doi.org/10.1007/978-3-642-02620-1_26
Cheong KY, Koshiba T, Nishiyama S. Strengthening the security of distributed oblivious transfer. In Information Security and Privacy - 14th Australasian Conference, ACISP 2009, Proceedings. Vol. 5594 LNCS. 2009. p. 377-388. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-02620-1_26
Cheong, K. Y. ; Koshiba, Takeshi ; Nishiyama, Shohei. / Strengthening the security of distributed oblivious transfer. Information Security and Privacy - 14th Australasian Conference, ACISP 2009, Proceedings. Vol. 5594 LNCS 2009. pp. 377-388 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{ed2243615e214450ba135593a21552c6,
title = "Strengthening the security of distributed oblivious transfer",
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.",
keywords = "Information theoretic security, Oblivious transfer, Secret sharing scheme",
author = "Cheong, {K. Y.} and Takeshi Koshiba and Shohei Nishiyama",
year = "2009",
doi = "10.1007/978-3-642-02620-1_26",
language = "English",
isbn = "3642026192",
volume = "5594 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "377--388",
booktitle = "Information Security and Privacy - 14th Australasian Conference, ACISP 2009, Proceedings",

}

TY - GEN

T1 - Strengthening the security of distributed oblivious transfer

AU - Cheong, K. Y.

AU - Koshiba, Takeshi

AU - Nishiyama, Shohei

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

KW - Information theoretic security

KW - Oblivious transfer

KW - Secret sharing scheme

UR - http://www.scopus.com/inward/record.url?scp=70350634207&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70350634207&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-02620-1_26

DO - 10.1007/978-3-642-02620-1_26

M3 - Conference contribution

SN - 3642026192

SN - 9783642026195

VL - 5594 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 377

EP - 388

BT - Information Security and Privacy - 14th Australasian Conference, ACISP 2009, Proceedings

ER -