Scott Schneider
Symantec
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Scott Schneider.
recent advances in intrusion detection | 2009
Kent E. Griffin; Scott Schneider; Xin Hu; Tzi-cker Chiueh
Scanning files for signatures is a proven technology, but exponential growth in unique malware programs has caused an explosion in signature database sizes. One solution to this problem is to use string signatures , each of which is a contiguous byte sequence that potentially can match many variants of a malware family. However, it is not clear how to automatically generate these string signatures with a sufficiently low false positive rate. Hancock is the first string signature generation system that takes on this challenge on a large scale. To minimize the false positive rate, Hancock features a scalable model that estimates the occurrence probability of arbitrary byte sequences in goodware programs, a set of library code identification techniques, and diversity-based heuristics that ensure the contexts in which a signature is embedded in containing malware files are similar to one another. With these techniques combined, Hancock is able to automatically generate string signatures with a false positive rate below 0.1%.
symposium on reliable distributed systems | 2016
Walter Bogorad; Scott Schneider; Haibin Zhang
Cloud storage services are the way of the future, if not the present, but broad adoption is limited by a stark trade-off between privacy and functionality. Many popular cloud services provide search capabilities, but make only nominal efforts to keep user data fully private. Alternatives that search private user data on an untrusted server sacrifice functionality and/or scalability. We describe Norton Zone, Symantecs secure and scalable public storage system based on our valet security model. Whereas most commercial cloud storage systems secure user data with access control and legal mechanisms, Zones cryptographic techniques provide proven privacy guarantees. This gives users an extra layer of security without compromising functionality. Zones performance is comparable to unencrypted cloud storage systems that support search and sharing. We report on the design of Zone and the lessons learned in developing and deploying it in commercial, distributed datacenters scalable to millions of users.
international symposium on algorithms and computation | 2009
Scott Schneider; Michael Spertus
We present a new static dictionary that is very fast and compact, while also extremely easy to implement. A combination of properties make this algorithm very attractive for applications requiring large static dictionaries: 1 High performance, with membership queries taking O(1)-time with a near-optimal constant. 1 Continued high performance in external memory, with queries requiring only 1-2 disk seeks. If the dictionary has n items in
Archive | 2008
Scott Schneider; Kent E. Griffin
\left\{ 0, ..., m\!-\!1 \right\}
Archive | 2008
Kent E. Griffin; Tzi-cker Chiueh; Scott Schneider; Xin Hu
and d is the number of bytes retrieved from disk on each read, then the average number of seeks is
Archive | 2009
Kent E. Griffin; Tzi-cker Chiueh; Scott Schneider
\min\left(1.63, 1 + O\left( \frac{\sqrt{n} \log m}{d} \right)\right)
Archive | 2009
Tzi-cker Chiueh; Kent E. Griffin; Scott Schneider; Xin Hu
. 1 Efficient use of space, storing n items from a universe of size m in
Archive | 2014
Scott Schneider; Walter Bogorad; Haibin Zhang; Sharada Sundaram
n \log m - \frac{1}{2} n \log n + O\left(n + \log \log m\right)
Archive | 2010
Scott Schneider
bits. We prove this space bound with a novel application of the Kolmogorov-Smirnov distribution. 1 Simplicity, with a 20-line pseudo-code construction algorithm and 4-line query algorithm.
Archive | 2014
Scott Schneider; Brian Witten; Ramzi Abi Antoun