CryptoDB
Simpler Statistically Sender Private Oblivious Transfer from Ideals of Cyclotomic Integers
| Authors: | |
|---|---|
| Download: | |
| Presentation: | Slides |
| Abstract: | We present a two-message oblivious transfer protocol achieving statistical sender privacy and computational receiver privacy based on the RLWE assumption for cyclotomic number fields. This work improves upon prior lattice-based statistically sender-private oblivious transfer protocols by reducing the total communication between parties by a factor O(nlogq) for transfer of length O(n) messages. Prior work of Brakerski and Dottling uses transference theorems to show that either a lattice or its dual must have short vectors, the existence of which guarantees lossy encryption for encodings with respect to that lattice, and therefore statistical sender privacy. In the case of ideal lattices from embeddings of cyclotomic integers, the existence of one short vector implies the existence of many, and therefore encryption with respect to either a lattice or its dual is guaranteed to ``lose" more information about the message than can be ensured in the case of general lattices. This additional structure of ideals of cyclotomic integers allows for efficiency improvements beyond those that are typical when moving from the generic to ideal lattice setting, resulting in smaller message sizes for sender and receiver, as well as a protocol that is simpler to describe and analyze. |
Video from ASIACRYPT 2020
BibTeX
@article{asiacrypt-2020-30726,
title={Simpler Statistically Sender Private Oblivious Transfer from Ideals of Cyclotomic Integers},
booktitle={Advances in Cryptology - ASIACRYPT 2020},
publisher={Springer},
doi={10.1007/978-3-030-64834-3_13},
author={Daniele Micciancio and Jessica Sorrell},
year=2020
}