Character‐based symmetric searchable encryption and its implementation and experiment on mobile devices. Issue 12 (12th September 2013)

• Record Type: Journal Article
• Authors: Suga, Takanori; Nishide, Takashi; Sakurai, Kouichi
• Other Names: Jiang Shaoquan guestEditor.; Takagi Tsuyoshi guestEditor.; Wang Guilin guestEditor.
• Is Part Of: Security and communication networks. Volume 9:Issue 12(2016)
• Page Start: 1717
• Page End: 1725
• Publication Date: 2013-09-12
• Subjects: Bloom filter -- partial‐matching search -- searchable encryption -- symmetric encryption -- wildcard search; Computer networks -- Security measures -- Periodicals; Computer security -- Periodicals; Cryptography -- Periodicals; 005.805
• DOI: 10.1002/sec.876
• Languages: English
• ISSNs: 1939-0114

Abstract

Abstract: Searchable encryption allows us to perform a keyword search over encrypted data. However, we cannot efficiently perform some complex search (e.g., a wildcard search) with traditional searchable encryption schemes because they can deal with only equality matches. Our symmetric searchable encryption can deal with partial matches. This allows us to efficiently perform a wildcard search, partial match search, and so on. We also examine the feasibility of our scheme by experiments on a smartphone and tablet, and confirm our scheme can be used in these environments. Availability on portable devices will offer high convenience. Copyright © 2013 John Wiley & Sons, Ltd. Abstract : Searchable encryption allows us to perform a keyword search over encrypted data. However, we cannot efficiently perform some complex search (e.g., a wildcard search) with traditional searchable encryption schemes because they can deal with only equality matches. Our symmetric searchable encryption can deal with partial matches. This allows us to efficiently perform wildcard searches. We also examine the feasibility of our scheme by experiments on a smartphone and tablet, and confirm that our scheme can be used in these environments.