Efficient traceable oblivious transfer and its applications
Oblivious transfer (OT) has been applied widely in privacy-sensitive systems such as on-line transactions and electronic commerce to protect users’ private information. Traceability is an interesting feature of such systems that the privacy of the dishonest users could be traced by the service provi...
Saved in:
Main Authors: | , , , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2018
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/4157 https://ink.library.smu.edu.sg/context/sis_research/article/5161/viewcontent/Liu2018_Chapter_EfficientTraceableObliviousTra.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-5161 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-51612018-11-02T01:44:40Z Efficient traceable oblivious transfer and its applications LIU, Weiwei ZHANG, Yinghui MU, Yi YANG, Guomin TIAN, Yangguang Oblivious transfer (OT) has been applied widely in privacy-sensitive systems such as on-line transactions and electronic commerce to protect users’ private information. Traceability is an interesting feature of such systems that the privacy of the dishonest users could be traced by the service provider or a trusted third party (TTP). However, previous research on OT mainly focused on designing protocols with unconditional receiver’s privacy. Thus, traditional OT schemes cannot fulfill the traceability requirements in the aforementioned applications. In this paper, we address this problem by presenting a novel traceable oblivious transfer (TOT) without involvement of any TTP. In the new system, an honest receiver is able to make a fixed number of choices with perfect receiver privacy. If the receiver misbehaves and tries to request more than a pre-fixed number of choices, then all his previous choices could be traced by the sender. We first give the formal definition and security model of TOT, then propose an efficient TOT scheme, which is proven secure under the proposed security model. 2018-09-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/4157 info:doi/10.1007/978-3-319-99807-7_39 https://ink.library.smu.edu.sg/context/sis_research/article/5161/viewcontent/Liu2018_Chapter_EfficientTraceableObliviousTra.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Oblivious transfer Privacy Secret sharing Traceability Information Security |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Oblivious transfer Privacy Secret sharing Traceability Information Security |
spellingShingle |
Oblivious transfer Privacy Secret sharing Traceability Information Security LIU, Weiwei ZHANG, Yinghui MU, Yi YANG, Guomin TIAN, Yangguang Efficient traceable oblivious transfer and its applications |
description |
Oblivious transfer (OT) has been applied widely in privacy-sensitive systems such as on-line transactions and electronic commerce to protect users’ private information. Traceability is an interesting feature of such systems that the privacy of the dishonest users could be traced by the service provider or a trusted third party (TTP). However, previous research on OT mainly focused on designing protocols with unconditional receiver’s privacy. Thus, traditional OT schemes cannot fulfill the traceability requirements in the aforementioned applications. In this paper, we address this problem by presenting a novel traceable oblivious transfer (TOT) without involvement of any TTP. In the new system, an honest receiver is able to make a fixed number of choices with perfect receiver privacy. If the receiver misbehaves and tries to request more than a pre-fixed number of choices, then all his previous choices could be traced by the sender. We first give the formal definition and security model of TOT, then propose an efficient TOT scheme, which is proven secure under the proposed security model. |
format |
text |
author |
LIU, Weiwei ZHANG, Yinghui MU, Yi YANG, Guomin TIAN, Yangguang |
author_facet |
LIU, Weiwei ZHANG, Yinghui MU, Yi YANG, Guomin TIAN, Yangguang |
author_sort |
LIU, Weiwei |
title |
Efficient traceable oblivious transfer and its applications |
title_short |
Efficient traceable oblivious transfer and its applications |
title_full |
Efficient traceable oblivious transfer and its applications |
title_fullStr |
Efficient traceable oblivious transfer and its applications |
title_full_unstemmed |
Efficient traceable oblivious transfer and its applications |
title_sort |
efficient traceable oblivious transfer and its applications |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2018 |
url |
https://ink.library.smu.edu.sg/sis_research/4157 https://ink.library.smu.edu.sg/context/sis_research/article/5161/viewcontent/Liu2018_Chapter_EfficientTraceableObliviousTra.pdf |
_version_ |
1770574387508936704 |