Secure text processing with applications to private DNA matching

Jonathan Katz; Lior Malka

doi:10.1145/1866307.1866361

Secure text processing with applications to private DNA matching

Jonathan Katz
, Lior Malka

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

64 Scopus citations

Abstract

Motivated by the problem of private DNA matching, we consider the design of efficient protocols for secure text processing. Here, informally, a party P₁ holds a text T and a party P₂ holds a pattern p and some additional information y, and P₂ wants to learn {f(T; j; y)} for all locations j where p is found as a substring in T. (In particular, this generalizes the basic pattern matching problem.) We aim for protocols with full security against a malicious P₂ that also preserve privacy against a malicious P₁ (i.e., one-sided security). We show how to modify Yao's garbled circuit approach to obtain a protocol where the size of the garbled circuit is linear in the number of occurrences of p in T (rather than linear in -T-). Along the way we show a new keyword search protocol that may be of independent interest.

Original language	English
Title of host publication	CCS'10 - Proceedings of the 17th ACM Conference on Computer and Communications Security
Pages	485-492
Number of pages	8
DOIs	https://doi.org/10.1145/1866307.1866361
State	Published - 16 Dec 2010
Externally published	Yes
Event	17th ACM Conference on Computer and Communications Security, CCS'10 - Chicago, IL, United States Duration: 4 Oct 2010 → 8 Oct 2010

Publication series

Name	Proceedings of the ACM Conference on Computer and Communications Security
ISSN (Print)	1543-7221

Conference

Conference	17th ACM Conference on Computer and Communications Security, CCS'10
Country/Territory	United States
City	Chicago, IL
Period	4/10/10 → 8/10/10

Keywords

Security
Theory

ASJC Scopus subject areas

Software
Computer Networks and Communications

Access to Document

10.1145/1866307.1866361

Cite this

@inproceedings{1ce6bc06466f47b4b319bfd728d973f1,

title = "Secure text processing with applications to private DNA matching",

abstract = "Motivated by the problem of private DNA matching, we consider the design of efficient protocols for secure text processing. Here, informally, a party P1 holds a text T and a party P2 holds a pattern p and some additional information y, and P2 wants to learn \{f(T; j; y)\} for all locations j where p is found as a substring in T. (In particular, this generalizes the basic pattern matching problem.) We aim for protocols with full security against a malicious P2 that also preserve privacy against a malicious P1 (i.e., one-sided security). We show how to modify Yao's garbled circuit approach to obtain a protocol where the size of the garbled circuit is linear in the number of occurrences of p in T (rather than linear in -T-). Along the way we show a new keyword search protocol that may be of independent interest.",

keywords = "Security, Theory",

author = "Jonathan Katz and Lior Malka",

year = "2010",

month = dec,

day = "16",

doi = "10.1145/1866307.1866361",

language = "English",

isbn = "9781450302449",

series = "Proceedings of the ACM Conference on Computer and Communications Security",

pages = "485--492",

booktitle = "CCS'10 - Proceedings of the 17th ACM Conference on Computer and Communications Security",

note = "17th ACM Conference on Computer and Communications Security, CCS'10 ; Conference date: 04-10-2010 Through 08-10-2010",

}

Katz, J & Malka, L 2010, Secure text processing with applications to private DNA matching. in CCS'10 - Proceedings of the 17th ACM Conference on Computer and Communications Security. Proceedings of the ACM Conference on Computer and Communications Security, pp. 485-492, 17th ACM Conference on Computer and Communications Security, CCS'10, Chicago, IL, United States, 4/10/10. https://doi.org/10.1145/1866307.1866361

Secure text processing with applications to private DNA matching. / Katz, Jonathan; Malka, Lior.
CCS'10 - Proceedings of the 17th ACM Conference on Computer and Communications Security. 2010. p. 485-492 (Proceedings of the ACM Conference on Computer and Communications Security).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Secure text processing with applications to private DNA matching

AU - Katz, Jonathan

AU - Malka, Lior

PY - 2010/12/16

Y1 - 2010/12/16

N2 - Motivated by the problem of private DNA matching, we consider the design of efficient protocols for secure text processing. Here, informally, a party P1 holds a text T and a party P2 holds a pattern p and some additional information y, and P2 wants to learn {f(T; j; y)} for all locations j where p is found as a substring in T. (In particular, this generalizes the basic pattern matching problem.) We aim for protocols with full security against a malicious P2 that also preserve privacy against a malicious P1 (i.e., one-sided security). We show how to modify Yao's garbled circuit approach to obtain a protocol where the size of the garbled circuit is linear in the number of occurrences of p in T (rather than linear in -T-). Along the way we show a new keyword search protocol that may be of independent interest.

AB - Motivated by the problem of private DNA matching, we consider the design of efficient protocols for secure text processing. Here, informally, a party P1 holds a text T and a party P2 holds a pattern p and some additional information y, and P2 wants to learn {f(T; j; y)} for all locations j where p is found as a substring in T. (In particular, this generalizes the basic pattern matching problem.) We aim for protocols with full security against a malicious P2 that also preserve privacy against a malicious P1 (i.e., one-sided security). We show how to modify Yao's garbled circuit approach to obtain a protocol where the size of the garbled circuit is linear in the number of occurrences of p in T (rather than linear in -T-). Along the way we show a new keyword search protocol that may be of independent interest.

KW - Security

KW - Theory

UR - https://www.scopus.com/pages/publications/78649989154

U2 - 10.1145/1866307.1866361

DO - 10.1145/1866307.1866361

M3 - Conference contribution

AN - SCOPUS:78649989154

SN - 9781450302449

T3 - Proceedings of the ACM Conference on Computer and Communications Security

SP - 485

EP - 492

BT - CCS'10 - Proceedings of the 17th ACM Conference on Computer and Communications Security

T2 - 17th ACM Conference on Computer and Communications Security, CCS'10

Y2 - 4 October 2010 through 8 October 2010

ER -

Secure text processing with applications to private DNA matching

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this