16 citations · 17 across the 6 of their papers we have counts for
9 papers
Differentially Private Compression and the Sensitivity of LZ77
Jeremiah Blocki, Seunghoon Lee, Brayan Sebastián Yepes Garcia
We initiate the study of differentially private data-compression schemes motivated by the insecurity of the popular "Compress-Then-Encrypt" framework. Data compression is a useful…
Differentially Private -Heavy Hitters in the Sliding Window Model
Jeremiah Blocki, Seunghoon Lee, Tamalika Mukherjee +1
The data management of large companies often prioritize more recent data, as a source of higher accuracy prediction than outdated data. For example, the Facebook data policy retain…
The Parallel Reversible Pebbling Game: Analyzing the Post-Quantum Security of iMHFs
Jeremiah Blocki, Blake Holman, Seunghoon Lee
The classical (parallel) black pebbling game is a useful abstraction which allows us to analyze the resources (space, space-time, cumulative space) necessary to evaluate a function…
On Explicit Constructions of Extremely Depth Robust Graphs
Jeremiah Blocki, Mike Cinkoske, Seunghoon Lee +1
A directed acyclic graph is said to be -depth robust if for every subset of nodes the graph still contains a directed path of le…
Bayesian AirComp with Sign-Alignment Precoding for Wireless Federated Learning
Chanho Park, Seunghoon Lee, Namyoon Lee
In this paper, we consider the problem of wireless federated learning based on sign stochastic gradient descent (signSGD) algorithm via a multiple access channel. When sending loca…
Bayesian Federated Learning over Wireless Networks
Seunghoon Lee, Chanho Park, Song-Nam Hong +2
Federated learning is a privacy-preserving and distributed training method using heterogeneous data sets stored at local devices. Federated learning over wireless networks requires…
On the Security of Proofs of Sequential Work in a Post-Quantum World
Jeremiah Blocki, Seunghoon Lee, Samson Zhou
A Proof of Sequential Work (PoSW) allows a prover to convince a resource-bounded verifier that the prover invested a substantial amount of sequential time to perform some underlyin…
Approximating Cumulative Pebbling Cost is Unique Games Hard
Jeremiah Blocki, Seunghoon Lee, Samson Zhou
The cumulative pebbling complexity of a directed acyclic graph is defined as , where the minimum is taken over all legal (parallel) black…
A Short Note on Improved Logic Circuits in a Hexagonal Minesweeper
Seunghoon Lee
This paper aims to present an advanced version of PP-hardness proof of Minesweeper by Bondt. The advancement includes improved Minesweeper configurations for 'logic circuits' in a…