A Survey of Oblivious Transfer Protocol
Oblivious transfer (OT) protocol is an essential tool in cryptography that provides a wide range of applications such as secure multi-party computation, private information retrieval, private set intersection, contract signing, and privacy-preserving location-based services. The OT protocol has diff...
Gespeichert in:
Veröffentlicht in: | ACM computing surveys 2022-09, Vol.54 (10s), p.1-37 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 37 |
---|---|
container_issue | 10s |
container_start_page | 1 |
container_title | ACM computing surveys |
container_volume | 54 |
creator | Yadav, Vijay Kumar Andola, Nitish Verma, Shekhar Venkatesan, S. |
description | Oblivious transfer (OT) protocol is an essential tool in cryptography that provides a wide range of applications such as secure multi-party computation, private information retrieval, private set intersection, contract signing, and privacy-preserving location-based services. The OT protocol has different variants such as one-out-of-2, one-out-of-
n
,
k
-out-of-
n
, and OT extension. In the OT (one-out-of-2, one-out-of-
n
, and OT extension) protocol, the sender has a set of messages, whereas the receiver has a key. The receiver sends that key to the sender in a secure way; the sender cannot get any information about the received key. The sender encrypts every message by operating on every message using the received key and sends all the encrypted messages to the receiver. The receiver is able to extract only the required message using his key. However, in the
k
-out-of-
n
OT protocol, the receiver sends a set of
k
keys to the sender, and in replay, the sender sends all the encrypted messages. The receiver uses his keys and extracts the required messages, but it cannot gain any information about the messages that it has not requested. Generally, the OT protocol requires high communication and computation cost if we transfer millions of oblivious messages. The OT extension protocol provides a solution for this, where the receiver transfers a set of keys to the sender by executing a few numbers of OT protocols. Then, the sender encrypts all the messages using cheap symmetric key cryptography with the help of a received set of keys and transfers millions of oblivious messages to the receiver. In this work, we present different variants of OT protocols such as one-out-of-2, one-out-of-
n
,
k
-out-of-
n
, and OT extension. Furthermore, we cover various aspects of theoretical security guarantees such as semi-honest and malicious adversaries, universally composable, used techniques, computation, and communication efficiency aspects. From the analysis, we found that the semi-honest adversary-based OT protocols required low communication and computation costs as compared to malicious adversary-based OT protocols. |
doi_str_mv | 10.1145/3503045 |
format | Article |
fullrecord | <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_1145_3503045</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_1145_3503045</sourcerecordid><originalsourceid>FETCH-LOGICAL-c258t-76136ab1192724a3e0e20c59813b9eef5df13e90d03feba9fd75ae989f4d74173</originalsourceid><addsrcrecordid>eNotj01LAzEUAIMouFbxL-TWU_S9vGSzOZbiFxQqtD0v2d0XWFmNJG2h_17FnuYwMDBC3CM8IBr7SBYIjL0QFVrrlCODl6ICqkH9CrgWN6V8AIA2WFdivpCbQz7ySaYo1900Hsd0KHKbw1eJnOV7TvvUp-lWXMUwFb47cyZ2z0_b5atarV_elouV6rVt9srVSHXoEL122gRiYA299Q1S55mjHSISexiAInfBx8HZwL7x0QzOoKOZmP93-5xKyRzb7zx-hnxqEdq_v_b8Rz-E7kBV</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A Survey of Oblivious Transfer Protocol</title><source>ACM Digital Library Complete</source><creator>Yadav, Vijay Kumar ; Andola, Nitish ; Verma, Shekhar ; Venkatesan, S.</creator><creatorcontrib>Yadav, Vijay Kumar ; Andola, Nitish ; Verma, Shekhar ; Venkatesan, S.</creatorcontrib><description>Oblivious transfer (OT) protocol is an essential tool in cryptography that provides a wide range of applications such as secure multi-party computation, private information retrieval, private set intersection, contract signing, and privacy-preserving location-based services. The OT protocol has different variants such as one-out-of-2, one-out-of-
n
,
k
-out-of-
n
, and OT extension. In the OT (one-out-of-2, one-out-of-
n
, and OT extension) protocol, the sender has a set of messages, whereas the receiver has a key. The receiver sends that key to the sender in a secure way; the sender cannot get any information about the received key. The sender encrypts every message by operating on every message using the received key and sends all the encrypted messages to the receiver. The receiver is able to extract only the required message using his key. However, in the
k
-out-of-
n
OT protocol, the receiver sends a set of
k
keys to the sender, and in replay, the sender sends all the encrypted messages. The receiver uses his keys and extracts the required messages, but it cannot gain any information about the messages that it has not requested. Generally, the OT protocol requires high communication and computation cost if we transfer millions of oblivious messages. The OT extension protocol provides a solution for this, where the receiver transfers a set of keys to the sender by executing a few numbers of OT protocols. Then, the sender encrypts all the messages using cheap symmetric key cryptography with the help of a received set of keys and transfers millions of oblivious messages to the receiver. In this work, we present different variants of OT protocols such as one-out-of-2, one-out-of-
n
,
k
-out-of-
n
, and OT extension. Furthermore, we cover various aspects of theoretical security guarantees such as semi-honest and malicious adversaries, universally composable, used techniques, computation, and communication efficiency aspects. From the analysis, we found that the semi-honest adversary-based OT protocols required low communication and computation costs as compared to malicious adversary-based OT protocols.</description><identifier>ISSN: 0360-0300</identifier><identifier>EISSN: 1557-7341</identifier><identifier>DOI: 10.1145/3503045</identifier><language>eng</language><ispartof>ACM computing surveys, 2022-09, Vol.54 (10s), p.1-37</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c258t-76136ab1192724a3e0e20c59813b9eef5df13e90d03feba9fd75ae989f4d74173</citedby><cites>FETCH-LOGICAL-c258t-76136ab1192724a3e0e20c59813b9eef5df13e90d03feba9fd75ae989f4d74173</cites><orcidid>0000-0003-3460-2707 ; 0000-0003-1403-2639 ; 0000-0002-9691-0142 ; 0000-0002-6139-7350</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Yadav, Vijay Kumar</creatorcontrib><creatorcontrib>Andola, Nitish</creatorcontrib><creatorcontrib>Verma, Shekhar</creatorcontrib><creatorcontrib>Venkatesan, S.</creatorcontrib><title>A Survey of Oblivious Transfer Protocol</title><title>ACM computing surveys</title><description>Oblivious transfer (OT) protocol is an essential tool in cryptography that provides a wide range of applications such as secure multi-party computation, private information retrieval, private set intersection, contract signing, and privacy-preserving location-based services. The OT protocol has different variants such as one-out-of-2, one-out-of-
n
,
k
-out-of-
n
, and OT extension. In the OT (one-out-of-2, one-out-of-
n
, and OT extension) protocol, the sender has a set of messages, whereas the receiver has a key. The receiver sends that key to the sender in a secure way; the sender cannot get any information about the received key. The sender encrypts every message by operating on every message using the received key and sends all the encrypted messages to the receiver. The receiver is able to extract only the required message using his key. However, in the
k
-out-of-
n
OT protocol, the receiver sends a set of
k
keys to the sender, and in replay, the sender sends all the encrypted messages. The receiver uses his keys and extracts the required messages, but it cannot gain any information about the messages that it has not requested. Generally, the OT protocol requires high communication and computation cost if we transfer millions of oblivious messages. The OT extension protocol provides a solution for this, where the receiver transfers a set of keys to the sender by executing a few numbers of OT protocols. Then, the sender encrypts all the messages using cheap symmetric key cryptography with the help of a received set of keys and transfers millions of oblivious messages to the receiver. In this work, we present different variants of OT protocols such as one-out-of-2, one-out-of-
n
,
k
-out-of-
n
, and OT extension. Furthermore, we cover various aspects of theoretical security guarantees such as semi-honest and malicious adversaries, universally composable, used techniques, computation, and communication efficiency aspects. From the analysis, we found that the semi-honest adversary-based OT protocols required low communication and computation costs as compared to malicious adversary-based OT protocols.</description><issn>0360-0300</issn><issn>1557-7341</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><recordid>eNotj01LAzEUAIMouFbxL-TWU_S9vGSzOZbiFxQqtD0v2d0XWFmNJG2h_17FnuYwMDBC3CM8IBr7SBYIjL0QFVrrlCODl6ICqkH9CrgWN6V8AIA2WFdivpCbQz7ySaYo1900Hsd0KHKbw1eJnOV7TvvUp-lWXMUwFb47cyZ2z0_b5atarV_elouV6rVt9srVSHXoEL122gRiYA299Q1S55mjHSISexiAInfBx8HZwL7x0QzOoKOZmP93-5xKyRzb7zx-hnxqEdq_v_b8Rz-E7kBV</recordid><startdate>20220914</startdate><enddate>20220914</enddate><creator>Yadav, Vijay Kumar</creator><creator>Andola, Nitish</creator><creator>Verma, Shekhar</creator><creator>Venkatesan, S.</creator><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0003-3460-2707</orcidid><orcidid>https://orcid.org/0000-0003-1403-2639</orcidid><orcidid>https://orcid.org/0000-0002-9691-0142</orcidid><orcidid>https://orcid.org/0000-0002-6139-7350</orcidid></search><sort><creationdate>20220914</creationdate><title>A Survey of Oblivious Transfer Protocol</title><author>Yadav, Vijay Kumar ; Andola, Nitish ; Verma, Shekhar ; Venkatesan, S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c258t-76136ab1192724a3e0e20c59813b9eef5df13e90d03feba9fd75ae989f4d74173</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yadav, Vijay Kumar</creatorcontrib><creatorcontrib>Andola, Nitish</creatorcontrib><creatorcontrib>Verma, Shekhar</creatorcontrib><creatorcontrib>Venkatesan, S.</creatorcontrib><collection>CrossRef</collection><jtitle>ACM computing surveys</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yadav, Vijay Kumar</au><au>Andola, Nitish</au><au>Verma, Shekhar</au><au>Venkatesan, S.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Survey of Oblivious Transfer Protocol</atitle><jtitle>ACM computing surveys</jtitle><date>2022-09-14</date><risdate>2022</risdate><volume>54</volume><issue>10s</issue><spage>1</spage><epage>37</epage><pages>1-37</pages><issn>0360-0300</issn><eissn>1557-7341</eissn><abstract>Oblivious transfer (OT) protocol is an essential tool in cryptography that provides a wide range of applications such as secure multi-party computation, private information retrieval, private set intersection, contract signing, and privacy-preserving location-based services. The OT protocol has different variants such as one-out-of-2, one-out-of-
n
,
k
-out-of-
n
, and OT extension. In the OT (one-out-of-2, one-out-of-
n
, and OT extension) protocol, the sender has a set of messages, whereas the receiver has a key. The receiver sends that key to the sender in a secure way; the sender cannot get any information about the received key. The sender encrypts every message by operating on every message using the received key and sends all the encrypted messages to the receiver. The receiver is able to extract only the required message using his key. However, in the
k
-out-of-
n
OT protocol, the receiver sends a set of
k
keys to the sender, and in replay, the sender sends all the encrypted messages. The receiver uses his keys and extracts the required messages, but it cannot gain any information about the messages that it has not requested. Generally, the OT protocol requires high communication and computation cost if we transfer millions of oblivious messages. The OT extension protocol provides a solution for this, where the receiver transfers a set of keys to the sender by executing a few numbers of OT protocols. Then, the sender encrypts all the messages using cheap symmetric key cryptography with the help of a received set of keys and transfers millions of oblivious messages to the receiver. In this work, we present different variants of OT protocols such as one-out-of-2, one-out-of-
n
,
k
-out-of-
n
, and OT extension. Furthermore, we cover various aspects of theoretical security guarantees such as semi-honest and malicious adversaries, universally composable, used techniques, computation, and communication efficiency aspects. From the analysis, we found that the semi-honest adversary-based OT protocols required low communication and computation costs as compared to malicious adversary-based OT protocols.</abstract><doi>10.1145/3503045</doi><tpages>37</tpages><orcidid>https://orcid.org/0000-0003-3460-2707</orcidid><orcidid>https://orcid.org/0000-0003-1403-2639</orcidid><orcidid>https://orcid.org/0000-0002-9691-0142</orcidid><orcidid>https://orcid.org/0000-0002-6139-7350</orcidid><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0360-0300 |
ispartof | ACM computing surveys, 2022-09, Vol.54 (10s), p.1-37 |
issn | 0360-0300 1557-7341 |
language | eng |
recordid | cdi_crossref_primary_10_1145_3503045 |
source | ACM Digital Library Complete |
title | A Survey of Oblivious Transfer Protocol |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T16%3A06%3A49IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Survey%20of%20Oblivious%20Transfer%20Protocol&rft.jtitle=ACM%20computing%20surveys&rft.au=Yadav,%20Vijay%20Kumar&rft.date=2022-09-14&rft.volume=54&rft.issue=10s&rft.spage=1&rft.epage=37&rft.pages=1-37&rft.issn=0360-0300&rft.eissn=1557-7341&rft_id=info:doi/10.1145/3503045&rft_dat=%3Ccrossref%3E10_1145_3503045%3C/crossref%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |