WEKO3
-
RootNode
アイテム
Privacy amplification via shuffled check-ins
https://ipsj.ixsq.nii.ac.jp/records/228652
https://ipsj.ixsq.nii.ac.jp/records/228652df38874f-f612-4253-974b-7681b16dc135
名前 / ファイル | ライセンス | アクション |
---|---|---|
![]()
2025年10月23日からダウンロード可能です。
|
Copyright (c) 2023 by the Information Processing Society of Japan
|
|
非会員:¥660, IPSJ:学会員:¥330, CSEC:会員:¥0, SPT:会員:¥0, DLIB:会員:¥0 |
Item type | Symposium(1) | |||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|
公開日 | 2023-10-23 | |||||||||||
タイトル | ||||||||||||
タイトル | Privacy amplification via shuffled check-ins | |||||||||||
タイトル | ||||||||||||
言語 | en | |||||||||||
タイトル | Privacy amplification via shuffled check-ins | |||||||||||
言語 | ||||||||||||
言語 | eng | |||||||||||
資源タイプ | ||||||||||||
資源タイプ識別子 | http://purl.org/coar/resource_type/c_5794 | |||||||||||
資源タイプ | conference paper | |||||||||||
著者所属 | ||||||||||||
LINE Corporation | ||||||||||||
著者所属 | ||||||||||||
LINE Corporation | ||||||||||||
著者所属 | ||||||||||||
LINE Corporation | ||||||||||||
著者所属(英) | ||||||||||||
en | ||||||||||||
LINE Corporation | ||||||||||||
著者所属(英) | ||||||||||||
en | ||||||||||||
LINE Corporation | ||||||||||||
著者所属(英) | ||||||||||||
en | ||||||||||||
LINE Corporation | ||||||||||||
著者名 |
Seng, Pei Lie
× Seng, Pei Lie
× Satoshi, Hasegaw
× Tsubasa, Takahash
|
|||||||||||
著者名(英) |
Seng, Pei Liew
× Seng, Pei Liew
× Satoshi, Hasegawa
× Tsubasa, Takahashi
|
|||||||||||
論文抄録 | ||||||||||||
内容記述タイプ | Other | |||||||||||
内容記述 | We study a protocol for distributed computation called shuffled check-in, which achieves strong privacy guarantees without requiring any further trust assumptions beyond a trusted shuffler. Leveraging differential privacy, we show that shuffled check-in achieves tight privacy guarantees through privacy amplification, with a novel analysis based on R'enyi differential privacy that improves privacy accounting over existing work. We also introduce a numerical approach to track the privacy of generic shuffling mechanisms, including Gaussian mechanism, which is the first evaluation of a generic mechanism under the distributed setting within the local/shuffle model in the literature. Empirical studies are also given to demonstrate the efficacy of the proposed approach. | |||||||||||
論文抄録(英) | ||||||||||||
内容記述タイプ | Other | |||||||||||
内容記述 | We study a protocol for distributed computation called shuffled check-in, which achieves strong privacy guarantees without requiring any further trust assumptions beyond a trusted shuffler. Leveraging differential privacy, we show that shuffled check-in achieves tight privacy guarantees through privacy amplification, with a novel analysis based on R'enyi differential privacy that improves privacy accounting over existing work. We also introduce a numerical approach to track the privacy of generic shuffling mechanisms, including Gaussian mechanism, which is the first evaluation of a generic mechanism under the distributed setting within the local/shuffle model in the literature. Empirical studies are also given to demonstrate the efficacy of the proposed approach. | |||||||||||
書誌情報 |
コンピュータセキュリティシンポジウム2023論文集 p. 275-281, 発行日 2023-10-23 |
|||||||||||
出版者 | ||||||||||||
言語 | ja | |||||||||||
出版者 | 情報処理学会 |
Share
Cite as
Seng, Pei Lie, Satoshi, Hasegaw, Tsubasa, Takahash, 2023: 情報処理学会, 275–281 p.
Loading...