Zobrazeno 1 - 10
of 2 632
pro vyhledávání: '"Blocki A"'
We introduce the notion of a conditional encryption scheme as an extension of public key encryption. In addition to the standard public key algorithms ($\mathsf{KG}$, $\mathsf{Enc}$, $\mathsf{Dec}$) for key generation, encryption and decryption, a co
Externí odkaz:
http://arxiv.org/abs/2409.06128
Differential privacy and sublinear algorithms are both rapidly emerging algorithmic themes in times of big data analysis. Although recent works have shown the existence of differentially private sublinear algorithms for many problems including graph
Externí odkaz:
http://arxiv.org/abs/2407.07262
Autor:
Block, Alexander R., Blocki, Jeremiah
We revisit computationally relaxed locally decodable codes (crLDCs) (Blocki et al., Trans. Inf. Theory '21) and give two new constructions. Our first construction is a Hamming crLDC that is conceptually simpler than prior constructions, leveraging di
Externí odkaz:
http://arxiv.org/abs/2305.01083
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 retains user search histories for $6$ months while the Google data retention
Externí odkaz:
http://arxiv.org/abs/2302.11081
Autor:
Shuting Huang, Ying Rao, Meng Zhou, Anna M. Blocki, Xiao Chen, Chunyi Wen, Dai Fei Elmer Ker, Rocky S. Tuan, Dan Michelle Wang
Publikováno v:
Bioactive Materials, Vol 36, Iss , Pp 221-237 (2024)
A significant clinical challenge in large-to-massive rotator cuff tendon injuries is the need for sustaining high mechanical demands despite limited tissue regeneration, which often results in clinical repair failure with high retear rates and long-t
Externí odkaz:
https://doaj.org/article/217bad88823b4889b81235d25957c447
We develop a framework for efficiently transforming certain approximation algorithms into differentially-private variants, in a black-box manner. Specifically, our results focus on algorithms A that output an approximation to a function f of the form
Externí odkaz:
http://arxiv.org/abs/2210.03831
Autor:
Block, Alex, Blocki, Jeremiah, Cheng, Kuan, Grigorescu, Elena, Li, Xin, Zheng, Yu, Zhu, Minshen
Locally Decodable Codes (LDCs) are error-correcting codes $C:\Sigma^n\rightarrow \Sigma^m$ with super-fast decoding algorithms. They are important mathematical objects in many areas of theoretical computer science, yet the best constructions so far h
Externí odkaz:
http://arxiv.org/abs/2209.08688
In the past decade, billions of user passwords have been exposed to the dangerous threat of offline password cracking attacks. An offline attacker who has stolen the cryptographic hash of a user's password can check as many password guesses as s/he l
Externí odkaz:
http://arxiv.org/abs/2206.12970
Autor:
Xiong, Aiping, Wu, Chuhao, Wang, Tianhao, Proctor, Robert W., Blocki, Jeremiah, Li, Ninghui, Jha, Somesh
Proper communication is key to the adoption and implementation of differential privacy (DP). However, a prior study found that laypeople did not understand the data perturbation processes of DP and how DP noise protects their sensitive personal infor
Externí odkaz:
http://arxiv.org/abs/2202.10014
We initiate a systematic study of algorithms that are both differentially private and run in sublinear time for several problems in which the goal is to estimate natural graph parameters. Our main result is a differentially-private $(1+\rho)$-approxi
Externí odkaz:
http://arxiv.org/abs/2202.05776