Communication efficient oblivious transfer using elliptic curves

Abhishek Parakh

doi:10.1109/HASE.2012.14

Communication efficient oblivious transfer using elliptic curves

Abhishek Parakh

Cybersecurity

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Scopus citations

Abstract

This paper presents communication efficient protocols for oblivious transfer (OT) using elliptic curve cryptography (ECC). ECC provides better security than RSA for the same key length and is known to have faster implementations. We provide protocols for 1-out-of-2 and 1-out-of-n oblivious transfer in which the latter requires the sender to send only n+2 elements over the network and the receiver sends only one messages over the network.

Original language	English (US)
Title of host publication	Proceedings - IEEE 14th International Symposium on High-Assurance Systems Engineering, HASE 2012
Pages	173-174
Number of pages	2
DOIs	https://doi.org/10.1109/HASE.2012.14
State	Published - 2012
Event	IEEE 14th International Symposium on High-Assurance Systems Engineering, HASE 2012 - Omaha, NE, United States Duration: Oct 25 2012 → Oct 27 2012

Publication series

Name	Proceedings of IEEE International Symposium on High Assurance Systems Engineering
ISSN (Print)	1530-2059

Conference

Conference	IEEE 14th International Symposium on High-Assurance Systems Engineering, HASE 2012
Country/Territory	United States
City	Omaha, NE
Period	10/25/12 → 10/27/12

Keywords

communication efficient protocol
elliptic curves
oblivious transfer

ASJC Scopus subject areas

Software
Safety, Risk, Reliability and Quality

Access to Document

10.1109/HASE.2012.14

Cite this

Communication efficient oblivious transfer using elliptic curves. / Parakh, Abhishek.
Proceedings - IEEE 14th International Symposium on High-Assurance Systems Engineering, HASE 2012. 2012. p. 173-174 6375613 (Proceedings of IEEE International Symposium on High Assurance Systems Engineering).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Parakh, A 2012, Communication efficient oblivious transfer using elliptic curves. in Proceedings - IEEE 14th International Symposium on High-Assurance Systems Engineering, HASE 2012., 6375613, Proceedings of IEEE International Symposium on High Assurance Systems Engineering, pp. 173-174, IEEE 14th International Symposium on High-Assurance Systems Engineering, HASE 2012, Omaha, NE, United States, 10/25/12. https://doi.org/10.1109/HASE.2012.14

@inproceedings{5359318754584286b9089764832b8b44,

title = "Communication efficient oblivious transfer using elliptic curves",

abstract = "This paper presents communication efficient protocols for oblivious transfer (OT) using elliptic curve cryptography (ECC). ECC provides better security than RSA for the same key length and is known to have faster implementations. We provide protocols for 1-out-of-2 and 1-out-of-n oblivious transfer in which the latter requires the sender to send only n+2 elements over the network and the receiver sends only one messages over the network.",

keywords = "communication efficient protocol, elliptic curves, oblivious transfer",

author = "Abhishek Parakh",

year = "2012",

doi = "10.1109/HASE.2012.14",

language = "English (US)",

isbn = "9780769549125",

series = "Proceedings of IEEE International Symposium on High Assurance Systems Engineering",

pages = "173--174",

booktitle = "Proceedings - IEEE 14th International Symposium on High-Assurance Systems Engineering, HASE 2012",

note = "IEEE 14th International Symposium on High-Assurance Systems Engineering, HASE 2012 ; Conference date: 25-10-2012 Through 27-10-2012",

}

TY - GEN

T1 - Communication efficient oblivious transfer using elliptic curves

AU - Parakh, Abhishek

PY - 2012

Y1 - 2012

N2 - This paper presents communication efficient protocols for oblivious transfer (OT) using elliptic curve cryptography (ECC). ECC provides better security than RSA for the same key length and is known to have faster implementations. We provide protocols for 1-out-of-2 and 1-out-of-n oblivious transfer in which the latter requires the sender to send only n+2 elements over the network and the receiver sends only one messages over the network.

AB - This paper presents communication efficient protocols for oblivious transfer (OT) using elliptic curve cryptography (ECC). ECC provides better security than RSA for the same key length and is known to have faster implementations. We provide protocols for 1-out-of-2 and 1-out-of-n oblivious transfer in which the latter requires the sender to send only n+2 elements over the network and the receiver sends only one messages over the network.

KW - communication efficient protocol

KW - elliptic curves

KW - oblivious transfer

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

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

U2 - 10.1109/HASE.2012.14

DO - 10.1109/HASE.2012.14

M3 - Conference contribution

AN - SCOPUS:84871962737

SN - 9780769549125

T3 - Proceedings of IEEE International Symposium on High Assurance Systems Engineering

SP - 173

EP - 174

BT - Proceedings - IEEE 14th International Symposium on High-Assurance Systems Engineering, HASE 2012

T2 - IEEE 14th International Symposium on High-Assurance Systems Engineering, HASE 2012

Y2 - 25 October 2012 through 27 October 2012

ER -

Communication efficient oblivious transfer using elliptic curves

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this