Document Open Access Logo

Secure Compressed Suffix Arrays

Author Kunihiko Sadakane

PDF HTML 5

Files

Thumbnail PDF
PDF
OASIcs.Grossi.13.pdf
  • Filesize: 0.58 MB
  • 8 pages
HTML5 Logo HTML (experimental)
OASIcs.Grossi.13.html

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Data structures design and analysis
Keywords
  • suffix array
  • compression
  • encryption
  • oblivious algorithm
  • secure computation

Metrics

Abstract

This paper proposes a secure compressed suffix array, which is a data oblivious and compressed version of the suffix array used for finding substrings of a large string. Secure compressed suffix arrays can be used for indexing a large collection of strings containing personal information such as DNA data.

Cite As Get BibTex

Kunihiko Sadakane. Secure Compressed Suffix Arrays. In From Strings to Graphs, and Back Again: A Festschrift for Roberto Grossi's 60th Birthday. Open Access Series in Informatics (OASIcs), Volume 132, pp. 13:1-13:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/OASIcs.Grossi.13

Author Details

Kunihiko Sadakane
  • The University of Tokyo, Japan

References

  1. Ilaria Chillotti, Nicolas Gama, Mariya Georgieva, and Malika Izabachène. Tfhe: Fast fully homomorphic encryption over the torus. J. Cryptol., 33(1):34-91, January 2020. URL: https://doi.org/10.1007/s00145-019-09319-x.
  2. P. Ferragina and G. Manzini. Indexing compressed texts. Journal of the ACM, 52(4):552-581, 2005. URL: https://doi.org/10.1145/1082036.1082039.
  3. Craig Gentry. Fully homomorphic encryption using ideal lattices. In Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, STOC '09, pages 169-178, New York, NY, USA, 2009. Association for Computing Machinery. URL: https://doi.org/10.1145/1536414.1536440.
  4. R. Grossi and J. S. Vitter. Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching. SIAM Journal on Computing, 35(2):378-407, 2005. URL: https://doi.org/10.1137/S0097539702402354.
  5. Roberto Grossi and Jeffrey S. Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract). In Proceedings of the Thirty-Second Annual ACM Symposium on the Theory of Computing, pages 397-406, Portland, OR, 2000. Google Scholar
  6. G. Jacobson. Space-efficient Static Trees and Graphs. In IEEE Symposium on Foundations of Computer Science (FOCS), pages 549-554, 1989. Google Scholar
  7. Eyal Kushilevitz, Steve Lu, and Rafail Ostrovsky. On the (in)security of hash-based oblivious ram and a new balancing scheme. In Proceedings of the 2012 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 143-156, 2012. URL: https://doi.org/10.1137/1.9781611973099.13.
  8. Udi Manber and Gene Myers. Suffix arrays: a new method for on-line string searches. SIAM Journal on Computing, 22(5):935-948, 1993. URL: https://doi.org/10.1137/0222058.
  9. J. I. Munro and V. Raman. Succinct Representation of Balanced Parentheses and Static Trees. SIAM Journal on Computing, 31(3):762-776, 2001. URL: https://doi.org/10.1137/S0097539799364092.
  10. Taku Onodera and Tetsuo Shibuya. Succinct Oblivious RAM. In Rolf Niedermeier and Brigitte Vallée, editors, 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), volume 96 of Leibniz International Proceedings in Informatics (LIPIcs), pages 52:1-52:16, Dagstuhl, Germany, 2018. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.STACS.2018.52.
  11. R. Raman, V. Raman, and S. R. Satti. Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Transactions on Algorithms, 3(4), 2007. URL: https://doi.org/10.1145/1290672.1290680.
  12. Kunihiko Sadakane. New text indexing functionalities of the compressed suffix arrays. J. Algorithms, 48(2):294-313, 2003. URL: https://doi.org/10.1016/S0196-6774(03)00087-7.
  13. Adi Shamir. How to share a secret. Commun. ACM, 22(11):612-613, November 1979. URL: https://doi.org/10.1145/359168.359176.
  14. Elaine Shi, T. H. Hubert Chan, Emil Stefanov, and Mingfei Li. Oblivious ram with o((logn)3) worst-case cost. In Dong Hoon Lee and Xiaoyun Wang, editors, Advances in Cryptology - ASIACRYPT 2011, pages 197-214, Berlin, Heidelberg, 2011. Springer Berlin Heidelberg. URL: https://doi.org/10.1007/978-3-642-25385-0_11.
  15. Emil Stefanov, Marten van Dijk, Elaine Shi, Christopher Fletcher, Ling Ren, Xiangyao Yu, and Srinivas Devadas. Path oram: an extremely simple oblivious ram protocol. In Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, CCS '13, pages 299-310, New York, NY, USA, 2013. Association for Computing Machinery. URL: https://doi.org/10.1145/2508859.2516660.
  16. Latanya Sweeney. k-anonymity: a model for protecting privacy. Int. J. Uncertain. Fuzziness Knowl.-Based Syst., 10(5):557-570, October 2002. URL: https://doi.org/10.1142/S0218488502001648.
  17. Andrew Chi-Chih Yao. How to generate and exchange secrets. In 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), pages 162-167, 1986. URL: https://doi.org/10.1109/SFCS.1986.25.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact