A Practical Framework for t-Out-of- n Oblivious Transfer With Security Against Covert Adversaries

Oblivious transfer plays a fundamental role in the area of secure distributed computation. In particular, this primitive is used to search items in decentralized databases. Using a variant of smooth projective hash previously presented by Zeng , we construct a practical framework for t -out-of- n ob...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information forensics and security 2012-04, Vol.7 (2), p.465-479
Main Authors: Bing Zeng, Tartary, Christophe, Peng Xu, Jiandu Jing, Xueming Tang
Format: Article
Language:English
Subjects:
Computation
Computational security
Computer information security
covert adversaries
Cryptography
Decentralized
Indexes
Learning
oblivious transfer
Protocols
Receivers
Searching
secure multiparty computation
Security
smooth projective hashing
Vectors
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 plays a fundamental role in the area of secure distributed computation. In particular, this primitive is used to search items in decentralized databases. Using a variant of smooth projective hash previously presented by Zeng , we construct a practical framework for t -out-of- n oblivious transfer in the plain model without any set-up assumption. It can be implemented under a variety of standard intractability assumptions, including the decisional Diffie-Hellman assumption, the decisional N -th residuosity assumption, the decisional quadratic residuosity assumption, and the learning with error problem. It is computationally secure in the presence of covert adversaries and only requires four rounds of communication. Compared to existing practical protocols with fully-simulatable security against covert adversaries or malicious adversaries, our framework is generally more efficient.
ISSN:1556-6013
1556-6021
DOI:10.1109/TIFS.2012.2184096