doi: 10.3934/amc.2020070

Capacity-achieving private information retrieval scheme with a smaller sub-packetization

1. 

School of Mathematics, Southwest Jiaotong University, Chengdu, 610031, China

2. 

State Key Laboratory of Cryptology, P. O. Box 5159, Beijing, 100878, China

3. 

Department of Computer Science and Software Engineering, University of Melbourne, Melbourne, Australia

4. 

Institute for Communications Engineering, Technical University of Munich, Germany

Received  April 2019 Revised  February 2020 Published  April 2020

Fund Project: The work of W. Zhang and Z. Zhou was supported by the National Natural Science Foundation of China under Grant 61672028, and partially supported by National Cryptography Development Fund under Grant MMJJ20180103. Vladimir Sidorenko is on leave from Institute for Information Transmission Problems, Russian Academy of Sciences. His work is supported by the Russian Government, Contract No 14.W03.31.0019

Private information retrieval (PIR) allows a user to retrieve one out of $ M $ messages from $ N $ servers without revealing the identity of the desired message. Every message consists of $ L $ symbols (packets) from an additive group and the length $ L $ is called the sub-packetization. A PIR scheme with download cost (DC) $ D/L $ is implemented by querying $ D $ sums of the symbols to servers. We assume that each uncoded server can store up to $ tLM/N $ symbols, $ t\in\{1,2,\cdots,N\} $. The minimum DC of storage constrained PIR was determined by Attia et al. in 2018 to be $ DC_{min} = 1+1/t+1/t^{2}+\cdots+1/t^{M-1} $. The capacity of storage constrained PIR (equivalently, the reciprocal of minimum download cost) is the maximum number of bits of desired symbols that can be privately retrieved per bit of downloaded symbols. Tandon et al. designed a capacity-achieving PIR scheme with sub-packetization $ L' = {N\choose t}t^{M} $ of each message. In this paper, we design a PIR scheme with $ t $ times smaller sub-packetization $ L'/t $ and with the minimum DC for any parameters $ N, M, t $. We also prove that $ t^{M-1} $ is a factor of sub-packetization $ L $ for any capacity-achieving PIR scheme from storage constrained servers.

Citation: Wenqin Zhang, Zhengchun Zhou, Udaya Parampalli, Vladimir Sidorenko. Capacity-achieving private information retrieval scheme with a smaller sub-packetization. Advances in Mathematics of Communications, doi: 10.3934/amc.2020070
References:
[1]

M. A. AttiaD. Kumar and R. Tandon, The capacity of uncoded storage constrained PIR, 2018 IEEE International Symposium on Information Theory, (2018), 1959-1963.  doi: 10.1109/ISIT.2018.8437729.  Google Scholar

[2]

K. Banawan and S. Ulukus, Multi-message private information retrieval: Capacity results and near-optimal schemes, IEEE Trans. Inform. Theory, 64 (2018), 6842-6862.  doi: 10.1109/TIT.2018.2828310.  Google Scholar

[3]

K. Banawan and S. Ulukus, The capacity of private information retrieval from byzantine and colluding databases, IEEE Transactions on Information Theory, 65 (2018), 1206–1219, arXiv: 1706.01442. doi: 10.1109/TIT.2018.2869154.  Google Scholar

[4]

K. Banawan and S. Ulukus, The capacity of private information retrieval from coded databases, IEEE Transactions Information Theory, 64 (2018), 1945-1956.  doi: 10.1109/TIT.2018.2791994.  Google Scholar

[5]

Z. Chen, Z. Y. Wang and S. Jafar, The capacity of private information retrieval with private side information, (2017), arXiv: 1709.03022. Google Scholar

[6]

B. ChorO. GoldreichE. Kushilevitz and M. Sudan, Private information retrieval, 36th Annual Symposium on Foundations of Computer Science, (1995), 41-50.  doi: 10.1109/SFCS.1995.492461.  Google Scholar

[7]

R. Freij-HollantiO. W. GnilkeC. Hollanti and D. A. Karpuk, Private information retrieval from coded databases with colluding servers, SIAM Journal on Applied Algebra and Geometry, 1 (2017), 647-664.  doi: 10.1137/16M1102562.  Google Scholar

[8]

S. Kadhe, B. Garcia, A. Heidarzadeh, S. El Rouayheb and A. Sprintson, Private information retrieval with side information, (2017), arXiv: 1709.00112. Google Scholar

[9]

H. Sun and S. A. Jafar, The capacity of private information retrieval, IEEE Transactions Information Theory, 63 (2017), 4075-4088.  doi: 10.1109/TIT.2017.2689028.  Google Scholar

[10]

H. Sun and S. A. Jafar, The capacity of symmetric private information retrieval, 2016 IEEE Globecom Workshops, Washington, DC, USA, (2016), 1-5.   Google Scholar

[11]

H. Sun and S. A. Jafar, The capacity of private information retrieval with colluding databases, IEEE Trans. Inform. Theory, 64 (2018), 2361-2370.  doi: 10.1109/TIT.2017.2777490.  Google Scholar

[12]

H. Sun and S. A. Jafar, Private information retrieval from MDS coded data with colluding servers: Settling a conjecture by Freij-Hollanti et al., IEEE Transactions Information Theory, 64 (2018), 1000-1022.  doi: 10.1109/TIT.2017.2779454.  Google Scholar

[13]

H. Sun and S. A. Jafar, Optimal download cost of private information retrieval for arbitrary message length, IEEE Transactions Information Forensics and Security, 12 (2017), 2920-2932.   Google Scholar

[14]

R. TajeddineO. W. Gnilke and S. El Rouayheb, Private information retrieval from MDS coded data in distributed storage systems, IEEE Trans. Inform. Theory, 64 (2018), 7081-7093.  doi: 10.1109/TIT.2018.2815607.  Google Scholar

[15]

R. TandonM. Abdul-WahidF. Almoualem and D. Kumar, PIR from storage constrained databases - coded caching meets PIR, 2018 IEEE International Conference on Communications, (2018), 1-7.   Google Scholar

[16]

Q. W. Wang and M. Skoglund, Symmetric private information retrieval for MDS coded distributed storage, IEEE International Conference on Communications, (2017), 1-6.  doi: 10.1109/ICC.2017.7997029.  Google Scholar

[17]

N. Woolsey, R.-R. Chen and M. Y. Ji, A new design of private information retrieval for storage constrained databases, (2019), arXiv: 1901.07490. doi: 10.1109/ISIT.2019.8849767.  Google Scholar

[18]

J. K. Xu and Z. F. Zhang, On sub-packetization of capacity-achieving PIR schemes for MDS coded databases, (2017), arXiv: 1712.02466. Google Scholar

[19]

Y. W. Zhang and G. N. Ge, A general private information retrieval scheme for MDS coded databases with colluding servers, (2017), arXiv: 1704.06785. doi: 10.1007/s10623-019-00640-x.  Google Scholar

[20]

Y. W. Zhang and G. N. Ge, Multi-file private information retrieval from MDS coded databases with colluding servers, (2017), arXiv: 1705.03186. Google Scholar

[21]

Z. F. Zhang and J. K. Xu, Capacity-achieving PIR schemes with optimal sub-packetization, (2017), arXiv: 1710.11370. Google Scholar

show all references

References:
[1]

M. A. AttiaD. Kumar and R. Tandon, The capacity of uncoded storage constrained PIR, 2018 IEEE International Symposium on Information Theory, (2018), 1959-1963.  doi: 10.1109/ISIT.2018.8437729.  Google Scholar

[2]

K. Banawan and S. Ulukus, Multi-message private information retrieval: Capacity results and near-optimal schemes, IEEE Trans. Inform. Theory, 64 (2018), 6842-6862.  doi: 10.1109/TIT.2018.2828310.  Google Scholar

[3]

K. Banawan and S. Ulukus, The capacity of private information retrieval from byzantine and colluding databases, IEEE Transactions on Information Theory, 65 (2018), 1206–1219, arXiv: 1706.01442. doi: 10.1109/TIT.2018.2869154.  Google Scholar

[4]

K. Banawan and S. Ulukus, The capacity of private information retrieval from coded databases, IEEE Transactions Information Theory, 64 (2018), 1945-1956.  doi: 10.1109/TIT.2018.2791994.  Google Scholar

[5]

Z. Chen, Z. Y. Wang and S. Jafar, The capacity of private information retrieval with private side information, (2017), arXiv: 1709.03022. Google Scholar

[6]

B. ChorO. GoldreichE. Kushilevitz and M. Sudan, Private information retrieval, 36th Annual Symposium on Foundations of Computer Science, (1995), 41-50.  doi: 10.1109/SFCS.1995.492461.  Google Scholar

[7]

R. Freij-HollantiO. W. GnilkeC. Hollanti and D. A. Karpuk, Private information retrieval from coded databases with colluding servers, SIAM Journal on Applied Algebra and Geometry, 1 (2017), 647-664.  doi: 10.1137/16M1102562.  Google Scholar

[8]

S. Kadhe, B. Garcia, A. Heidarzadeh, S. El Rouayheb and A. Sprintson, Private information retrieval with side information, (2017), arXiv: 1709.00112. Google Scholar

[9]

H. Sun and S. A. Jafar, The capacity of private information retrieval, IEEE Transactions Information Theory, 63 (2017), 4075-4088.  doi: 10.1109/TIT.2017.2689028.  Google Scholar

[10]

H. Sun and S. A. Jafar, The capacity of symmetric private information retrieval, 2016 IEEE Globecom Workshops, Washington, DC, USA, (2016), 1-5.   Google Scholar

[11]

H. Sun and S. A. Jafar, The capacity of private information retrieval with colluding databases, IEEE Trans. Inform. Theory, 64 (2018), 2361-2370.  doi: 10.1109/TIT.2017.2777490.  Google Scholar

[12]

H. Sun and S. A. Jafar, Private information retrieval from MDS coded data with colluding servers: Settling a conjecture by Freij-Hollanti et al., IEEE Transactions Information Theory, 64 (2018), 1000-1022.  doi: 10.1109/TIT.2017.2779454.  Google Scholar

[13]

H. Sun and S. A. Jafar, Optimal download cost of private information retrieval for arbitrary message length, IEEE Transactions Information Forensics and Security, 12 (2017), 2920-2932.   Google Scholar

[14]

R. TajeddineO. W. Gnilke and S. El Rouayheb, Private information retrieval from MDS coded data in distributed storage systems, IEEE Trans. Inform. Theory, 64 (2018), 7081-7093.  doi: 10.1109/TIT.2018.2815607.  Google Scholar

[15]

R. TandonM. Abdul-WahidF. Almoualem and D. Kumar, PIR from storage constrained databases - coded caching meets PIR, 2018 IEEE International Conference on Communications, (2018), 1-7.   Google Scholar

[16]

Q. W. Wang and M. Skoglund, Symmetric private information retrieval for MDS coded distributed storage, IEEE International Conference on Communications, (2017), 1-6.  doi: 10.1109/ICC.2017.7997029.  Google Scholar

[17]

N. Woolsey, R.-R. Chen and M. Y. Ji, A new design of private information retrieval for storage constrained databases, (2019), arXiv: 1901.07490. doi: 10.1109/ISIT.2019.8849767.  Google Scholar

[18]

J. K. Xu and Z. F. Zhang, On sub-packetization of capacity-achieving PIR schemes for MDS coded databases, (2017), arXiv: 1712.02466. Google Scholar

[19]

Y. W. Zhang and G. N. Ge, A general private information retrieval scheme for MDS coded databases with colluding servers, (2017), arXiv: 1704.06785. doi: 10.1007/s10623-019-00640-x.  Google Scholar

[20]

Y. W. Zhang and G. N. Ge, Multi-file private information retrieval from MDS coded databases with colluding servers, (2017), arXiv: 1705.03186. Google Scholar

[21]

Z. F. Zhang and J. K. Xu, Capacity-achieving PIR schemes with optimal sub-packetization, (2017), arXiv: 1710.11370. Google Scholar

Table 1.  Sub-messages stored in the servers
$ Serv^1 $ $ Serv^2 $ $ Serv^3 $
$ A_{12}, A_{13} $ $ A_{12}, A_{23} $ $ A_{13}, A_{23} $
$ B_{12}, B_{13} $ $ B_{12}, B_{23} $ $ B_{13}, B_{23} $
$ C_{12}, C_{13} $ $ C_{12}, C_{23} $ $ C_{13}, C_{23} $
$ Serv^1 $ $ Serv^2 $ $ Serv^3 $
$ A_{12}, A_{13} $ $ A_{12}, A_{23} $ $ A_{13}, A_{23} $
$ B_{12}, B_{13} $ $ B_{12}, B_{23} $ $ B_{13}, B_{23} $
$ C_{12}, C_{13} $ $ C_{12}, C_{23} $ $ C_{13}, C_{23} $
Table 2.  Symbols stored in the servers
$ Serv^1 $ $ Serv^2 $ $ Serv^3 $
$ \underline{a^1_{12}},\; \underline{a^2_{12}} $ $ \underline{a^1_{12}},\; \underline{a^2_{12}} $ $ \underline{a^1_{13}},\; \underline{a^2_{13}} $
$ \underline{a^1_{13}},\; \underline{a^2_{13}} $ $ \underline{a^1_{23}},\; \underline{a^2_{23}} $ $ \underline{a^1_{23}},\; \underline{a^2_{23}} $
$ \underline{b^1_{12}},\; \underline{b^2_{12}} $ $ \underline{b^1_{12}},\; \underline{b^2_{12}} $ $ \underline{b^1_{13}},\; \underline{b^2_{13}} $
$ \underline{b^1_{13}},\; \underline{b^2_{13}} $ $ \underline{b^1_{23}},\; \underline{b^2_{23}} $ $ \underline{b^1_{23}},\; \underline{b^2_{23}} $
$ Serv^1 $ $ Serv^2 $ $ Serv^3 $
$ \underline{a^1_{12}},\; \underline{a^2_{12}} $ $ \underline{a^1_{12}},\; \underline{a^2_{12}} $ $ \underline{a^1_{13}},\; \underline{a^2_{13}} $
$ \underline{a^1_{13}},\; \underline{a^2_{13}} $ $ \underline{a^1_{23}},\; \underline{a^2_{23}} $ $ \underline{a^1_{23}},\; \underline{a^2_{23}} $
$ \underline{b^1_{12}},\; \underline{b^2_{12}} $ $ \underline{b^1_{12}},\; \underline{b^2_{12}} $ $ \underline{b^1_{13}},\; \underline{b^2_{13}} $
$ \underline{b^1_{13}},\; \underline{b^2_{13}} $ $ \underline{b^1_{23}},\; \underline{b^2_{23}} $ $ \underline{b^1_{23}},\; \underline{b^2_{23}} $
Table 3.  Queries to download message $ A $
$ Serv^1 $ $ Serv^2 $ $ Serv^3 $
$ a^1_{12} $ $ a^1_{23} $ $ a^1_{13} $
$ b^1_{12} $ $ b^1_{23} $ $ b^1_{13} $
$ a^2_{13}+ b^1_{13} $ $ a^2_{12}+ b^1_{12} $ $ a^2_{23}+ b^1_{23} $
$ Serv^1 $ $ Serv^2 $ $ Serv^3 $
$ a^1_{12} $ $ a^1_{23} $ $ a^1_{13} $
$ b^1_{12} $ $ b^1_{23} $ $ b^1_{13} $
$ a^2_{13}+ b^1_{13} $ $ a^2_{12}+ b^1_{12} $ $ a^2_{23}+ b^1_{23} $
Table 4.  Queries to download message $ B $
$ Serv^1 $ $ Serv^2 $ $ Serv^3 $
$ b^1_{12} $ $ b^1_{23} $ $ b^1_{13} $
$ a^1_{12} $ $ a^1_{23} $ $ a^1_{13} $
$ b^2_{13}+a^1_{13} $ $ b^2_{12}+a^1_{12} $ $ b^2_{23}+a^1_{23} $
$ Serv^1 $ $ Serv^2 $ $ Serv^3 $
$ b^1_{12} $ $ b^1_{23} $ $ b^1_{13} $
$ a^1_{12} $ $ a^1_{23} $ $ a^1_{13} $
$ b^2_{13}+a^1_{13} $ $ b^2_{12}+a^1_{12} $ $ b^2_{23}+a^1_{23} $
Table 5.  Sub-messages stored in the servers
$ Serv^1 $ $ Serv^2 $ $ Serv^3 $ $ Serv^4 $ $ Serv^5 $
$ A_{12}, A_{13} $ $ A_{12}, A_{23} $ $ A_{13}, A_{23} $ $ A_{14}, A_{24} $ $ A_{15}, A_{25} $
$ A_{14}, A_{15} $ $ A_{24}, A_{25} $ $ A_{34}, A_{35} $ $ A_{34}, A_{45} $ $ A_{35}, A_{45} $
$ B_{12}, B_{13} $ $ B_{12}, B_{23} $ $ B_{13}, B_{23} $ $ B_{14}, B_{24} $ $ B_{15}, B_{25} $
$ B_{14}, B_{15} $ $ B_{24}, B_{25} $ $ B_{34}, B_{35} $ $ B_{34}, B_{45} $ $ B_{35}, B_{45} $
$ C_{12}, C_{13} $ $ C_{12}, C_{23} $ $ C_{13}, C_{23} $ $ C_{14}, C_{24} $ $ C_{15}, C_{25} $
$ C_{14}, C_{15} $ $ C_{24}, C_{25} $ $ C_{34}, C_{35} $ $ C_{34}, C_{45} $ $ C_{35}, C_{45} $
$ Serv^1 $ $ Serv^2 $ $ Serv^3 $ $ Serv^4 $ $ Serv^5 $
$ A_{12}, A_{13} $ $ A_{12}, A_{23} $ $ A_{13}, A_{23} $ $ A_{14}, A_{24} $ $ A_{15}, A_{25} $
$ A_{14}, A_{15} $ $ A_{24}, A_{25} $ $ A_{34}, A_{35} $ $ A_{34}, A_{45} $ $ A_{35}, A_{45} $
$ B_{12}, B_{13} $ $ B_{12}, B_{23} $ $ B_{13}, B_{23} $ $ B_{14}, B_{24} $ $ B_{15}, B_{25} $
$ B_{14}, B_{15} $ $ B_{24}, B_{25} $ $ B_{34}, B_{35} $ $ B_{34}, B_{45} $ $ B_{35}, B_{45} $
$ C_{12}, C_{13} $ $ C_{12}, C_{23} $ $ C_{13}, C_{23} $ $ C_{14}, C_{24} $ $ C_{15}, C_{25} $
$ C_{14}, C_{15} $ $ C_{24}, C_{25} $ $ C_{34}, C_{35} $ $ C_{34}, C_{45} $ $ C_{35}, C_{45} $
Table 6.  Queries to download message $ A $
$ Serv^1 $ $ Serv^2 $ $ Serv^3 $ $ Serv^4 $ $ Serv^5 $
Step $ 1 $ $ a^1_{12},\; a^1_{13} $ $ a^1_{23},\; a^1_{24} $ $ a^1_{34},\; a^1_{35} $ $ a^1_{14},\; a^1_{45} $ $ a^1_{15},\; a^1_{25} $
$ b^1_{12},\; b^1_{13} $ $ b^1_{23},\; b^1_{24} $ $ b^1_{34},\; b^1_{35} $ $ b^1_{14},\; b^1_{45} $ $ b^1_{15},\; b^1_{25} $
$ c^1_{12},\; c^1_{13} $ $ c^1_{23},\; c^1_{24} $ $ c^1_{34},\; c^1_{35} $ $ c^1_{14},\; c^1_{45} $ $ c^1_{15},\; c^1_{25} $
Step $ 2 $ $ a^2_{14}+b^1_{14} $ $ a^2_{12}+b^1_{12} $ $ a^2_{13}+b^1_{13} $ $ a^2_{24}+b^1_{24} $ $ a^2_{35}+b^1_{35} $
$ a^3_{14}+c^1_{14} $ $ a^3_{12}+c^1_{12} $ $ a^3_{13}+c^1_{13} $ $ a^3_{24}+c^1_{24} $ $ a^3_{35}+c^1_{35} $
$ a^2_{15}+b^1_{15} $ $ a^2_{25}+b^1_{25} $ $ a^2_{23}+b^1_{23} $ $ a^2_{34}+b^1_{34} $ $ a^2_{45}+b^1_{45} $
$ a^3_{15}+c^1_{15} $ $ a^3_{25}+c^1_{25} $ $ a^3_{23}+c^1_{23} $ $ a^3_{34}+c^1_{34} $ $ a^3_{45}+c^1_{45} $
$ b^2_{14}+c^2_{14} $ $ b^2_{12}+c^2_{12} $ $ b^2_{13}+c^2_{13} $ $ b^2_{24}+c^2_{24} $ $ b^2_{35}+c^2_{35} $
$ b^2_{15}+c^2_{15} $ $ b^2_{25}+c^2_{25} $ $ b^2_{23}+c^2_{23} $ $ b^2_{34}+c^2_{34} $ $ b^2_{45}+c^2_{45} $
Step $ 3 $ $ a^4_{12}+b^2_{12}+c^2_{12} $ $ a^4_{23}+b^2_{23}+c^2_{23} $ $ a^4_{34}+b^2_{34}+c^2_{34} $ $ a^4_{14}+b^2_{14}+c^2_{14} $ $ a^4_{15}+b^2_{15}+c^2_{15} $
$ a^4_{13}+b^2_{13}+c^2_{13} $ $ a^4_{24}+b^2_{24}+c^2_{24} $ $ a^4_{35}+b^2_{35}+c^2_{35} $ $ a^4_{45}+b^2_{45}+c^2_{45} $ $ a^4_{25}+b^2_{25}+c^2_{25} $
$ Serv^1 $ $ Serv^2 $ $ Serv^3 $ $ Serv^4 $ $ Serv^5 $
Step $ 1 $ $ a^1_{12},\; a^1_{13} $ $ a^1_{23},\; a^1_{24} $ $ a^1_{34},\; a^1_{35} $ $ a^1_{14},\; a^1_{45} $ $ a^1_{15},\; a^1_{25} $
$ b^1_{12},\; b^1_{13} $ $ b^1_{23},\; b^1_{24} $ $ b^1_{34},\; b^1_{35} $ $ b^1_{14},\; b^1_{45} $ $ b^1_{15},\; b^1_{25} $
$ c^1_{12},\; c^1_{13} $ $ c^1_{23},\; c^1_{24} $ $ c^1_{34},\; c^1_{35} $ $ c^1_{14},\; c^1_{45} $ $ c^1_{15},\; c^1_{25} $
Step $ 2 $ $ a^2_{14}+b^1_{14} $ $ a^2_{12}+b^1_{12} $ $ a^2_{13}+b^1_{13} $ $ a^2_{24}+b^1_{24} $ $ a^2_{35}+b^1_{35} $
$ a^3_{14}+c^1_{14} $ $ a^3_{12}+c^1_{12} $ $ a^3_{13}+c^1_{13} $ $ a^3_{24}+c^1_{24} $ $ a^3_{35}+c^1_{35} $
$ a^2_{15}+b^1_{15} $ $ a^2_{25}+b^1_{25} $ $ a^2_{23}+b^1_{23} $ $ a^2_{34}+b^1_{34} $ $ a^2_{45}+b^1_{45} $
$ a^3_{15}+c^1_{15} $ $ a^3_{25}+c^1_{25} $ $ a^3_{23}+c^1_{23} $ $ a^3_{34}+c^1_{34} $ $ a^3_{45}+c^1_{45} $
$ b^2_{14}+c^2_{14} $ $ b^2_{12}+c^2_{12} $ $ b^2_{13}+c^2_{13} $ $ b^2_{24}+c^2_{24} $ $ b^2_{35}+c^2_{35} $
$ b^2_{15}+c^2_{15} $ $ b^2_{25}+c^2_{25} $ $ b^2_{23}+c^2_{23} $ $ b^2_{34}+c^2_{34} $ $ b^2_{45}+c^2_{45} $
Step $ 3 $ $ a^4_{12}+b^2_{12}+c^2_{12} $ $ a^4_{23}+b^2_{23}+c^2_{23} $ $ a^4_{34}+b^2_{34}+c^2_{34} $ $ a^4_{14}+b^2_{14}+c^2_{14} $ $ a^4_{15}+b^2_{15}+c^2_{15} $
$ a^4_{13}+b^2_{13}+c^2_{13} $ $ a^4_{24}+b^2_{24}+c^2_{24} $ $ a^4_{35}+b^2_{35}+c^2_{35} $ $ a^4_{45}+b^2_{45}+c^2_{45} $ $ a^4_{25}+b^2_{25}+c^2_{25} $
Table 7.  The number of symbols downloaded in each step of the scheme
Steps Tuple Number of Total symbols Number of Useful symbols
Step 1 Single $ N{{M}\choose{1}}\lambda $ $ N\lambda $
Step 2 Pair $ N{{M}\choose{2}}\lambda(t-1) $ $ N{{M-1}\choose{2-1}}\lambda(t-1) $
Step 3 Triple $ N{{M}\choose{3}}\lambda(t-1)^2 $ $ N{{M-1}\choose{3-1}}\lambda(t-1)^2 $
$ \vdots $ $ \vdots $ $ \vdots $ $ \vdots $
Step k k-tuple $ N{{M}\choose{k}}\lambda(t-1)^{k-1} $ $ N{{M-1}\choose{k-1}}\lambda(t-1)^{k-1} $
$ \vdots $ $ \vdots $ $ \vdots $ $ \vdots $
Step M M-tuple $ N{{M}\choose{M}}\lambda(t-1)^{M-1} $ $ N{{M-1}\choose{M-1}}\lambda(t-1)^{M-1} $
Steps Tuple Number of Total symbols Number of Useful symbols
Step 1 Single $ N{{M}\choose{1}}\lambda $ $ N\lambda $
Step 2 Pair $ N{{M}\choose{2}}\lambda(t-1) $ $ N{{M-1}\choose{2-1}}\lambda(t-1) $
Step 3 Triple $ N{{M}\choose{3}}\lambda(t-1)^2 $ $ N{{M-1}\choose{3-1}}\lambda(t-1)^2 $
$ \vdots $ $ \vdots $ $ \vdots $ $ \vdots $
Step k k-tuple $ N{{M}\choose{k}}\lambda(t-1)^{k-1} $ $ N{{M-1}\choose{k-1}}\lambda(t-1)^{k-1} $
$ \vdots $ $ \vdots $ $ \vdots $ $ \vdots $
Step M M-tuple $ N{{M}\choose{M}}\lambda(t-1)^{M-1} $ $ N{{M-1}\choose{M-1}}\lambda(t-1)^{M-1} $
Table 8.  Queries to download message $ A $
$ Serv^1 $ $ Serv^2 $ $ Serv^3 $ $ Serv^4 $
$ a^1_{12},a^1_{14} $ $ a^1_{23},a^1_{24} $ $ a^1_{13} $ $ a^1_{34} $
$ b^1_{12},b^1_{14} $ $ b^1_{23},b^1_{24} $ $ b^1_{13} $ $ b^1_{34} $
$ a^2_{13}+b^1_{13} $ $ a^2_{12}+b^1_{12} $ $ a^2_{23}+b^1_{23} $ $ a^2_{14}+b^1_{14} $
$ a^2_{34}+b^1_{34} $ $ a^2_{24}+b^1_{24} $
$ Serv^1 $ $ Serv^2 $ $ Serv^3 $ $ Serv^4 $
$ a^1_{12},a^1_{14} $ $ a^1_{23},a^1_{24} $ $ a^1_{13} $ $ a^1_{34} $
$ b^1_{12},b^1_{14} $ $ b^1_{23},b^1_{24} $ $ b^1_{13} $ $ b^1_{34} $
$ a^2_{13}+b^1_{13} $ $ a^2_{12}+b^1_{12} $ $ a^2_{23}+b^1_{23} $ $ a^2_{14}+b^1_{14} $
$ a^2_{34}+b^1_{34} $ $ a^2_{24}+b^1_{24} $
Table 9.  The number of symbols downloaded in each step of the scheme
Steps Tuple Number of Total symbols (all servers) Number of Useful symbols (all servers)
Step 1 Single $ {{{M}\choose{1}}[da+t(N-d)]} $ $ da+t(N-d) $
Step 2 Pair $ {{M}\choose{2}}\frac{d({{N-1}\choose{t-1}}-a)+(N-d)({{N-1}\choose{t-1}}-t)}{{{N}\choose{t}}^{0}} $ $ {{M-1}\choose{2-1}}\frac{d({{N-1}\choose{t-1}}-a)+(N-d)({{N-1}\choose{t-1}}-t)}{{{N}\choose{t}}^0} $
Step 3 Triple $ {{M}\choose{3}}\frac{{[d({{N-1}\choose{t-1}}-a)+(N-d)({{N-1}\choose{t-1}}-t)]}^2}{{{N}\choose{t}}^{1}} $ $ {{M-1}\choose{3-1}}\frac{{[d({{N-1}\choose{t-1}}-a)+(N-d)({{N-1}\choose{t-1}}-t)]}^2}{{{N}\choose{t}}^1} $
$ \vdots $ $ \vdots $ $ \vdots $ $ \vdots $
Step k k-tuple $ {{M}\choose{k}}\frac{{[d({{N-1}\choose{t-1}}-a)+(N-d)({{N-1}\choose{t-1}}-t)]}^{k-1}}{{{N}\choose{t}}^{k-2}} $ $ {{M-1}\choose{k-1}}\frac{{[d({{N-1}\choose{t-1}}-a)+(N-d)({{N-1}\choose{t-1}}-t)]}^{k-1}}{{{N}\choose{t}}^{k-2}} $
$ \vdots $ $ \vdots $ $ \vdots $ $ \vdots $
Step M M-tuple $ {{M}\choose{M}}\frac{{[d({{N-1}\choose{t-1}}-a)+(N-d)({{N-1}\choose{t-1}}-t)]}^{M-1}}{{{N}\choose{t}}^{M-2}} $ $ {{M-1}\choose{M-1}}\frac{{[d({{N-1}\choose{t-1}}-a)+(N-d)({{N-1}\choose{t-1}}-t)]}^{M-1}}{{{N}\choose{t}}^{M-2}} $
Steps Tuple Number of Total symbols (all servers) Number of Useful symbols (all servers)
Step 1 Single $ {{{M}\choose{1}}[da+t(N-d)]} $ $ da+t(N-d) $
Step 2 Pair $ {{M}\choose{2}}\frac{d({{N-1}\choose{t-1}}-a)+(N-d)({{N-1}\choose{t-1}}-t)}{{{N}\choose{t}}^{0}} $ $ {{M-1}\choose{2-1}}\frac{d({{N-1}\choose{t-1}}-a)+(N-d)({{N-1}\choose{t-1}}-t)}{{{N}\choose{t}}^0} $
Step 3 Triple $ {{M}\choose{3}}\frac{{[d({{N-1}\choose{t-1}}-a)+(N-d)({{N-1}\choose{t-1}}-t)]}^2}{{{N}\choose{t}}^{1}} $ $ {{M-1}\choose{3-1}}\frac{{[d({{N-1}\choose{t-1}}-a)+(N-d)({{N-1}\choose{t-1}}-t)]}^2}{{{N}\choose{t}}^1} $
$ \vdots $ $ \vdots $ $ \vdots $ $ \vdots $
Step k k-tuple $ {{M}\choose{k}}\frac{{[d({{N-1}\choose{t-1}}-a)+(N-d)({{N-1}\choose{t-1}}-t)]}^{k-1}}{{{N}\choose{t}}^{k-2}} $ $ {{M-1}\choose{k-1}}\frac{{[d({{N-1}\choose{t-1}}-a)+(N-d)({{N-1}\choose{t-1}}-t)]}^{k-1}}{{{N}\choose{t}}^{k-2}} $
$ \vdots $ $ \vdots $ $ \vdots $ $ \vdots $
Step M M-tuple $ {{M}\choose{M}}\frac{{[d({{N-1}\choose{t-1}}-a)+(N-d)({{N-1}\choose{t-1}}-t)]}^{M-1}}{{{N}\choose{t}}^{M-2}} $ $ {{M-1}\choose{M-1}}\frac{{[d({{N-1}\choose{t-1}}-a)+(N-d)({{N-1}\choose{t-1}}-t)]}^{M-1}}{{{N}\choose{t}}^{M-2}} $
[1]

Colleen M. Swanson, Douglas R. Stinson. Extended combinatorial constructions for peer-to-peer user-private information retrieval. Advances in Mathematics of Communications, 2012, 6 (4) : 479-497. doi: 10.3934/amc.2012.6.479

[2]

Feimin Zhong, Wei Zeng, Zhongbao Zhou. Mechanism design in a supply chain with ambiguity in private information. Journal of Industrial & Management Optimization, 2020, 16 (1) : 261-287. doi: 10.3934/jimo.2018151

[3]

Tero Laihonen. Information retrieval and the average number of input clues. Advances in Mathematics of Communications, 2017, 11 (1) : 203-223. doi: 10.3934/amc.2017013

[4]

I-Lin Wang, Shiou-Jie Lin. A network simplex algorithm for solving the minimum distribution cost problem. Journal of Industrial & Management Optimization, 2009, 5 (4) : 929-950. doi: 10.3934/jimo.2009.5.929

[5]

Ke-Wei Ding, Nan-Jing Huang, Yi-Bin Xiao. Distributionally robust chance constrained problems under general moments information. Journal of Industrial & Management Optimization, 2019  doi: 10.3934/jimo.2019087

[6]

Qun Lin, Antoinette Tordesillas. Towards an optimization theory for deforming dense granular materials: Minimum cost maximum flow solutions. Journal of Industrial & Management Optimization, 2014, 10 (1) : 337-362. doi: 10.3934/jimo.2014.10.337

[7]

Guodong Ma, Jinbao Jian. A QP-free algorithm of quasi-strongly sub-feasible directions for inequality constrained optimization. Journal of Industrial & Management Optimization, 2015, 11 (1) : 307-328. doi: 10.3934/jimo.2015.11.307

[8]

Pablo Sánchez, Jaume Sempere. Conflict, private and communal property. Journal of Dynamics & Games, 2016, 3 (4) : 355-369. doi: 10.3934/jdg.2016019

[9]

Shiqiu Liu, Frédérique Oggier. On applications of orbit codes to storage. Advances in Mathematics of Communications, 2016, 10 (1) : 113-130. doi: 10.3934/amc.2016.10.113

[10]

Jau-Chuan Ke, Hsin-I Huang, Chuen-Horng Lin. Analysis on a queue system with heterogeneous servers and uncertain patterns. Journal of Industrial & Management Optimization, 2010, 6 (1) : 57-71. doi: 10.3934/jimo.2010.6.57

[11]

Dequan Yue, Jun Yu, Wuyi Yue. A Markovian queue with two heterogeneous servers and multiple vacations. Journal of Industrial & Management Optimization, 2009, 5 (3) : 453-465. doi: 10.3934/jimo.2009.5.453

[12]

Sumit Kumar Debnath, Pantelimon Stǎnicǎ, Nibedita Kundu, Tanmay Choudhury. Secure and efficient multiparty private set intersection cardinality. Advances in Mathematics of Communications, 2020  doi: 10.3934/amc.2020071

[13]

Bruno Sixou, Valentina Davidoiu, Max Langer, Francoise Peyrin. Absorption and phase retrieval with Tikhonov and joint sparsity regularizations. Inverse Problems & Imaging, 2013, 7 (1) : 267-282. doi: 10.3934/ipi.2013.7.267

[14]

Tzu-Hsin Liu, Jau-Chuan Ke, Ching-Chang Kuo. Machine interference problem involving unsuccessful switchover for a group of repairable servers with vacations. Journal of Industrial & Management Optimization, 2020  doi: 10.3934/jimo.2020027

[15]

Jeongsim Kim, Bara Kim. Stability of a queue with discriminatory random order service discipline and heterogeneous servers. Journal of Industrial & Management Optimization, 2017, 13 (3) : 1237-1254. doi: 10.3934/jimo.2016070

[16]

Ali Tebbi, Terence Chan, Chi Wan Sung. Linear programming bounds for distributed storage codes. Advances in Mathematics of Communications, 2020, 14 (2) : 333-357. doi: 10.3934/amc.2020024

[17]

Tomáš Roubíček, Giuseppe Tomassetti. Thermomechanics of hydrogen storage in metallic hydrides: Modeling and analysis. Discrete & Continuous Dynamical Systems - B, 2014, 19 (7) : 2313-2333. doi: 10.3934/dcdsb.2014.19.2313

[18]

Phil Howlett, Julia Piantadosi, Paraskevi Thomas. Management of water storage in two connected dams. Journal of Industrial & Management Optimization, 2007, 3 (2) : 279-292. doi: 10.3934/jimo.2007.3.279

[19]

Rafael G. L. D'Oliveira, Marcelo Firer. Minimum dimensional Hamming embeddings. Advances in Mathematics of Communications, 2017, 11 (2) : 359-366. doi: 10.3934/amc.2017029

[20]

Marta Faias, Emma Moreno-García, Myrna Wooders. A strategic market game approach for the private provision of public goods. Journal of Dynamics & Games, 2014, 1 (2) : 283-298. doi: 10.3934/jdg.2014.1.283

2019 Impact Factor: 0.734

Metrics

  • PDF downloads (42)
  • HTML views (222)
  • Cited by (0)

[Back to Top]