Welcome to the resource topic for 2021/1242
Title:
Non-Interactive Differentially Anonymous Router
Authors: Benedikt Bünz, Yuncong Hu, Shin’ichiro Matsuo, Elaine Shi
Abstract:A recent work by Shi and Wu (Eurocrypt’21) sugested a new, non-interactive abstraction for anonymous routing, coined Non-Interactive Anonymous Router (\NIAR). They show how to construct a \NIAR scheme with succinct communication from bilinear groups. Unfortunately, the router needs to perform quadratic computation (in the number of senders/receivers) to perform each routing. In this paper, we show that if one is willing to relax the security notion to (\epsilon, \delta)-differential privacy, henceforth also called (\epsilon, \delta)-differential anonymity, then, a non-interactive construction exists with subquadratic router computation, also assuming standard hardness assumptions in bilinear groups. Morever, even when 1-1/\poly\log n fraction of the senders are corrupt, we can attain strong privacy parameters where \epsilon = O(1/\poly\log n) and \delta = \negl(n).
ePrint: https://eprint.iacr.org/2021/1242
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 .