Oblivious Transfer Based on NTRUEncrypt

Oblivious transfer (OT) is the most fundamental process in cryptosystems and serves as the basic building block for implementing protocols, such as the secure multi-party computation and the fair electronic contract. However, since most implementations of the Internet of Things are time-sensitive, e...

Full description

Saved in:
Bibliographic Details
Published in:IEEE access 2018-01, Vol.6, p.35283-35291
Main Authors: Mi, Bo, Huang, Darong, Wan, Shaohua, Mi, Libo, Cao, Jianqiu
Format: Article
Language:English
Subjects:
Computational efficiency
Computational modeling
Computer systems
Cryptography
Encryption
Internet of Things
NTRUEncrypt
oblivious transfer
Protocol
Protocol (computers)
Protocols
random oracle
Receivers
Security
universal composability
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Oblivious transfer (OT) is the most fundamental process in cryptosystems and serves as the basic building block for implementing protocols, such as the secure multi-party computation and the fair electronic contract. However, since most implementations of the Internet of Things are time-sensitive, existing works that are based on traditional public cryptosystems are not efficient or secure under quantum machine attacks. In this paper, we argued that the fastest known 1-out-of-n oblivious transfer ( {\mathrm {OT}}_{n}^{1} ) protocol, which was proposed by Chou, cannot achieve semantic security and is time-consuming due to exponent arithmetic of large parameters. Utilizing NTRUEncrypt and OT extension, we devised a one-round post-quantum secure {\mathrm {OT}}_{n}^{1} protocol that is also proved to be active and adaptively secure under the universal composability framework. Compared with Chou's protocol, the computational overheads of our scheme are approximately 6 and 1.7 times smaller on the sender and receiver sides, in line with the standard security level.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2018.2846798