Welcome to the resource topic for 2018/237
Title:
On Tightly Secure Non-Interactive Key Exchange
Authors: Julia Hesse, Dennis Hofheinz, Lisa Kohl
Abstract:We consider the reduction loss of security reductions for non-interactive key exchange (NIKE) schemes. Currently, no tightly secure NIKE schemes exist, and in fact Bader et al. (EUROCRYPT 2016) provide a lower bound (of O(n^2), where n is the number of parties an adversary interacts with) on the reduction loss for a large class of NIKE schemes. We offer two results: the first NIKE scheme with a reduction loss of n/2 that circumvents the lower bound of Bader et al., but is of course still far from tightly secure. Second, we provide a generalization of Bader et al.'s lower bound to a larger class of NIKE schemes (that also covers our NIKE scheme), with an adapted lower bound of n/2 on the reduction loss. Hence, in that sense, the reduction for our NIKE scheme is optimal.
ePrint: https://eprint.iacr.org/2018/237
Talk: https://www.youtube.com/watch?v=qo7z2m66hW8
Slides: https://crypto.iacr.org/2018/slides/On%20Tightly%20Secure%20Non-Interactive%20Key%20Exchange.pdf
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .