Imagen de Portada

Shuffling Cards When You Are of Very Little Brain: Low Memory Generation of Permutations

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Menuhin, Boaz, Naor, Moni
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Cryptography and Security Information Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the instance optimality of detecting collisions and subgraphs
por: Ben-Eliezer, Omri, et al.
Publicado: (2023)

Analysis of Shuffling Beyond Pure Local Differential Privacy
por: Takagi, Shun, et al.
Publicado: (2026)

Private Vector Mean Estimation in the Shuffle Model: Optimal Rates Require Many Messages
por: Asi, Hilal, et al.
Publicado: (2024)

Compression with Privacy-Preserving Random Access
por: Chandar, Venkat, et al.
Publicado: (2025)

Necessity of Block Designs for Optimal Locally Private Distribution Estimation
por: Gentle, Abigail
Publicado: (2025)

Meeting Utility Constraints in Differential Privacy: A Privacy-Boosting Approach
por: Jiang, Bo, et al.
Publicado: (2024)

Concurrent Composition for Interactive Differential Privacy with Adaptive Privacy-Loss Parameters
por: Haney, Samuel, et al.
Publicado: (2023)

Almost Instance-optimal Clipping for Summation Problems in the Shuffle Model of Differential Privacy
por: Dong, Wei, et al.
Publicado: (2024)

Private Synthetic Data Generation in Bounded Memory
por: Holland, Rayne, et al.
Publicado: (2024)

Reveal-or-Obscure: A Differentially Private Sampling Algorithm for Discrete Distributions
por: Tasnim, Naima, et al.
Publicado: (2025)

Optimal Differentially Private Sampling of Unbounded Gaussians
por: Iverson, Valentio, et al.
Publicado: (2025)

Mean estimation in the add-remove model of differential privacy
por: Kulesza, Alex, et al.
Publicado: (2023)

Mixtures of Gaussians are Privately Learnable with a Polynomial Number of Samples
por: Afzali, Mohammad, et al.
Publicado: (2023)

Robustness Implies Privacy in Statistical Estimation
por: Hopkins, Samuel B., et al.
Publicado: (2022)

Online Distribution Learning with Local Private Constraints
por: Sima, Jin, et al.
Publicado: (2024)

Private Mean Estimation with Person-Level Differential Privacy
por: Agarwal, Sushant, et al.
Publicado: (2024)

Agnostic Private Density Estimation for GMMs via List Global Stability
por: Afzali, Mohammad, et al.
Publicado: (2024)

Low-degree Security of the Planted Random Subgraph Problem
por: Bogdanov, Andrej, et al.
Publicado: (2024)

Scalable DP-SGD: Shuffling vs. Poisson Subsampling
por: Chua, Lynn, et al.
Publicado: (2024)

Invertible Bloom Lookup Tables with Less Memory and Randomness
por: Fleischhacker, Nils, et al.
Publicado: (2023)

Cryptanalysis of the SIMON Cypher Using Neo4j
por: Cook, Jonathan, et al.
Publicado: (2024)

Better Differentially Private Approximate Histograms and Heavy Hitters using the Misra-Gries Sketch
por: Lebeda, Christian Janos, et al.
Publicado: (2023)

Learning from End User Data with Shuffled Differential Privacy over Kernel Densities
por: Wagner, Tal
Publicado: (2025)

The Broader Landscape of Robustness in Algorithmic Statistics
por: Kamath, Gautam
Publicado: (2024)

Better and Simpler Lower Bounds for Differentially Private Statistical Estimation
por: Narayanan, Shyam
Publicado: (2023)

Optimal Rates for Differentially Private Hypothesis Testing with E-values
por: Jacobsen, Ben, et al.
Publicado: (2026)

CoinPress: Practical Private Mean and Covariance Estimation
por: Biswas, Sourav, et al.
Publicado: (2020)

An average case efficient algorithm for solving two-variable linear Diophantine equations
por: Deora, Mayank, et al.
Publicado: (2024)

Near-Optimal Generalized Private Testing
por: Chaturvedi, Anamay, et al.
Publicado: (2026)

Smooth Lower Bounds for Differentially Private Algorithms via Padding-and-Permuting Fingerprinting Codes
por: Peter, Naty, et al.
Publicado: (2023)

OciorCOOL: Faster Byzantine Agreement and Reliable Broadcast
por: Chen, Jinyuan
Publicado: (2024)

Near-Optimal Differentially Private k-Core Decomposition
por: Dhulipala, Laxman, et al.
Publicado: (2023)

The Needle is a Thread: Finding Planted Paths in Noisy Process Trees
por: Le, Maya, et al.
Publicado: (2026)

Improved Differentially Private Algorithms for Rank Aggregation
por: Hillebrand, Quentin, et al.
Publicado: (2025)

Private Lossless Multiple Release
por: Andersson, Joel Daniel, et al.
Publicado: (2025)

Space-Efficient Private Estimation of Quantiles
por: Cafaro, Massimo, et al.
Publicado: (2025)

Differentially Private Matchings
por: Dinitz, Michael, et al.
Publicado: (2025)

Private Hyperparameter Tuning with Ex-Post Guarantee
por: Ghazi, Badih, et al.
Publicado: (2025)

Differentially Private Space-Efficient Algorithms for Counting Distinct Elements in the Turnstile Model
por: Cummings, Rachel, et al.
Publicado: (2025)

Differentially Private Set Representations
por: Patel, Sarvar, et al.
Publicado: (2025)