Abstract
The distributed discrete logarithm (DDL) problem was introduced by Boyle, Gilboa and Ishai at CRYPTO 2016. A protocol solving this problem was the main tool used in the share conversion procedure of their homomorphic secret sharing (HSS) scheme which allows non-interactive evaluation of branching programs among two parties over shares of secret inputs. Let g be a generator of a multiplicative group G. Given a random group element gx and an unknown integer b∈ [- M, M] for a small M, two parties A and B (that cannot communicate) successfully solve DDL if A(gx) - B(gx+b) = b. Otherwise, the parties err. In the DDL protocol of Boyle et al., A and B run in time T and have error probability that is roughly linear in M / T. Since it has a significant impact on the HSS scheme’s performance, a major open problem raised by Boyle et al. was to reduce the error probability as a function of T. In this paper we devise a new DDL protocol that substantially reduces the error probability to O(M· T- 2). Our new protocol improves the asymptotic evaluation time complexity of the HSS scheme by Boyle et al. on branching programs of size S from O(S2) to O(S3 / 2). We further show that our protocol is optimal up to a constant factor for all relevant cryptographic group families, unless one can solve the discrete logarithm problem in a short interval of length R in time o(R). Our DDL protocol is based on a new type of random walk that is composed of several iterations in which the expected step length gradually increases. We believe that this random walk is of independent interest and will find additional applications.
Original language | English |
---|---|
Pages (from-to) | 824-873 |
Number of pages | 50 |
Journal | Journal of Cryptology |
Volume | 33 |
Issue number | 3 |
DOIs | |
State | Published - 1 Jul 2020 |
Bibliographical note
Publisher Copyright:© 2019, International Association for Cryptologic Research.
Funding
The authors would like to thank Elette Boyle, Niv Gilboa, Yuval Ishai and Yehuda Lindell for discussions and helpful suggestions that improved this work significantly. The authors would also like to thank the anonymous reviewers of CRYPTO 2018 and the Journal of Cryptology for their detailed and valuable comments. This research was supported by the European Research Council under the ERC starting Grant agreement n. 757731 (LightCrypt) and by the BIU Center for Research in Applied Cryptography and Cyber Security in conjunction with the Israel National Cyber Bureau in the Prime Minister’s Office. The first author was additionally supported by the Israeli Science Foundation through Grant No. 573/16. The authors would like to thank Elette Boyle, Niv Gilboa, Yuval Ishai and Yehuda Lindell for discussions and helpful suggestions that improved this work significantly. The authors would also like to thank the anonymous reviewers of CRYPTO 2018 and the Journal of Cryptology for their detailed and valuable comments. This research was supported by the European Research Council under the ERC starting Grant agreement n. 757731 (LightCrypt) and by the BIU Center for Research in Applied Cryptography and Cyber Security in conjunction with the Israel National Cyber Bureau in the Prime Minister?s Office. The first author was additionally supported by the Israeli Science Foundation through Grant No.?573/16.
Funders | Funder number |
---|---|
ERC starting | |
Israel National Cyber Bureau | |
Israeli Science Foundation | 573/16 |
European Commission | 757731 |
Israel Science Foundation | |
Center for Research in Applied Cryptography and Cyber Security, Bar-Ilan University |
Keywords
- Discrete logarithm
- Discrete logarithm in a short interval
- Fully homomorphic encryption
- Homomorphic secret sharing
- Random walk
- Share conversion