Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 10 of 10
Full-Text Articles in Physical Sciences and Mathematics
User Survey Regarding The Needs Of Network Researchers In Trace-Anonymization Tools, Jihwang Yeo, Keren Tan, David Kotz
User Survey Regarding The Needs Of Network Researchers In Trace-Anonymization Tools, Jihwang Yeo, Keren Tan, David Kotz
Computer Science Technical Reports
To understand the needs of network researchers in an anonymization tool, we conducted a survey on the network researchers. We invited network researchers world-wide to the survey by sending invitation emails to well-known mailing lists whose subscribers may be interested in network research with collecting, sharing and sanitizing network traces.
Katana: A Hot Patching Framework For Elf Executables, Ashwin Ramaswamy, Sergey Bratus, Michael E. Locasto, Sean W. Smith
Katana: A Hot Patching Framework For Elf Executables, Ashwin Ramaswamy, Sergey Bratus, Michael E. Locasto, Sean W. Smith
Computer Science Technical Reports
Despite advances in software modularity, security, and reliability, offline patching remains the predominant form of updating or protecting commodity software. Unfortunately, the mechanics of hot patching (the process of upgrading a program while it executes) remain understudied, even though such a capability offers practical benefits for both consumer and mission-critical systems. A reliable hot patching procedure would serve particularly well by reducing the downtime necessary for critical functionality or security upgrades. Yet, hot patching also carries the risk -- real or perceived -- of leaving the system in an inconsistent state, which leads many owners to forego its benefits as …
Semantic And Visual Encoding Of Diagrams, Gabriel A. Weaver
Semantic And Visual Encoding Of Diagrams, Gabriel A. Weaver
Computer Science Technical Reports
Constructed geometric diagrams capture a dynamic relationship between text and image that played a central role in ancient science and mathematics. Euclid, Theodosius, Ptolemy, Archimedes and others constructed diagrams to geometrically model optics, astronomy, cartography, and hydrostatics. Each derived geometric properties from their models and interpreted their results with respect to the model's underlying semantics. Although diagram construction is a dynamic process, the media in which these works were published (manuscripts and books) forced scholars to either view a snapshot of that process (a static image) or manually perform the entire construction. Mainstream approaches to digitization represent constructed diagrams as …
Distributed Monitoring Of Conditional Entropy For Network Anomaly Detection, Chrisil Arackaparambil, Sergey Bratus, Joshua Brody, Anna Shubina
Distributed Monitoring Of Conditional Entropy For Network Anomaly Detection, Chrisil Arackaparambil, Sergey Bratus, Joshua Brody, Anna Shubina
Computer Science Technical Reports
Monitoring the empirical Shannon entropy of a feature in a network packet stream has previously been shown to be useful in detecting anomalies in the network traffic. Entropy is an information-theoretic statistic that measures the variability of the feature under consideration. Anomalous activity in network traffic can be captured by detecting changes in this variability. There are several challenges, however, in monitoring this statistic. Computing the statistic efficiently is non-trivial. Further, when monitoring multiple features, the streaming algorithms proposed previously would likely fail to keep up with the ever-increasing channel bandwidth of network traffic streams. There is also the concern …
A Computational Framework For Certificate Policy Operations, Gabriel A. Weaver, Scott Rea, Sean W. Smith
A Computational Framework For Certificate Policy Operations, Gabriel A. Weaver, Scott Rea, Sean W. Smith
Computer Science Technical Reports
The trustworthiness of any Public Key Infrastructure (PKI) rests upon the expectations for trust, and the degree to which those ex- pectations are met. Policies, whether implicit as in PGP and SDSI/SPKI or explicitly required as in X.509, document expectations for trust in a PKI. The widespread use of X.509 in the context of global e-Science infrastructures, financial institutions, and the U.S. Federal government demands efficient, transparent, and reproducible policy decisions. Since current manual processes fall short of these goals, we designed, built, and tested computational tools to process the citation schemes of X.509 certificate policies defined in RFC 2527 …
Applying Domain Knowledge From Structured Citation Formats To Text And Data Mining: Examples Using The Cite Architecture, D Neel Smith, Gabriel A. Weaver
Applying Domain Knowledge From Structured Citation Formats To Text And Data Mining: Examples Using The Cite Architecture, D Neel Smith, Gabriel A. Weaver
Computer Science Technical Reports
Domain knowledge expressed in structured citation formats can be exploited in data mining. We propose four structural properties of canonically cited texts, then look at to two classic problems in the study of the scholia, or ancient scholarly commentary, found in the manuscripts of the Iliad. We cluster citations of scholia to analyze their distribution in different manuscripts; this leads to a revised view of how the manuscripts' scribes drew on their source material. Correlated frequencies of named entities suggest that one group of manuscripts had access to material more closely based on the work of the greatest Hellenistic editor …
Dynamic Universal Accumulators For Ddh Groups And Their Application To Attribute-Based Anonymous Credential Systems, Man Ho Au, Patrick P. Tsang, Willy Susilo, Yi Mu
Dynamic Universal Accumulators For Ddh Groups And Their Application To Attribute-Based Anonymous Credential Systems, Man Ho Au, Patrick P. Tsang, Willy Susilo, Yi Mu
Computer Science Technical Reports
We present the first dynamic universal accumulator that allows (1) the accumulation of elements in a DDH-hard group G and (2) one who knows x such that y=g^x has --- or has not --- been accumulated, where g generates G, to efficiently prove her knowledge of such x in zero knowledge, and hence without revealing, e.g., x or y. We introduce the Attribute-Based Anonymous Credential System (ABACS), which allows the verifier to authenticate anonymous users according to any access control policy expressible as a formula of possibly negated boolean user attributes. We construct the system from our accumulator.
Authenticated Streamwise On-Line Encryption, Patrick P. Tsang, Rouslan V. Solomakhin, Sean W. Smith
Authenticated Streamwise On-Line Encryption, Patrick P. Tsang, Rouslan V. Solomakhin, Sean W. Smith
Computer Science Technical Reports
In Blockwise On-line Encryption, encryption and decryption return an output block as soon as the next input block is received. In this paper, we introduce Authenticated Streamwise On-line Encryption (ASOE), which operates on plaintexts and ciphertexts as streams of arbitrary length (as opposed to fixed-sized blocks), and thus significantly reduces message expansion and end-to-end latency. Also, ASOE provides data authenticity as an option. ASOE can therefore be used to efficiently secure resource-constrained communications with real-time requirements such as those in the electric power grid and wireless sensor networks. We investigate and formalize ASOE's strongest achievable notion of security, and present …
Approximability Of The Unsplittable Flow Problem On Trees, Chrisil Arackaparambil, Amit Chakrabarti, Chien-Chung Huang
Approximability Of The Unsplittable Flow Problem On Trees, Chrisil Arackaparambil, Amit Chakrabarti, Chien-Chung Huang
Computer Science Technical Reports
We consider the approximability of the Unsplittable Flow Problem (UFP) on tree graphs, and give a deterministic quasi-polynomial time approximation scheme for the problem when the number of leaves in the tree graph is at most poly-logarithmic in $n$ (the number of demands), and when all edge capacities and resource requirements are suitably bounded. Our algorithm generalizes a recent technique that obtained the first such approximation scheme for line graphs. Our results show that the problem is not APX-hard for such graphs unless NP \subseteq DTIME(2^{polylog(n)}). Further, a reduction from the Demand Matching Problem shows that UFP is APX-hard when …
A Combined Routing Method For Ad Hoc Wireless Networks, Soumendra Nanda, Zhenhui Jiang, David Kotz
A Combined Routing Method For Ad Hoc Wireless Networks, Soumendra Nanda, Zhenhui Jiang, David Kotz
Computer Science Technical Reports
Several simulation and real world studies show that certain ad hoc routing protocols perform better than others under specific mobility and traffic patterns. In order to exploit this phenomena, we propose a novel approach to adapt a network to changing conditions; we introduce "a combined routing method" that allows the network to seamlessly swap from one routing protocol to another protocol dynamically, while routing continues uninterrupted. By creating a thin new virtual layer, we enable each node in the ad hoc wireless network notify each other about the protocol swap and we do not make any changes to existing routing …