![](bg8.png)
Table 1: Comparison of related schemes in distributed database setting with n instances each with m data objects each of l
bits.
Scheme Lipmaa Boneh Chandran PIUDI
Communication (logn + l)k ∗m(best case ) O(l ∗m
√
n) O(m ∗
√
l
1+α
n)polylog(n) O(l ∗n)
Computation O(m ∗(n ∗logn + n)) O(l ∗m ∗n) O(n ∗m ∗ polylog(n)) O(n)
DB size change None None None None
Table 2: Gas fee comparison between trival encrypted db(Best case), homomorphically encrypted db(Best case) and our
approach for updating n data objects with c being the gas cost for a trivial addition operation.
Scheme Encrypted Homomorphic encrypted PIUDI
Single update gas cost O(n ∗logn + n) ∗c O(n ∗logn + n) ∗c O(1) ∗c
Batch update gas cost N.A. N.A. O(1) ∗c
and we anticipate it will have practical implications in
the field of privacy-preserving distributed databases.
REFERENCES
Bagui, S. and Nguyen, L. T. (2015). Database sharding:
to provide fault tolerance and scalability of big data
on the cloud. International Journal of Cloud Applica-
tions and Computing (IJCAC), 5(2):36–52.
Boneh, D., Kushilevitz, E., Ostrovsky, R., and Skeith, W. E.
(2007). Public key encryption that allows pir queries.
In Advances in Cryptology-CRYPTO 2007: 27th An-
nual International Cryptology Conference, Santa Bar-
bara, CA, USA, August 19-23, 2007. Proceedings 27,
pages 50–67. Springer.
Chor, B., Kushilevitz, E., Goldreich, O., and Sudan, M.
(1998). Private information retrieval. Journal of the
ACM (JACM), 45(6):965–981.
Dwork, C., Smith, A., Steinke, T., and Ullman, J. (2017).
Exposed! a survey of attacks on private data. Annual
Review of Statistics and Its Application, 4:61–84.
Franklin, M. and Yung, M. (1992). Communication com-
plexity of secure computation. In Proceedings of the
twenty-fourth annual ACM symposium on Theory of
computing, pages 699–710.
Gasarch, W. (2004). A survey on private information re-
trieval. Bulletin of the EATCS, 82(72-107):113.
Goldreich, O. and Ostrovsky, R. (1996). Software protec-
tion and simulation on oblivious rams. Journal of the
ACM (JACM), 43(3):431–473.
Grubbs, P., Ristenpart, T., and Shmatikov, V. (2017). Why
your encrypted database is not secure. In Proceedings
of the 16th workshop on hot topics in operating sys-
tems, pages 162–168.
Ishai, Y., Kushilevitz, E., Ostrovsky, R., and Sahai, A.
(2004). Batch codes and their applications. In Pro-
ceedings of the thirty-sixth annual ACM symposium
on Theory of computing, pages 262–271.
Ishai, Y. and Paskin, A. (2007). Evaluating branching pro-
grams on encrypted data. In Theory of Cryptography:
4th Theory of Cryptography Conference, TCC 2007,
Amsterdam, The Netherlands, February 21-24, 2007.
Proceedings 4, pages 575–594. Springer.
Islam, M. S., Kuzu, M., and Kantarcioglu, M. (2012). Ac-
cess pattern disclosure on searchable encryption: ram-
ification, attack and mitigation. In Ndss, volume 20,
page 12. Citeseer.
Lacharit
´
e, M.-S., Minaud, B., and Paterson, K. G. (2018).
Improved reconstruction attacks on encrypted data us-
ing range query leakage. In 2018 IEEE Symposium on
Security and Privacy (SP), pages 297–314. IEEE.
Lipmaa, H. and Zhang, B. (2010). Two new efficient pir-
writing protocols. In Applied Cryptography and Net-
work Security: 8th International Conference, ACNS
2010, Beijing, China, June 22-25, 2010. Proceedings
8, pages 438–455. Springer.
Luu, L., Narayanan, V., Zheng, C., Baweja, K., Gilbert, S.,
and Saxena, P. (2016). A secure sharding protocol for
open blockchains. In Proceedings of the 2016 ACM
SIGSAC conference on computer and communications
security, pages 17–30.
Papadimitriou, A., Bhagwan, R., Chandran, N., Ramjee,
R., Haeberlen, A., Singh, H., Modi, A., and Badri-
narayanan, S. (2016). Big data analytics over en-
crypted datasets with seabed. In OSDI, volume 16,
pages 587–602.
Popa, R. A., Redfield, C. M., Zeldovich, N., and Balakr-
ishnan, H. (2011). Cryptdb: Protecting confidential-
ity with encrypted query processing. In Proceedings
of the twenty-third ACM symposium on operating sys-
tems principles, pages 85–100.
Popa, R. A., Stark, E., Helfer, J., Valdez, S., Zeldovich, N.,
Kaashoek, M. F., and Balakrishnan, H. (2014). Build-
ing web applications on top of encrypted data using
mylar. In NSDI, volume 14, pages 157–172.
Sguanci, C., Spatafora, R., and Vergani, A. M. (2021).
Layer 2 blockchain scaling: A survey. arXiv preprint
arXiv:2107.10881.
Shamir, A. (1979). How to share a secret. Communications
of the ACM, 22(11):612–613.
Stefanov, E., Dijk, M. v., Shi, E., Chan, T.-H. H., Fletcher,
C., Ren, L., Yu, X., and Devadas, S. (2018). Path
oram: an extremely simple oblivious ram protocol.
Journal of the ACM (JACM), 65(4):1–26.
Zolotukhin, M., H
¨
am
¨
al
¨
ainen, T., Kokkonen, T., and Silta-
nen, J. (2014). Analysis of http requests for anomaly
detection of web attacks. In 2014 IEEE 12th Inter-
national Conference on Dependable, Autonomic and
Secure Computing, pages 406–411. IEEE.
SECRYPT 2023 - 20th International Conference on Security and Cryptography
432