DocumentCode
589795
Title
Searchable encryption schemes: With multiplication and simultaneous congruences
Author
Premasathian, N. ; Choto, S.
Author_Institution
Fac. of Inf. Technol., King Mongkut´s Inst. of Technol. Ladkrabang, Bangkok, Thailand
fYear
2012
fDate
13-14 Sept. 2012
Firstpage
147
Lastpage
150
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.
Keywords
document handling; message authentication; public key cryptography; document encryption; keyword search; message encryption; multiplication congruences; searchable encryption scheme; simultaneous congruences; Arrays; Encryption; Keyword search; Public key; Testing; encryption with keyword search; multiplication; searchable encryption;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Security and Cryptology (ISCISC), 2012 9th International ISC Conference on
Conference_Location
Tabriz
Print_ISBN
978-1-4673-2387-1
Type
conf
DOI
10.1109/ISCISC.2012.6408210
Filename
6408210
Link To Document