Loading...
Searchable encryption schemes: With multiplication and simultaneous congruences
Author(s)
Premasathian, Nol
Choto, Somsak
Date Issued
December 1, 2012
Type
Conference Paper
Abstract
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. © 2012 IEEE.
Citation
2012 9th International Isc Conference on Information Security and Cryptology Iscisc 2012, 147-150, 2012