Borja Balle, James Bell, Adrià Gascón · 2023
Motivated by recent developments in the shuffle model of differential privacy, we propose a new approximate shuffling functionality called Alternating Shuffle, and provide a protocol implementing alternating shuffling in a single-server threat model where the adversary observes all communication. Unlike previous shuffling protocols in this threat model, the per-client communication of our protocol only grows sub-linearly in the number of clients. Moreover, we study the concrete efficiency of our protocol and show it can improve per-client communication by one or more orders of magnitude with respect to previous (approximate) shuffling protocols. We also show a differential privacy amplification result for alternating shuffling analogous to the one for uniform shuffling, and demonstrate that shuffling-based protocols for secure summation based a construction of Ishai et al. remain secure under the Alternating Shuffle. In the process we also develop a protocol for exact shuffling in single-server threat model with amortized logarithmic communication per-client which might be of independent interest.
Cited by 0Open access
Borja Balle, James F. Bell, Adrià Gascón · arXiv (Cornell University) · 2023
Motivated by recent developments in the shuffle model of differential privacy, we propose a new approximate shuffling functionality called Alternating Shuffle, and provide a protocol implementing alternating shuffling in a single-server threat model where the adversary observes all communication. Unlike previous shuffling protocols in this threat model, the per-client communication of our protocol only grows sub-linearly in the number of clients. Moreover, we study the concrete efficiency of our protocol and show it can improve per-client communication by one or more orders of magnitude with respect to previous (approximate) shuffling protocols. We also show a differential privacy amplification result for alternating shuffling analogous to the one for uniform shuffling, and demonstrate that shuffling-based protocols for secure summation based a construction of Ishai et al. (FOCS'06) remain secure under the Alternating Shuffle. In the process we also develop a protocol for exact shuffling in single-server threat model with amortized logarithmic communication per-client which might be of independent interest.
Cited by 0Open access
2008
Cited by 0
Ercan Solak A, Rhouma Rhouma B, Safya Belghith B · 2015
Cited by 0
2023
Cited by 0
Jeffrey S. Kreutzer, John DeLuca, John DeLuca et al. · 2010
Cited by 0
Hikaru Suenaga, Masatoshi Goto, Kensuke Furukawa · 2004
This chapter contains sections titled: Introduction Materials For Preparation of Parental Genes For Random Fragmentation by DNase I For Collection of DNA Fragments in Specific Molecular Size Ranges For Reassembly of These Fragments by Primerless PCR For Amplification of Reassembled Products by Conventional PCR with Primers Protocol Preparation of Parental Genes Random Fragmentation by DNase I Collection of DNA Fragments in Specific Molecular Size Ranges Reassembly of These Fragments by Primerless PCR Amplification of Reassembled Products by Conventional PCR with Primers Troubleshooting Insufficient DNase I Fragmentation Little or No Product of Primerless PCR Little or No Product of PCR with Primers The Product of PCR with Primers is Multi-banded Amplification Examples References
Cited by 1
valente · Bulletin of Miscellaneous Information (Royal Gardens Kew) · 2006
Cited by 0
William F. Doran · Journal of Combinatorial Theory Series A · 1994
Cited by 3Open access
Ian Schreiber, Brenda Romero · 2021
Cited by 0
SpringerReference · 2012
Cited by 0
Satoshi Kaneko · Methods in enzymology on CD-ROM/Methods in enzymology · 2004
Cited by 2
Hannah Edelbroek, Myrte Mijnders, Ger Post · 2025
Cited by 0
Takashi Gojobori · Encyclopedia of Molecular Biology · 2002
Cited by 0
The Dictionary of Genomics, Transcriptomics and Proteomics · 2015
Cited by 0
David Jones · RePEc: Research Papers in Economics
Warehouses squander storage space by needing aisles for access to the goods. So Daedalus is inventing the '15-puzzle warehouse', based on the game in which 15 square tiles are shuffled around on a square tray with one empty space.
Cited by 0
Zitouni, Benedikte, Valérie Pihet · Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)) · 2016
Shuffling times is an ill-considered practice inside academia (and perhaps elsewhere too). Manipulating the past for present purposes, reading the future from days gone by, is considered lax at best and devious at worst. Agreed: shuffling times is risky business. Too often, the so-called “learning from the past” becomes synonymous of accepting both present and future. What has been shall be. What is now, was actually meant to be. Determinism and fatalism are risks that should not be handled carelessly. Yet, shuffling times is what we need to do.
Cited by 0Open access
Princeton University Press eBooks · 2020
Cited by 0
The Dictionary of Genomics, Transcriptomics and Proteomics · 2015
Cited by 0
Lassi A · 2016
Cited by 0