PRIVATE SEARCHING FOR SENSITIVE FILE SIGNATURES

John Solis

2011

Abstract

We consider the problem of privately searching for sensitive or classified file signatures on an untrusted server. Inspired by the private stream searching system of Ostrovsky and Skeith, we propose a new scheme optimized for matching individual file signatures (versus keyword matching in documents). Our optimization stems from the simple observation that a complete list of matching file signatures can be replaced by a much smaller encrypted bitmask. This approach reduces a server’s response overhead from being linear in the number of matched documents to linear with respect to a system robustness parameter.

Paper Citation

in Harvard Style

Solis J. (2011). PRIVATE SEARCHING FOR SENSITIVE FILE SIGNATURES . In Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2011) ISBN 978-989-8425-71-3, pages 341-344. DOI: 10.5220/0003466703410344

in Bibtex Style

@conference{secrypt11,
author={John Solis},
title={PRIVATE SEARCHING FOR SENSITIVE FILE SIGNATURES},
booktitle={Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2011)},
year={2011},
pages={341-344},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003466703410344},
isbn={978-989-8425-71-3},
}

in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2011)
TI - PRIVATE SEARCHING FOR SENSITIVE FILE SIGNATURES
SN - 978-989-8425-71-3
AU - Solis J.
PY - 2011
SP - 341
EP - 344
DO - 10.5220/0003466703410344