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 =...
Bounded-concurrent secure two-party computation without setup assumptions
STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computingIn this paper we study the feasibility of obtaining protocols for general two-party computation that remain secure under concurrent composition. (A general protocol can be used for obtaining secure computation of any functionality.) We consider a ...
Comments
Information & Contributors
Information
Published In
- 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
- 414Total Downloads
- Downloads (Last 12 months)414
- Downloads (Last 6 weeks)69
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