PIR with compressed queries and amortized query processing

S Angel, H Chen, K Laine… - 2018 IEEE symposium on …, 2018 - ieeexplore.ieee.org
Private information retrieval (PIR) is a key building block in many privacy-preserving
systems. Unfortunately, existing constructions remain very expensive. This paper introduces …

When do redundant requests reduce latency?

NB Shah, K Lee, K Ramchandran - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
Many systems possess the flexibility to serve requests in more than one way, such as
distributed storage systems that store multiple copies of the data. In such systems, the …

Codes in the sum-rank metric: Fundamentals and applications

U Martínez-Peñas, M Shehadeh… - … and Trends® in …, 2022 - nowpublishers.com
Codes in the sum-rank metric have attracted significant attention for their applications in
distributed storage systems, multishot network coding, streaming over erasure channels …

Bounds on the parameters of locally recoverable codes

I Tamo, A Barg, A Frolov - IEEE Transactions on information …, 2016 - ieeexplore.ieee.org
A locally recoverable code (LRC code) is a code over a finite alphabet, such that every
symbol in the encoding is a function of a small number of other symbols that form a …

Ensemble Prediction Algorithm of Anomaly Monitoring Based on Big Data Analysis Platform of Open‐Pit Mine Slope

S Jiang, M Lian, C Lu, Q Gu, S Ruan, X **e - Complexity, 2018 - Wiley Online Library
With the diversification of pit mine slope monitoring and the development of new
technologies such as multisource data flow monitoring, normal alert log processing system …

Distributed secure storage scheme based on sharding blockchain

J Wang, H Chenchen, Y **aofeng… - Computers …, 2022 - centaur.reading.ac.uk
Distributed storage can store data in multiple devices or servers to improve data security.
However, in today's explosive growth of network data, traditional distributed storage scheme …

Locally recoverable codes on algebraic curves

A Barg, I Tamo, S Vlăduţ - IEEE Transactions on Information …, 2017 - ieeexplore.ieee.org
A code over a finite alphabet is called locally recoverable (LRC code) if every symbol in the
encoding is a function of a small number (at most r) of other symbols of the codeword. In this …

Scalable data storage design for nonstationary IoT environment with adaptive security and reliability

A Tchernykh, M Babenko, N Chervyakov… - IEEE Internet of …, 2020 - ieeexplore.ieee.org
Internet-of-Things (IoT) environment has a dynamic nature with high risks of confidentiality,
integrity, and availability violations. The loss of information, denial of access, information …

Binary cyclic codes that are locally repairable

S Goparaju, R Calderbank - 2014 IEEE international …, 2014 - ieeexplore.ieee.org
Codes for storage systems aim to minimize the repair locality, which is the number of disks
(or nodes) that participate in the repair of a single failed disk. Simultaneously, the code must …

Constructions of Optimal Cyclic Locally Repairable Codes

B Chen, ST **a, J Hao, FW Fu - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
A code is said to be an r-local locally repairable code (LRC) if each of its coordinates can be
repaired by accessing at most r other coordinates. When some of the r coordinates are also …