An MDS-PIR capacity-achieving protocol for distributed storage using non-MDS linear codes

Definitions for plaintext-existence hiding in cloud storage

Security notions for cloud storage and deduplication

Capacity of private linear computation for coded databases

Connections between the error probability and the r-wise Hamming distances

Asymmetry helps: Improved private information retrieval protocols for distributed storage

Local reconstruction codes: A class of MDS-PIR capacity-achieving codes

Construction D’ lattices from quasi-cyclic low-density parity-check codes

A successful subfield lattice attack on a fully homomorphic encryption scheme

A Droplet Approach Based on Raptor Codes for Distributed Computing With Straggling Servers