arrow
Return

Secure Hashing-Based Verifiable Pattern Matching

delete2018-11-01
delete8
PRE
AI
陈
陈飞 (Fei Chen)
W
Wang Dong-hong
李荣华 cover
李荣华 (Rong-Hua Li)
陈健勇 cover
陈健勇 (Jianyong Chen) *
Z
Zhong Ming
A
Alex X. Liu
H
Huayi Duan
Cong WANG cover
Cong WANG (Cong Wang)
秦
秦进 (Jing Qin)
DOI:10.1109/TIFS.2018.2825141delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Verifiable pattern matching is the problem of finding a given pattern verifiably from the outsourced textual data, which is resident in an untrusted remote server. This problem has drawn much attention due to a large number of applications. The state-of-the-art method for this problem suffers from low efficiency. To enable fast verifiable pattern matching, we propose a novel scheme in this paper. Our scheme is based on an ordered set accumulator data structure and a newly developed verifiable suffix array structure, which only involves fast cryptographic hash computations. Our scheme also supports fast multiple-occurrence pattern matching. A striking feature of our proposed scheme is that our scheme works even with no secret keys, which ensures public verifiability. We conduct extensive experiments to evaluate the proposed scheme using Java. The results show that our scheme is orders of magnitude faster than the state-of-the-art work. Specifically, our scheme with public verifiability only costs a preprocessing time of 47 s (merely one-time off-line cost during outsourcing), a search time of 30 mu s, a verification time of 149 mu s, and a proof size of 2760 bytes for a verifiable pattern matching query with pattern length 200 on 10-million long textual data which consists of sequences of two-byte, Unicode characters in Java.
Keywords:
Pattern matching outsourcing
verifiability
accumulator
hashing
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

IEEE Transactions on Information Forensics and Security cover
IEEE Transactions on Information Forensics and Security
IF:
8
Papers:
5.3K
Citations:
2.3W

Organization

H
hong kong polytechnic university
Scholars:
3.0W
Papers: 4.1W
Citations: 921
B
beijing institute of technology
Scholars:
5.5W
Papers: 4.0W
Citations: 63
C
City University of Hong Kong
Scholars:
2.3W
Papers: 3.0W
Citations: 6.1W
S
shenzhen university
Scholars:
4.6W
Papers: 3.4W
Citations: 72
M
michigan state university
Scholars:
3.6W
Papers: 3.2W
Citations: 44
researcher View more organizations
Cited Papers

Cited Papers

err
IF0
err
err0
PREAI
err
errShare
errSave
Verifiable Computation over Large Database with Incremental Updates
err2016-10-01
err237
PREAI
errChen, Xiaofeng; Li, Jin; Weng, Jian; Ma, Jianfeng; Lou, Wenjing
errShare
errSave
Cycloadditionsreaktionen von Organometall-Komplexen
err1992-11-01
err0
PREAI
errH. Werner; U. Brekau; O. Nürnberg; B. Zeier
errShare
errSave
Spatial Query Integrity with Voronoi Neighbors
err2013-04-01
err69
PREAI
errHu, Ling; Ku, Wei-Shinn; Bakiras, Spiridon; Shahabi, Cyrus
errShare
errSave
Do changes in dynamic plantar pressure distribution, strength capacity and postural control after intra-articular calcaneal fracture correlate with clinical and radiological outcome?
err2011-10-01
err0
PREAI
errAnja Hirschmüller; Lukas Konstantinidis; Heiner Baur; Steffen Müller; Alexander Mehlhorn; Julia Kontermann; Ulrich Grosse; N.P. Südkamp; Peter Helwig
errShare
errSave
researcher View more