Amplification by Shuffling without Shuffling
Abstract
References
Index Terms
- Amplification by Shuffling without Shuffling
Recommendations
On the Round Complexity of the Shuffle Model
Theory of CryptographyAbstractThe shuffle model of differential privacy [Bittau et al. SOSP 2017; Erlingsson et al. SODA 2019; Cheu et al. EUROCRYPT 2019] was proposed as a viable model for performing distributed differentially private computations. Informally, the model ...
Infinite self-shuffling words
In this paper we introduce and study a new property of infinite words: An infinite word x A N , with values in a finite set A , is said to be k-self-shuffling ( k 2 ) if x admits factorizations: x = i = 0 ∞ U i ( 1 ) U i ( k ) = i = 0 ∞ U i ( 1 ) = = i =...
Self-shuffling words
ICALP'13: Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part IIIn this paper we introduce and study a new property of infinite words which is invariant under the action of a morphism: We say an infinite word $x\in \mathbb{A}^{\mathbb N},$ defined over a finite alphabet $\mathbb{A}$, is self-shuffling if x admits ...
Comments
Information & Contributors
Information
Published In
![cover image ACM Conferences](/cms/asset/dc8a5ccc-463e-4ede-91d8-150f253e2510/3576915.cover.jpg)
- General Chairs:
- Weizhi Meng,
- Christian D. Jensen,
- Program Chairs:
- Cas Cremers,
- Engin Kirda
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Acceptance Rates
Upcoming Conference
- Sponsor:
- sigsac
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 349Total Downloads
- Downloads (Last 12 months)349
- Downloads (Last 6 weeks)52
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in