000254805 001__ 254805
000254805 005__ 20180913064731.0
000254805 037__ $$aCONF
000254805 245__ $$aStorage Efficient Substring Searchable Symmetric Encryption
000254805 260__ $$c2018
000254805 269__ $$a2018
000254805 300__ $$a15
000254805 336__ $$aConference Papers
000254805 520__ $$aWe address the problem of substring searchable encryption. A single user produces a big stream of data and later on wants to learn the positions in the string that some patterns occur. Although current techniques exploit auxiliary data structures to achieve efficient substring search on the server side, the cost at the user side may be prohibitive. We revisit the work of substring searchable encryption in order to reduce the storage cost of auxiliary data structures. Our solution entails a suffix array based index design, which allows optimal storage cost O (n) with small hidden factor at the size of the string n. We analyze the security of the protocol in the real ideal framework. Moreover, we implemented our scheme and the state of the art protocol [7] to demonstrate the performance advantage of our solution with precise benchmark results.
000254805 700__ $$0251315$$aLeontiadis, Iraklis
000254805 700__ $$aLi, Ming
000254805 7112_ $$aASIACCS-SCC 2018$$cIncheon, Korea$$d4-8 June 2018
000254805 710__ $$aLasec
000254805 8560_ $$firaklis.leontiadis@epfl.ch
000254805 8564_ $$s1036207$$uhttps://infoscience.epfl.ch/record/254805/files/index.pdf
000254805 8564_ $$s1690799$$uhttps://infoscience.epfl.ch/record/254805/files/index.pdf?subformat=pdfa$$xpdfa
000254805 909C0 $$0252183$$mfatih.balli@epfl.ch$$pLASEC$$xU10433
000254805 909CO $$ooai:infoscience.epfl.ch:254805$$pconf$$pIC
000254805 960__ $$airaklis.leontiadis@epfl.ch
000254805 961__ $$alaurence.gauvin@epfl.ch
000254805 973__ $$aOTHER$$rREVIEWED
000254805 980__ $$aCONF
000254805 981__ $$aoverwrite