Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- University of Dayton (21)
- Singapore Management University (16)
- Old Dominion University (15)
- City University of New York (CUNY) (6)
- University of Arkansas, Fayetteville (5)
-
- Southern Methodist University (4)
- Air Force Institute of Technology (3)
- Montclair State University (3)
- Rose-Hulman Institute of Technology (3)
- Virginia Commonwealth University (3)
- California State University, San Bernardino (2)
- Indian Statistical Institute (2)
- Kennesaw State University (2)
- Portland State University (2)
- San Jose State University (2)
- The University of San Francisco (2)
- University of Central Florida (2)
- University of Connecticut (2)
- University of Kentucky (2)
- University of North Florida (2)
- University of South Alabama (2)
- Arkansas Tech University (1)
- Boise State University (1)
- Brigham Young University (1)
- Chinese Academy of Sciences (1)
- College of Saint Benedict and Saint John's University (1)
- Dakota State University (1)
- Eastern Washington University (1)
- Fort Hays State University (1)
- Georgia Southern University (1)
- Keyword
-
- Cryptography (12)
- Algorithms (7)
- Privacy (7)
- Security (6)
- Cybersecurity (5)
-
- Encryption (5)
- Malware (5)
- Computer security (4)
- Delay (4)
- Quantum Computing (4)
- Computer science (3)
- Information Retrieval (3)
- Large-scale systems (3)
- Machine learning (3)
- Robustness (3)
- Sensors (3)
- Accuracy (2)
- Analytical models (2)
- Asymmetric Cryptography (2)
- Big data (2)
- Classification (2)
- Cloud computing (2)
- Clustering (2)
- Communication (2)
- Computer networks -- Security measures (2)
- Data models (2)
- Data privacy (2)
- Deep learning (2)
- Discrete Logarithm (2)
- FPGA (2)
- Publication Year
- Publication
-
- Computer Science Faculty Publications (19)
- Research Collection School Of Computing and Information Systems (16)
- Dissertations, Theses, and Capstone Projects (4)
- Theses and Dissertations (4)
- Cybersecurity Undergraduate Research Showcase (3)
-
- Department of Computer Science Faculty Scholarship and Creative Works (3)
- Electrical & Computer Engineering Faculty Publications (3)
- Graduate Theses and Dissertations (3)
- Mathematical Sciences Technical Reports (MSTR) (3)
- SMU Data Science Review (3)
- Computer Science Faculty Publications and Presentations (2)
- Computer Science Theses & Dissertations (2)
- Computer Science Working Papers (2)
- Computer Science and Computer Engineering Undergraduate Honors Theses (2)
- Dissertations (2)
- Electronic Theses and Dissertations (2)
- Graduate Studies Theses and Dissertations 2026 (2)
- Master’s Dissertations (2)
- Media Studies (2)
- Publications and Research (2)
- UNF Graduate Theses and Dissertations (2)
- VMASC Publications (2)
- ATU Scholars Symposium (1)
- All NMU Master's Theses (1)
- Boise State University Theses and Dissertations (1)
- Bulletin of Chinese Academy of Sciences (Chinese Version) (1)
- CCAC Theses and Dissertations (1)
- CERIAS Technical Reports (1)
- CSB and SJU Distinguished Thesis (1)
- College of Graduate Studies: Theses & Dissertations (1)
- Publication Type
Articles 121 - 134 of 134
Full-Text Articles in Theory and Algorithms
An Application Of Automated Theorem Provers To Computer System Security: The Schematic Protection Model, Mitchell D.I. Hirschfeld
An Application Of Automated Theorem Provers To Computer System Security: The Schematic Protection Model, Mitchell D.I. Hirschfeld
Theses and Dissertations
The Schematic Protection Model is specified in SAL and theorems about Take-Grant and New Technology File System schemes are proven. Arbitrary systems can be specified in SPM and analyzed. This is the first known automated analysis of SPM specifications in a theorem prover. The SPM specification was created in such a way that new specifications share the underlying framework and are configurable within the specifications file alone. This allows new specifications to be created with ease as demonstrated by the four unique models included within this document. This also allows future users to more easily specify models without recreating the …
Personalization By Website Transformation: Theory And Practice, Saverio Perugini
Personalization By Website Transformation: Theory And Practice, Saverio Perugini
Computer Science Faculty Publications
We present an analysis of a progressive series of out-of-turn transformations on a hierarchical website to personalize a user’s interaction with the site. We formalize the transformation in graph-theoretic terms and describe a toolkit we built that enumerates all of the traversals enabled by every possible complete series of these transformations in any site and computes a variety of metrics while simulating each traversal therein to qualify the relationship between a site’s structure and the cumulative effect of support for the transformation in a site. We employed this toolkit in two websites. The results indicate that the transformation enables users …
Nearest Neighbor Search With Strong Location Privacy, Stavros Papadopoulos, Spiridon Bakiras, Dimitris Papadias
Nearest Neighbor Search With Strong Location Privacy, Stavros Papadopoulos, Spiridon Bakiras, Dimitris Papadias
Publications and Research
The tremendous growth of the Internet has significantly reduced the cost of obtaining and sharing information about individuals, raising many concerns about user privacy. Spatial queries pose an additional threat to privacy because the location of a query may be sufficient to reveal sensitive information about the querier. In this paper we focus on k nearest neighbor (kNN) queries and define the notion of strong location privacy, which renders a query indistinguishable from any location in the data space. We argue that previous work fails to support this property for arbitrary kNN search. Towards this end, we introduce methods that …
Robust Lifetime Measurement In Large-Scale P2p Systems With Non-Stationary Arrivals, Xiaoming Wang, Zhongmei Yao, Yueping Zhang, Dmitri Loguinov
Robust Lifetime Measurement In Large-Scale P2p Systems With Non-Stationary Arrivals, Xiaoming Wang, Zhongmei Yao, Yueping Zhang, Dmitri Loguinov
Computer Science Faculty Publications
Characterizing user churn has become an important topic in studying P2P networks, both in theoretical analysis and system design. Recent work has shown that direct sampling of user lifetimes may lead to certain bias (arising from missed peers and round-off inconsistencies) and proposed a technique that estimates lifetimes based on sampled residuals. In this paper, however, we show that under non-stationary arrivals, which are often present in real systems, residual-based sampling does not correctly reconstruct user lifetimes and suffers a varying degree of bias, which in some cases makes estimation completely impossible. We overcome this problem using two contributions: a …
Finding Irc-Like Meshes Sans Layer 7 Payloads, Akshay Dua, Jim Binkley, Suresh Singh
Finding Irc-Like Meshes Sans Layer 7 Payloads, Akshay Dua, Jim Binkley, Suresh Singh
Computer Science Faculty Publications and Presentations
We present an algorithm for detecting IRC-like chat networks that does not rely on Layer 7 payload information. The goal is to extract only those meshes from conventional flows where long-term periodic data is being exchanged between an external server and multiple internal clients. Flow data is passed through a series of filters that reduce the memory requirements needed for final candidate mesh sorting. Final outputs consist of two sorted lists including the fanout list, sorted by the number of client hosts in the mesh, and a secondary list called the evil sort. The latter consists of meshes with any …
User Interface Design, Moritz Stefaner, Sebastien Ferre, Saverio Perugini, Jonathan Koren, Yi Zhang
User Interface Design, Moritz Stefaner, Sebastien Ferre, Saverio Perugini, Jonathan Koren, Yi Zhang
Computer Science Faculty Publications
As detailed in Chap. 1, system implementations for dynamic taxonomies and faceted search allow a wide range of query possibilities on the data. Only when these are made accessible by appropriate user interfaces, the resulting applications can support a variety of search, browsing and analysis tasks. User interface design in this area is confronted with specific challenges. This chapter presents an overview of both established and novel principles and solutions.
Traffic Analysis Of Udp-Based Flows In Ourmon, Jim Binkley, Divya Parekh
Traffic Analysis Of Udp-Based Flows In Ourmon, Jim Binkley, Divya Parekh
Computer Science Faculty Publications and Presentations
We present a custom UDP flow tuple with an IP address key and a set of simple related statistical attributes. Attributes are used to calculate a per host metric called the UDP work weight which roughly measures the amount of network noise caused by a host. The work weight is used to produce a near real-time sorted top N report for UDP host tuples. We also present a derived attribute based on an algorithm called the UDP guesstimator. The UDP guesstimator roughly classifies port report hosts into various traffic categories including security threats (DOS/scanning) or P2P hosts based on high …
Modeling Heterogeneous User Churn And Local Resilience Of Unstructured P2p Networks, Zhongmei Yao, Derek Leonard, Dmitri Loguinov, Xiaoming Wang
Modeling Heterogeneous User Churn And Local Resilience Of Unstructured P2p Networks, Zhongmei Yao, Derek Leonard, Dmitri Loguinov, Xiaoming Wang
Computer Science Faculty Publications
Previous analytical results on the resilience of unstructured P2P systems have not explicitly modeled heterogeneity of user churn (i.e., difference in online behavior) or the impact of in-degree on system resilience. To overcome these limitations, we introduce a generic model of heterogeneous user churn, derive the distribution of the various metrics observed in prior experimental studies (e.g., lifetime distribution of joining users, joint distribution of session time of alive peers, and residual lifetime of a randomly selected user), derive several closed-form results on the transient behavior of in-degree, and eventually obtain the joint in/out degree isolation probability as a simple …
Information Assurance Through Binary Vulnerability Auditing, William B. Kimball, Saverio Perugini
Information Assurance Through Binary Vulnerability Auditing, William B. Kimball, Saverio Perugini
Computer Science Faculty Publications
The goal of this research is to develop improved methods of discovering vulnerabilities in software. A large volume of software, from the most frequently used programs on a desktop computer, such as web browsers, e-mail programs, and word processing applications, to mission-critical services for the space shuttle, is unintentionally vulnerable to attacks and thus insecure. By seeking to improve the identification of vulnerabilities in software, the security community can save the time and money necessary to restore compromised computer systems. In addition, this research is imperative to activities of national security such as counterterrorism. The current approach involves a systematic …
Group Key Management In Wireless Ad-Hoc And Sensor Networks, Mohammed A. Moharrum
Group Key Management In Wireless Ad-Hoc And Sensor Networks, Mohammed A. Moharrum
Computer Science Theses & Dissertations
A growing number of secure group applications in both civilian and military domains is being deployed in WAHNs. A Wireless Ad-hoc Network (WARN) is a collection of autonomous nodes or terminals that communicate with each other by forming a multi-hop radio network and maintaining connectivity in a decentralized manner. A Mobile Ad-hoc Network (MANET) is a special type of WARN with mobile users. MANET nodes have limited communication, computational capabilities, and power. Wireless Sensor Networks (WSNs) are sensor networks with massive numbers of small, inexpensive devices pervasive throughout electrical and mechanical systems and ubiquitous throughout the environment that monitor and …
On Static And Dynamic Partitioning Behavior Of Large-Scale Networks, Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov
On Static And Dynamic Partitioning Behavior Of Large-Scale Networks, Derek Leonard, Zhongmei Yao, Xiaoming Wang, Dmitri Loguinov
Computer Science Faculty Publications
In this paper, we analyze the problem of network disconnection in the context of large-scale P2P networks and understand how both static and dynamic patterns of node failure affect the resilience of such graphs. We start by applying classical results from random graph theory to show that a large variety of deterministic and random P2P graphs almost surely (i.e., with probability 1-o(1)) remain connected under random failure if and only if they have no isolated nodes. This simple, yet powerful, result subsequently allows us to derive in closed-form the probability that a P2P network develops isolated nodes, and therefore partitions, …
Automatically Discovering The Number Of Clusters In Web Page Datasets, Zhongmei Yao
Automatically Discovering The Number Of Clusters In Web Page Datasets, Zhongmei Yao
Computer Science Faculty Publications
Clustering is well-suited for Web mining by automatically organizing Web pages into categories, each of which contains Web pages having similar contents. However, one problem in clustering is the lack of general methods to automatically determine the number of categories or clusters. For the Web domain in particular, currently there is no such method suitable for Web page clustering. In an attempt to address this problem, we discover a constant factor that characterizes the Web domain, based on which we propose a new method for automatically determining the number of clusters in Web page data sets. We discover that the …
Recommender Systems Research: A Connection-Centric Survey, Saverio Perugini, Marcos André Gonçalves, Edward A. Fox
Recommender Systems Research: A Connection-Centric Survey, Saverio Perugini, Marcos André Gonçalves, Edward A. Fox
Computer Science Faculty Publications
Recommender systems attempt to reduce information overload and retain customers by selecting a subset of items from a universal set based on user preferences. While research in recommender systems grew out of information retrieval and filtering, the topic has steadily advanced into a legitimate and challenging research area of its own. Recommender systems have traditionally been studied from a content-based filtering vs. collaborative design perspective. Recommendations, however, are not delivered within a vacuum, but rather cast within an informal community of users and social context. Therefore, ultimately all recommender systems make connections among people and thus should be surveyed from …
Gnarly Rantings About The Hacker And The Ants, Rudy Rucker
Gnarly Rantings About The Hacker And The Ants, Rudy Rucker
SWITCH
The article is an excerpt from Rucker’s book “The Happy Mutant”. It begins with his reflection of his career with GoMotion. He discusses the relation that he saw between design and cyberspace. Later he discusses his experience with a game a colleague found on the net: a virtual world where player is an ant. He talks about the struggles he goes through in this virtual world because of game difficulty and poor visuals. He ties it all in with how the Silicon Valley works in a similar way, and is filled with hackers and programers all needing each other to …