Premasathian, Nol and Choto, Somsak (2012) Searchable encryption schemes: With multiplication and simultaneous congruences In: 2012 9th International ISC Conference on Information Security and Cryptology (ISCISC), 2012-09-13, Tabriz, Iran.
This paper presents fast searchable encryption schemes using multiplication and simultaneous congruences. In the schemes, any user can determine if a particular keyword exists in an encrypted document. The message can be encrypted by any technique. The number of occurrences of a keyword can be determined in some schemes.
Item Type:
Conference or Workshop Item (Paper)
Identification Number (DOI):
Deposited by:
ระบบ อัตโนมัติ
Date Deposited:
2021-09-09 23:53:46
Last Modified:
2021-10-03 15:06:17