Paper 2016/585
Breaking the Circuit Size Barrier for Secure Computation Under DDH
Elette Boyle, Niv Gilboa, and Yuval Ishai
Abstract
Under the Decisional Diffie-Hellman (DDH) assumption, we present a 2-out-of-2 secret sharing scheme that supports a compact evaluation of branching programs on the shares. More concretely, there is an evaluation algorithm
Note: Preliminary full version of the Crypto 2016 paper.
Metadata
- Available format(s)
-
PDF
- Publication info
- Published by the IACR in CRYPTO 2016
- Keywords
- Secure computationfunction secret sharingprivate information retrievalfully homomorphic encryption
- Contact author(s)
-
eboyle @ alum mit edu
gilboan @ bgu ac il
yuvali @ cs technion ac il - History
- 2016-09-02: last of 3 revisions
- 2016-06-06: received
- See all versions
- Short URL
- https://ia.cr/2016/585
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2016/585, author = {Elette Boyle and Niv Gilboa and Yuval Ishai}, title = {Breaking the Circuit Size Barrier for Secure Computation Under {DDH}}, howpublished = {Cryptology {ePrint} Archive, Paper 2016/585}, year = {2016}, url = {https://eprint.iacr.org/2016/585} }