Universally composable oblivious transfer based on a variant of LPN

Bernardo David; Rafael Dowsley; Anderson C.A. Nascimento

doi:10.1007/978-3-319-12280-9_10

Universally composable oblivious transfer based on a variant of LPN

Bernardo David, Rafael Dowsley, Anderson C.A. Nascimento

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

25 Citations (Scopus)

Abstract

Oblivious transfer (OT) is a fundamental two-party cryptographic primitive that implies secure multiparty computation. In this paper, we introduce the first OT based on the Learning Parity with Noise (LPN) problem. More specifically, we use the LPN variant that was introduced by Alekhnovich (FOCS 2003). We prove that our protocol is secure against active static adversaries in the Universal Composability framework in the common reference string model. Our constructions are based solely on a LPN style assumption and thus represents a clear next step from current code-based OT protocols, which require an additional assumption related to the indistinguishability of public keys from random matrices. Our constructions are inspired by the techniques used to obtain OT based on the McEliece cryptosystem.

Original language	English
Title of host publication	Cryptology and Network Security
Subtitle of host publication	13th International Conference, CANS 2014 Heraklion, Crete, Greece, October 22-24, 2014 Proceedings
Editors	Dimitris Gritzalis, Aggelos Kiayias, Ioannis Askoxylakis
Place of Publication	Cham Switzerland
Publisher	Springer
Pages	143-158
Number of pages	16
ISBN (Electronic)	9783319122809
ISBN (Print)	9783319122793
DOIs	https://doi.org/10.1007/978-3-319-12280-9_10
Publication status	Published - 2014
Externally published	Yes
Event	International Conference on Cryptology and Network Security 2014 - Heraklion, Crete, Greece Duration: 22 Oct 2014 → 24 Oct 2014 Conference number: 13th https://link.springer.com/book/10.1007/978-3-319-12280-9 (Proceedings)

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	8813
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	International Conference on Cryptology and Network Security 2014
Abbreviated title	CANS 2014
Country/Territory	Greece
City	Heraklion, Crete
Period	22/10/14 → 24/10/14
Internet address	https://link.springer.com/book/10.1007/978-3-319-12280-9 (Proceedings)

Keywords

Commitment Scheme
Oblivious Transfer
Protocol Execution
Secure Multiparty Computation
Common Reference String

Access to Document

10.1007/978-3-319-12280-9_10

318721257-oaFinal published version, 232 KB

Cite this

David, B., Dowsley, R., & Nascimento, A. C. A. (2014). Universally composable oblivious transfer based on a variant of LPN. In D. Gritzalis, A. Kiayias, & I. Askoxylakis (Eds.), Cryptology and Network Security : 13th International Conference, CANS 2014 Heraklion, Crete, Greece, October 22-24, 2014 Proceedings (pp. 143-158). (Lecture Notes in Computer Science; Vol. 8813). Springer. https://doi.org/10.1007/978-3-319-12280-9_10

David, Bernardo ; Dowsley, Rafael ; Nascimento, Anderson C.A. / Universally composable oblivious transfer based on a variant of LPN. Cryptology and Network Security : 13th International Conference, CANS 2014 Heraklion, Crete, Greece, October 22-24, 2014 Proceedings. editor / Dimitris Gritzalis ; Aggelos Kiayias ; Ioannis Askoxylakis. Cham Switzerland : Springer, 2014. pp. 143-158 (Lecture Notes in Computer Science).

@inproceedings{21ca1b6d6caf4a8193e9e6a3895e04d0,

title = "Universally composable oblivious transfer based on a variant of LPN",

abstract = "Oblivious transfer (OT) is a fundamental two-party cryptographic primitive that implies secure multiparty computation. In this paper, we introduce the first OT based on the Learning Parity with Noise (LPN) problem. More specifically, we use the LPN variant that was introduced by Alekhnovich (FOCS 2003). We prove that our protocol is secure against active static adversaries in the Universal Composability framework in the common reference string model. Our constructions are based solely on a LPN style assumption and thus represents a clear next step from current code-based OT protocols, which require an additional assumption related to the indistinguishability of public keys from random matrices. Our constructions are inspired by the techniques used to obtain OT based on the McEliece cryptosystem.",

keywords = "Commitment Scheme, Oblivious Transfer, Protocol Execution, Secure Multiparty Computation, Common Reference String",

author = "Bernardo David and Rafael Dowsley and Nascimento, {Anderson C.A.}",

year = "2014",

doi = "10.1007/978-3-319-12280-9_10",

language = "English",

isbn = "9783319122793",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "143--158",

editor = "Dimitris Gritzalis and Aggelos Kiayias and Ioannis Askoxylakis",

booktitle = "Cryptology and Network Security",

note = "International Conference on Cryptology and Network Security 2014, CANS 2014 ; Conference date: 22-10-2014 Through 24-10-2014",

url = "https://link.springer.com/book/10.1007/978-3-319-12280-9",

}

David, B, Dowsley, R & Nascimento, ACA 2014, Universally composable oblivious transfer based on a variant of LPN. in D Gritzalis, A Kiayias & I Askoxylakis (eds), Cryptology and Network Security : 13th International Conference, CANS 2014 Heraklion, Crete, Greece, October 22-24, 2014 Proceedings. Lecture Notes in Computer Science, vol. 8813, Springer, Cham Switzerland, pp. 143-158, International Conference on Cryptology and Network Security 2014, Heraklion, Crete, Greece, 22/10/14. https://doi.org/10.1007/978-3-319-12280-9_10

Universally composable oblivious transfer based on a variant of LPN. / David, Bernardo; Dowsley, Rafael; Nascimento, Anderson C.A.
Cryptology and Network Security : 13th International Conference, CANS 2014 Heraklion, Crete, Greece, October 22-24, 2014 Proceedings. ed. / Dimitris Gritzalis; Aggelos Kiayias; Ioannis Askoxylakis. Cham Switzerland: Springer, 2014. p. 143-158 (Lecture Notes in Computer Science; Vol. 8813).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - Universally composable oblivious transfer based on a variant of LPN

AU - David, Bernardo

AU - Dowsley, Rafael

AU - Nascimento, Anderson C.A.

N1 - Conference code: 13th

PY - 2014

Y1 - 2014

N2 - Oblivious transfer (OT) is a fundamental two-party cryptographic primitive that implies secure multiparty computation. In this paper, we introduce the first OT based on the Learning Parity with Noise (LPN) problem. More specifically, we use the LPN variant that was introduced by Alekhnovich (FOCS 2003). We prove that our protocol is secure against active static adversaries in the Universal Composability framework in the common reference string model. Our constructions are based solely on a LPN style assumption and thus represents a clear next step from current code-based OT protocols, which require an additional assumption related to the indistinguishability of public keys from random matrices. Our constructions are inspired by the techniques used to obtain OT based on the McEliece cryptosystem.

AB - Oblivious transfer (OT) is a fundamental two-party cryptographic primitive that implies secure multiparty computation. In this paper, we introduce the first OT based on the Learning Parity with Noise (LPN) problem. More specifically, we use the LPN variant that was introduced by Alekhnovich (FOCS 2003). We prove that our protocol is secure against active static adversaries in the Universal Composability framework in the common reference string model. Our constructions are based solely on a LPN style assumption and thus represents a clear next step from current code-based OT protocols, which require an additional assumption related to the indistinguishability of public keys from random matrices. Our constructions are inspired by the techniques used to obtain OT based on the McEliece cryptosystem.

KW - Commitment Scheme

KW - Oblivious Transfer

KW - Protocol Execution

KW - Secure Multiparty Computation

KW - Common Reference String

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

U2 - 10.1007/978-3-319-12280-9_10

DO - 10.1007/978-3-319-12280-9_10

M3 - Conference Paper

AN - SCOPUS:84911418729

SN - 9783319122793

T3 - Lecture Notes in Computer Science

SP - 143

EP - 158

BT - Cryptology and Network Security

A2 - Gritzalis, Dimitris

A2 - Kiayias, Aggelos

A2 - Askoxylakis, Ioannis

PB - Springer

CY - Cham Switzerland

T2 - International Conference on Cryptology and Network Security 2014

Y2 - 22 October 2014 through 24 October 2014

ER -

David B, Dowsley R, Nascimento ACA. Universally composable oblivious transfer based on a variant of LPN. In Gritzalis D, Kiayias A, Askoxylakis I, editors, Cryptology and Network Security : 13th International Conference, CANS 2014 Heraklion, Crete, Greece, October 22-24, 2014 Proceedings. Cham Switzerland: Springer. 2014. p. 143-158. (Lecture Notes in Computer Science). doi: 10.1007/978-3-319-12280-9_10

Universally composable oblivious transfer based on a variant of LPN

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Cite this