Paper 2019/1340

Secret Shared Shuffle

Melissa Chase, Esha Ghosh, and Oxana Poburinnaya

Abstract

Generating secret shares of a shuffled dataset - such that neither party knows the order in which it is permuted - is a fundamental building block in many protocols, such as secure collaborative filtering, oblivious sorting, and secure function evaluation on set intersection. Traditional approaches to this problem either involve expensive public-key based crypto or using symmetric crypto on permutation networks. While public-key based solutions are bandwidth efficient, they are computation-bound. On the other hand, permutation network based constructions are communication-bound, especially when the elements are long, for example feature vectors in an ML context. We design a new 2-party protocol for this task of computing secret shares of shuffled data, which we refer to as secret-shared shuffle. Our protocol is secure against static semi-honest adversary. At the heart of our approach is a new method of obtaining two sets of pseudorandom shares which are ``correlated via the permutation'', which can be implemented with low communication using GGM puncturable PRFs. This gives a new protocol for secure shuffle which is concretely more efficient than the existing techniques in the literature. In particular, we are three orders of magnitude faster than public key based approach and one order of magnitude faster compared to the best known symmetric-key cryptography approach based on permutation network when the elements are moderately large.

Note: In the previous eprint version we had an error in the scripts used to compute timings which also resulted in incorrect optimal parameters for the experiments. This version corrects that error, and presents adjusted parameters to obtain optimal results.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
A major revision of an IACR publication in Asiacrypt 2020
Keywords
secure shufflesecure function evaluationpuncturable PRF
Contact author(s)
Esha Ghosh @ microsoft com
melissac @ microsoft com
oxanapob @ bu edu
History
2020-10-01: revised
2019-11-22: received
See all versions
Short URL
https://ia.cr/2019/1340
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2019/1340,
      author = {Melissa Chase and Esha Ghosh and Oxana Poburinnaya},
      title = {Secret Shared Shuffle},
      howpublished = {Cryptology ePrint Archive, Paper 2019/1340},
      year = {2019},
      note = {\url{https://eprint.iacr.org/2019/1340}},
      url = {https://eprint.iacr.org/2019/1340}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.