40,029 research outputs found
Bounds and Constructions for Generalized Batch Codes
Private information retrieval (PIR) codes and batch codes are two important
types of codes that are designed for coded distributed storage systems and
private information retrieval protocols. These codes have been the focus of
much attention in recent years, as they enable efficient and secure storage and
retrieval of data in distributed systems.
In this paper, we introduce a new class of codes called \emph{-batch
codes}. These codes are a type of storage codes that can handle any multi-set
of requests, comprised of distinct information symbols. Importantly,
PIR codes and batch codes are special cases of -batch codes.
The main goal of this paper is to explore the relationship between the number
of redundancy symbols and the -batch code property. Specifically, we
establish a lower bound on the number of redundancy symbols required and
present several constructions of -batch codes. Furthermore, we extend
this property to the case where each request is a linear combination of
information symbols, which we refer to as \emph{functional -batch
codes}. Specifically, we demonstrate that simplex codes are asymptotically
optimal functional -batch codes, in terms of the number of redundancy
symbols required, under certain parameter regime.Comment: 25 page
λΆμ° μ»΄ν¨ν κ³Ό μΊμλ₯Ό μ λͺ©ν μ 보 κ²μμμμ 보μ λ° νλΌμ΄λ²μ
νμλ
Όλ¬Έ(λ°μ¬)--μμΈλνκ΅ λνμ :곡과λν μ κΈ°Β·μ 보곡νλΆ,2020. 2. μ΄μ μ°.λ§μ μμ λ°μ΄ν° μ μ₯μ΄λ λ°μ΄ν° κ³μ°μ μν΄μλ λΆμ° μμ€ν
μ΄ νμμ μ΄λ€. μ΄λ¬ν λΆμ° μμ€ν
μ λ°μ΄ν° μ μ₯κ³Ό κ³μ°μ ν¨μ¨μ λμ΄λ λ°λ©΄, λ°μ΄ν°μ 보μκ³Ό νλΌμ΄λ²μμ λν μνλ μ¦κ°μν¨λ€. λ³Έ λ
Όλ¬Έμμλ λ°μ΄ν° μ μ₯κ³Ό λ°μ΄ν° κ³μ°μ μν λΆμ° μμ€ν
μμ λ°μ΄ν°μ λν 보μκ³Ό νλΌμ΄λ²μλ₯Ό κ³ λ €νλ€. νΉν, μ΄λ¬ν μμ€ν
μ λνμ¬ λ³΄μκ³Ό νλΌμ΄λ²μλ₯Ό 보μ₯νλ λΆνΈν κΈ°λ²μ μ μνλ€.
μ°μ , μ μ κ° μ¬μ μ μΊμμ μΌμ λμ λ°μ΄ν°λ₯Ό μ μ₯νκ³ μλ cache-aided PIRμ μ μνλ€. μ μνλ κΈ°λ²μ κΈ°μ‘΄ PIR λ¬Έμ μ μ΅μ κΈ°λ²μ κΈ°λ°μΌλ‘ νλ€. μ μνλ κΈ°λ²μμ, μΊμμ μ μ₯λ λ°μ΄ν°λ λΆκ°μ λ³΄λ‘ μ΄μ©λλ©°, μ΄λ μΊμκ° μμ λ λλΉ λ€μ΄λ‘λμμ κ°μλ‘ μ΄μ΄μ§λ€.
λ λ²μ§Έλ‘, λΆνΈνλ λΆμ° μ»΄ν¨ν
μμ€ν
μμ λ§μ€ν°μ νλΌμ΄λ²μλ₯Ό κ³ λ €νλ€. μ΄ μμ€ν
μμ μ컀λ€κ³Ό λ§μ€ν°λ κ°κ° κ³ μ ν λ°μ΄ν°λ₯Ό κ°μ§λ©°, μ컀λ€μ λ°μ΄ν°λ λΌμ΄λΈλ¬λ¦¬ ννλ‘ μ΄λ£¨μ΄μ§λ€. λ§μ€ν°λ μμ μ λ°μ΄ν°μ λ°μ΄ν° λΌμ΄λΈλ¬λ¦¬ λ΄ νΉμ λ°μ΄ν°μ ν¨μλ₯Ό κ³μ°ν΄μΌ νλ€. μ΄ λ λ§μ€ν°μ νλΌμ΄λ²μλ μ컀λ€μ΄ λ§μ€ν°κ° λΌμ΄λΈλ¬λ¦¬ μμ μ΄λ€ λ°μ΄ν°λ₯Ό μνλμ§ λͺ¨λ₯΄λ κ²μ λ»νλ€. μ΄λ¬ν μμ€ν
μ private coded computationμ΄λΌ νλ©°, μ μνλ κΈ°λ²μ private polynomial codesλΌ νλ€. μ μνλ κΈ°λ²μμλ κΈ°μ‘΄μ polynomial codesμμλ κ³ λ €λμ§ μμλ λΉλκΈ°μ κΈ°λ²μ΄ λμ
λλ€. μ΄λ‘ μΈνμ¬ μ μνλ κΈ°λ²μ λ³νλ μ΅μ μ RPIR κΈ°λ²λλΉ λ λΉ λ₯Έ κ³μ°μκ°μ λ¬μ±νλ€.
λμΌλ‘, λΆνΈνλ λΆμ° μ»΄ν¨ν
μμ€ν
μμ λ§μ€ν°μ νλΌμ΄λ²μμ λ°μ΄ν° 보μμ λμμ κ³ λ €νλ€. λ°μ΄ν° 보μμ λ§μ€ν°μ κ³ μ ν λ°μ΄ν°λ₯Ό μ컀λ€λ‘λΆν° 보νΈνλ κ²μ μλ―Ένλ€. μ΄λ¬ν μμ€ν
μ private secure coded computationμ΄λΌ νλ©°, μ μνλ κΈ°λ²μ private secure polynomial codesλΌ νλ€. Private polynomial codesλ₯Ό λ³ννμ¬ private secure polynomial codesμ private polynomial codesλ₯Ό κ³μ°μκ°κ³Ό ν΅μ λ μΈ‘λ©΄μμ λΉκ΅νλ€. κ·Έ κ²°κ³Ό, κ°μ μμ ν΅μ λμ λνμ¬, private secure polynomial codesκ° λ λΉ λ₯Έ κ³μ° μκ°μ λ¬μ±νλ€.As a major format of data changes from the text to the videos, the amount of memory for storing data increases exponentially, as well as the amount of computation for handling the data. As a result, to alleviate these burdens of storage and computations, the distributed systems are actively studied. Meanwhile, since low latency is one of the main objectives in 5G communications, recent techniques such as edge computing or federated learning in machine learning become important. Since the decentralized systems are fundamental characteristics of these techniques, the distributed systems which include the decentralized systems also become important.
In this dissertation, I consider the distributed systems for storage and computation. For the data storage, large-scale data centers collectively store a library of files where the size of each file is tremendous. When a user needs a specific file, it can be downloaded from distributed data centers. In this system, minimizing the amount of download is a significant concern. The user's privacy in this system implies that the user should conceal the index of its desired file against the databases. This kind of problem is referred to as private information retrieval (PIR) problem. The goal of PIR problem is to minimize the amount of download from the databases while ensuring the user's privacy.
Meanwhile, for a large amount of computation, the user can divide the whole computation into sub-computations and distribute them to external workers who constitute a distributed system. There can be three cases for the computation. Firstly, the user may own all of the data to be computed and sends both of its data and instructions for the computation to the workers. Secondly, the workers collectively own all of the data and the user just sends instructions for the data selection and computation to the workers. Thirdly, the user and the workers have their own data respectively and the user sends the data and instructions for the data selection and computation to the workers. Since some of the workers can be slow for various reasons, the user may use a coding technique, e.g., an erasure code, to avoid the delaying effect caused by the slow workers.
This kind of technique is referred to as coded computation. In these systems, speeding up the computation process is a significant concern. In this dissertation, I focus on the third system. In the considered system, the privacy is similar to that of distributed systems for storage. On the other hand, the security implies that the user should conceal the content of its own data against the workers so that the workers do not have any information about the user's own data.
In this dissertation, I consider the user's privacy in distributed systems for storage, and both of the privacy and security in distributed systems for the computation. In case of the distributed systems for storage, since the user does not have its own data, the data security on the user's data cannot be considered. Particularly, I propose some achievable schemes that ensure the privacy and security in these systems.
To begin with, as a new variation of PIR problem, I consider a user's cache that has some pre-stored data of databases' library. I refer to this problem as cache-aided PIR problem. By introducing the user's cache in the PIR problem, the amount of download from the databases is significantly reduced. The achievable scheme is based on the optimal scheme for conventional PIR problem. In the achievable scheme, the pre-store cache was exploited as an side information, which reduces the amount of download, compared to the PIR problem without cache.
Secondly, I consider the master's privacy in coded computation. In the system model, the workers have their own data, as well as the master. The workers' data constitutes a library of several files. The master should compute a function of its own data and a specific file in the library. The master's privacy implies that the workers' should not know which file in the library is desired by the user. I refer to this problem as private coded computation and propose an achievable scheme of private coded computation, namely private polynomial codes. The private polynomial codes are based on the polynomial codes which were proposed in the conventional coded computation system. In the achievable scheme, the workers are grouped for the privacy and asynchronous scheme is considered, which was not considered in the conventional polynomial codes. Due to the asynchronous scheme, the proposed scheme achieves the faster computation time, compared to the modified optimal RPIR scheme.
Lastly, I consider the data security in coded computation, as well as the master's privacy.
The system model is similar to that of private coded computation. The data security implies that the master should protect its own data against the workers. I refer to this problem as private secure coded computation and propose an achievable scheme, namely private secure polynomial codes. The private secure polynomial codes are based on the polynomial codes which were proposed in the conventional coded computation system. By modifying the private polynomial codes, the private secure polynomial codes and private secure polynomial codes are compared in terms of computation time and communication load. As a result, the private secure polynomial codes achieves faster computation time for the same communication load.1. Introduction 1
1.1 Related work 3
1.1.1 Private information retrieval 3
1.1.2 Coded computation 4
1.2 Contributions and Organization 5
2. Cache-aided Private Information Retrieval 8
2.1 Introduction 8
2.2 System model 9
2.3 Main results : 12
2.4 Achievable scheme 17
2.4.1 Cacheless phase 17
2.4.2 Cache-assisted phase 21
2.4.3 Cache-aided PIR 24
2.5 Tightness of achievable scheme 29
2.6 Conclusions and follow-up works 30
3. Private Coded Computation 32
3.1 Introduction 32
3.2 System model 37
3.3 Main results 41
3.4 Private polynomial codes 42
3.4.1 First example 42
3.4.2 Second example 48
3.4.3 General description 52
3.4.4 Privacy proof 56
3.4.5 Performance analysis 59
3.4.6 Special cases 61
3.5 Simulation results 62
3.5.1 Computation time 62
3.5.2 Communication load 68
3.6 Conclusion 69
4. Private Secure Coded Computation 71
4.1 Introduction 71
4.2 Main results 75
4.3 Private secure polynomial codes 76
4.3.1 Illustrative example 76
4.3.2 General description 80
4.3.3 Performance analysis 83
4.3.4 Privacy and security proof 84
4.4 Simulation results 85
4.4.1 Computation time 86
4.4.2 Communication load 90
4.5 Conclusion 91
5 Conclusion 93
5.1 Summary 93
5.2 Future directions 94
κ΅λ¬Έμ΄λ‘ 105
Acknowledgement 107Docto
Private Information Retrieval Schemes for Coded Data with Arbitrary Collusion Patterns
In Private Information Retrieval (PIR), one wants to download a file from a
database without revealing to the database which file is being downloaded. Much
attention has been paid to the case of the database being encoded across
several servers, subsets of which can collude to attempt to deduce the
requested file. With the goal of studying the achievable PIR rates in realistic
scenarios, we generalize results for coded data from the case of all subsets of
servers of size colluding, to arbitrary subsets of the servers. We
investigate the effectiveness of previous strategies in this new scenario, and
present new results in the case where the servers are partitioned into disjoint
colluding groups.Comment: Updated with a corrected statement of Theorem
Secure and Private Cloud Storage Systems with Random Linear Fountain Codes
An information theoretic approach to security and privacy called Secure And
Private Information Retrieval (SAPIR) is introduced. SAPIR is applied to
distributed data storage systems. In this approach, random combinations of all
contents are stored across the network. Our coding approach is based on Random
Linear Fountain (RLF) codes. To retrieve a content, a group of servers
collaborate with each other to form a Reconstruction Group (RG). SAPIR achieves
asymptotic perfect secrecy if at least one of the servers within an RG is not
compromised. Further, a Private Information Retrieval (PIR) scheme based on
random queries is proposed. The PIR approach ensures the users privately
download their desired contents without the servers knowing about the requested
contents indices. The proposed scheme is adaptive and can provide privacy
against a significant number of colluding servers.Comment: 8 pages, 2 figure
On the Asymptotic Capacity of -Secure -Private Information Retrieval with Graph Based Replicated Storage
The problem of private information retrieval with graph-based replicated
storage was recently introduced by Raviv, Tamo and Yaakobi. Its capacity
remains open in almost all cases. In this work the asymptotic (large number of
messages) capacity of this problem is studied along with its generalizations to
include arbitrary -privacy and -security constraints, where the privacy
of the user must be protected against any set of up to colluding servers
and the security of the stored data must be protected against any set of up to
colluding servers. A general achievable scheme for arbitrary storage
patterns is presented that achieves the rate , where
is the total number of servers, and each message is replicated at least
times. Notably, the scheme makes use of a special structure
inspired by dual Generalized Reed Solomon (GRS) codes. A general converse is
also presented. The two bounds are shown to match for many settings, including
symmetric storage patterns. Finally, the asymptotic capacity is fully
characterized for the case without security constraints for arbitrary
storage patterns provided that each message is replicated no more than
times. As an example of this result, consider PIR with arbitrary graph based
storage () where every message is replicated at exactly servers.
For this -replicated storage setting, the asymptotic capacity is equal to
where is the maximum size of a -matching in a
storage graph . In this undirected graph, the vertices correspond
to the set of servers, and there is an edge between vertices
only if a subset of messages is replicated at both servers and
- β¦