# Registered Keyword Searchable Encryption Based on SM9
## 2 Preliminaries
### Baver Triple
The RKSE-SM9 has much greater computing efficiency than the registered keyword searchable encryption algorithms in PEKS ciphertext, Trapdoor, and Testing, according to theoretical analysis and simulation experiment outcomes. As a result, the suggested plan is a searchable encryption plan that ensures heavy security and fulfills effective keyword searching. Regrettably, our plan is not strong enough to withstand a server collusion attack. Work in the future will concentrate more on scenario applications. At the moment, our search strategy only supports one term. To create a multi-keyword searchable encryption system, it may be merged with broadcast encryption in the next step. Try adding and deleting keywords; a subsequent encryption method can be built to be searchable and updateable. Conceptualization, H.Z. and B.Q. ; Software, H.Z. ; Validation, H.Z., B.Q. and D.Z. ; Formal analysis, B.Q. ; Writing--original draft, H.Z. ; Writing--review & editing, H.Z., B.Q. and D.Z. ; Supervision, B.Q. and D.Z. ; Project administration, B.Q. and D.Z. All authors have read and agreed to the published version of the manuscript. Figure 8: Comparing the time of registered keyword generation. **Funding:** This work is supported by the National Natural Science Foundation of China (Grant No. 62072371), the Basic Research Program of Qinghai Province (Grant No. 2020-ZJ-701), and the Youth Innovation Team of Shaanxi Universities. **Institutional Review Board Statement:** Our research does not require ethical approval. **Informed Consent Statement:** Our articles do not require this statement. **Data Availability Statement:** We did not create relevant data. **Conflicts of Interest:** We have identified and declared no conflict of interest in this article. ## References

* (1) [PERSON]; [PERSON]; [PERSON] [PERSON]; [PERSON]; [PERSON] A group theoretic construction of highly nonlinear substitution box and its applications in image encryption. In _Multimedia Tools and Applications_; Springer: Berlin/Heidelberg, Germany, 2022; pp. 1-22. * (2) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Comparison of Pre and Post-Action of a Finite Abelian Group Over Certain Nonlinear Schemes. _IEEE Access_**2020**, \(8\), 39781-39792. [CrossRef]
* (3) [PERSON]; [PERSON]; [PERSON] A Survey on Public Key Encryption with Keyword Search: Taxonomy and Methods. _Intl. J. Math. Math. Sci._**2022**, _2022_, 3223509:1-3223509:10. [CrossRef]
* (4) [PERSON]; [PERSON]; [PERSON]; [PERSON] A novel group theoretic and graphical approach for designing cryptographically strong nonlinear components of block ciphers. _Wirel. Pers. Commun._**2021**, _116_, 3165-3190. [CrossRef]
* (5) [PERSON]; [PERSON]; [PERSON] A lightweight image encryption algorithm based on patterns in [PERSON]'s revenge cube. _Multimed. Tools Appl._**2022**, _81_, 28987-28998. [CrossRef]
* (6) [PERSON] The SM9 Cryptographic Schemes. _IACR Cryptol. ePrint Arch._**2017**, _2017_, 117. * (7) [PERSON] Efficient Multiparty Protocols Using Circuit Randomization. In Proceedings of the Advances in Cryptology--CRYPTO '91, 11 th Annual International Cryptology Conference, Santa Barbara, CA, USA, 11-15 August 1991; [PERSON], [PERSON]; Lecture Notes in Computer Science; Springer: Berlin/Heidelberg, Germany, 1991; Volume 576, pp. 420-432. [CrossRef]
* (8) [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON]; [PERSON] Server-Aided Public Key Encryption With Keyword Search. _IEEE Trans. Inf. Forensics Secur._**2016**, _11_, 2833-2842. [CrossRef]
* (9) [PERSON]; [PERSON]; [PERSON] Practical Techniques for Searches on Encrypted Data. In Proceedings of the 2000 IEEE Symposium on Security and Privacy, Berkeley, CA, USA, 14-17 May 2000; Computer Society; IEEE: New York, NY, USA, 2000; pp. 44-55. [CrossRef]
* (10) [PERSON]; [PERSON]; [PERSON]; [PERSON] Public Key Encryption with Keyword Search. In Proceedings of the Advances in Cryptology--EUROCRYPT 2004, International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, 2-6 May 2004; [PERSON]; [PERSON], Eds.