%0 Conference Proceedings
%T N-Gram Based Secure Similar Document Detection
%+ Missouri University of Science and Technology (Missouri S&T)
%A Jiang, Wei
%A Samanthula, Bharath, K.
%Z Part 9: Short Papers
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 23th Data and Applications Security (DBSec)
%C Richmond, VA, United States
%Y Yingjiu Li
%I Springer
%3 Data and Applications Security and Privacy XXV
%V LNCS-6818
%P 239-246
%8 2011-07-11
%D 2011
%R 10.1007/978-3-642-22348-8_19
%K privacy
%K security
%K n-gram
%Z Computer Science [cs]Conference papers
%X Secure similar document detection (SSDD) plays an important role in many applications, such as justifying the need-to-know basis and facilitating communication between government agencies. The SSDD problem considers situations where Alice with a query document wants to find similar information from Bob’s document collection. During this process, the content of the query document is not disclosed to Bob, and Bob’s document collection is not disclosed to Alice. Existing SSDD protocols are developed under the vector space model, which has the advantage of identifying global similar information. To effectively and securely detect similar documents with overlapping text fragments, this paper proposes a novel n-gram based SSDD protocol.
%G English
%Z TC 11
%Z WG 11.3
%2 https://inria.hal.science/hal-01586584/document
%2 https://inria.hal.science/hal-01586584/file/978-3-642-22348-8_19_Chapter.pdf
%L hal-01586584
%U https://inria.hal.science/hal-01586584
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC11
%~ IFIP-WG11-3
%~ IFIP-DBSEC
%~ IFIP-LNCS-6818