We define the following problem termed n×1-out-of-n oblivious transfer (n×1-out-of-n OT for short): in a system with one server and n clients, how to securely and efficiently assign n secrets to n clients by the server, with each client getting a unique secret from the server, and the server and clients remain unknown of how the secrets are distributed? This is a novel problem that is fundamentally different than 1-out-of-n OT repeated n times, and is different than k-out-of-n OT as well. Nevertheless, the proposed OT has many practical applications such as privacy-preserving data aggregation in smart grids. It can also be employed to design crypto protocols for anonymous communications and group signatures. In this paper, we propose the first algorithm to efficiently and effectively implement the n×1-out-of-n OT. We construct hidden permutation circuits to obliviously assign n secrets to n clients by the server within O((n)) time. A rigorous theoretical analysis is also carried out to investigate the security strength and performance of the protocol.
Bibliographical noteFunding Information:
This work was supported by the U.S. National Science Foundation under Grant CNS-1704397 and Grant IIS-1741279 and by the National Natural Science Foundation of China under Grant 61771289, Grant 61672321, and Grant 61373027.
Manuscript received January 19, 2018; revised May 20, 2018; accepted June 5, 2018. Date of publication June 19, 2018; date of current version May 8, 2019. This work was supported by the U.S. National Science Foundation under Grant CNS-1704397 and Grant IIS-1741279 and by the National Natural Science Foundation of China under Grant 61771289, Grant 61672321, and Grant 61373027. (Corresponding author: Jiguo Yu.) R. Li is with the Department of Computer Science, Bowling Green State University, Bowling Green, OH 43403 USA (e-mail: firstname.lastname@example.org).
© 2014 IEEE.
- Data aggregation
- oblivious transfer
- Privacy preservation
- privacy-preserving data aggregation.
- Smart grids
- Smart meters