# Is there a way to create an index on a large amount of encrypted data in ciphertext?

**URL:** <https://openfhe.discourse.group/t/is-there-a-way-to-create-an-index-on-a-large-amount-of-encrypted-data-in-ciphertext/1413>\
**Category:** FHE Questions\
**Created:** [July 8, 2024, 8:44am UTC](https://openfhe.discourse.group/t/is-there-a-way-to-create-an-index-on-a-large-amount-of-encrypted-data-in-ciphertext/1413 "2024-07-08T08:44:12Z")\
**Posts on this page:** 1\
**Page:** 1

<div class="post-metadata">

**Author:** ![capibala](https://avatars.discourse-cdn.com/v4/letter/c/b5ac83/32.png) [@capibala](https://openfhe.discourse.group/u/capibala)\
**Post date:** [July 8, 2024, 8:44am UTC](https://openfhe.discourse.group/t/is-there-a-way-to-create-an-index-on-a-large-amount-of-encrypted-data-in-ciphertext/1413/1 "2024-07-08T08:44:12Z")

</div>

If you build a B+ tree in the same way as the plaintext, and all the nodes in the tree are encrypted, then searching through the nodes of the tree will not be fast. I discovered a method called \*

> blind index

- . Is there any other good method?
