Art

J-GLOBAL ID：201902277149521553   Reference number：19A0487221

No-Dictionary Searchable Symmetric Encryption

非辞書探索可能な対称暗号化

Author (2)： OGATA Wakaha (Tokyo Institute of Technology) ,  KUROSAWA Kaoru (Ibaraki University)
Material： IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (Web)  (IEICE Trans Fundam Electron Commun Comput Sci (Web))
Volume： E102.A  Issue： 1  Page： 114-124(J-STAGE)  Publication year： 2019 
JST Material Number： U0466A  ISSN： 1745-1337  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： dictionary ,  retrieval ,  *cryptogram ,  *information retrieval ,  *keyword ,  customer ,  Safety ,  computer system (hardware) ,  server
Semi thesaurus term： *keyword retrieval ,  client ,  *encryption

Author keywords (4)： searchable symmetric encryption ,  dictionary ,  verifiable ,  search pattern

JST classification (1)： Code theory  (ND02030R)

Reference (36)：

• [1] L. Ballard, S. Kamara, and F. Monrose, “Achieving efficient conjunctive keyword searches over encrypted data,” 7th International Conference on Information and Communication Security (ICICS 2005), pp.414-426, 2005. 10.1007/11602897_35
• [2] N. Baric and B. Pfitzmann, “Collision-free accumulators and fail-stop signature schemes without trees,” EUROCRYPT 1997, LNCS, vol.1233, pp.480-494, 1997. 10.1007/3-540-69053-0_33
• [3] M. Bellare, A. Desai, E. Jokipii, and P. Rogaway, “A concrete security treatment of symmetric encryption,” FOCS 1997, pp.394-403, 1997. 10.1109/sfcs.1997.646128
• [4] M. Bellare, R. Guerin, and P. Rogaway, “XOR MACs: New methods for message authentication using finite pseudorandom functions,” CRYPTO 1995, LNCS, vol.963, pp.15-28, 1995. 10.1007/3-540-44750-4_2
• [5] S. Bellovin and W. Cheswick, “Privacy-enhanced searches using encrypted bloom filters,” Technical Report 2004/022, IACR ePrint Cryptography Archive, https://eprint.iacr.org/2004/022, 2004.

Terms in the title (4)： 辞書 ,  探索 ,  対称 ,  暗号化