Non-Interactive Differentially Anonymous Router

Benedikt Bünz; Yuncong Hu; Shin’ichiro Matsuo; Elaine Shi

Paper 2021/1242

Non-Interactive Differentially Anonymous Router

Benedikt Bünz, Yuncong Hu, Shin’ichiro Matsuo, and 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 -differential privacy, henceforth also called -differential anonymity, then, a non-interactive construction exists with subquadratic router computation, also assuming standard hardness assumptions in bilinear groups. Morever, even when fraction of the senders are corrupt, we can attain strong privacy parameters where and .

Metadata

Available format(s): PDF
Category: Cryptographic protocols
Publication info: Preprint. MINOR revision.
Keywords: anonymous routing differential privacy non-interactive
Contact author(s): yuncong_hu @ berkeley edu
runting @ gmail com
History: 2021-09-20: received
Short URL: https://ia.cr/2021/1242
License: CC BY

BibTeX

@misc{cryptoeprint:2021/1242,
      author = {Benedikt Bünz and Yuncong Hu and Shin’ichiro Matsuo and Elaine Shi},
      title = {Non-Interactive Differentially Anonymous Router},
      howpublished = {Cryptology {ePrint} Archive, Paper 2021/1242},
      year = {2021},
      url = {https://eprint.iacr.org/2021/1242}
}