University of Texas

Displaying 1-40 of 294 results

  • White Papers // Jun 2013

    Graduates' Perception of Employment in SMEs and Large Enterprises

    This paper looks at non business (n = 66) and business graduates (n = 18) and compares their employment preference in Small and Medium sized Enterprises (SME) or Large Enterprises (LE). In pursuit, a questionnaire was developed measuring the perception of graduates as regards on the content of a job,...

    Provided By University of Texas

  • White Papers // Aug 2012

    Offloading in Heterogeneous Networks: Modeling, Analysis and Design Insights

    Pushing data traffic from cellular to Wi-Fi is an example of inter-Radio Access Technology (RAT) offloading. While this clearly alleviates congestion on the over-loaded cellular network, the ultimate potential of such offloading and its effect on overall system performance is not well understood. To address this, the authors develop a...

    Provided By University of Texas

  • White Papers // Jul 2012

    Frankenstein: Stitching Malware From Benign Binaries

    This paper proposes a new self-camouflaging malware propagation system, Frankenstein, that overcomes shortcomings in the current generation of metamorphic malware. Specifically, although mutants produced by current state-of-the-art metamorphic engines are diverse, they still contain many characteristic binary features that reliably distinguish them from benign software. Frankenstein forgoes the concept of...

    Provided By University of Texas

  • White Papers // Jun 2012

    New Proof Methods for Attribute-Based Encryption: Achieving Full Security Through Selective Techniques

    The authors develop a new methodology for utilizing the prior techniques to prove selective security for functional encryption systems as a direct ingredient in devising proofs of full security. This deepens the relationship between the selective and full security models and provides a path for transferring the best qualities of...

    Provided By University of Texas

  • White Papers // May 2012

    Dependency Path Patterns as the Foundation of Access Control in Provenance-Aware Systems

    A unique characteristics of provenance data is that it forms a Directed Acyclic Graph (DAG) in accordance with the underlying causality dependencies between entities (acting users, action processes and data objects) involved in transactions. Data provenance raises at least two distinct security-related issues. One is how to control access to...

    Provided By University of Texas

  • White Papers // May 2012

    Tag-Based Information Flow Analysis for Document Classification in Provenance

    A crucial aspect of certain applications such as the ones pertaining to Intelligence domain or Health-care, is to manage and protect sensitive information effectively and efficiently. In this paper, the authors propose a tagging mechanism to track the flow of sensitive or valuable information in a provenance graph and automate...

    Provided By University of Texas

  • White Papers // May 2012

    AnonymousCloud: A Data Ownership Privacy Provider Framework in Cloud Computing

    A means of reliably concealing ownership of cloud data without impeding computation over the data is presented and evaluated. This facilitates information privacy enforcement in cloud environments by withholding data ownership information from cloud nodes that compute using the data. As a result, nodes that have access to private data...

    Provided By University of Texas

  • White Papers // May 2012

    Dual Form Signatures: An Approach for Proving Security From Static Assumptions

    In this paper, the authors introduce the abstraction of Dual Form Signatures as a useful framework for proving security (existential unforgeability) from static assumptions for schemes with special structure that are used as a basis of other cryptographic protocols and applications. They describe the power of this framework by proving...

    Provided By University of Texas

  • White Papers // May 2012

    Hatman: Intra-Cloud Trust Management for Hadoop

    Data and computation integrity and security are major concerns for users of cloud computing facilities. Many production-level clouds optimistically assume that all cloud nodes are equally trustworthy when dispatching jobs; jobs are dispatched based on node load, not reputation. This increases their vulnerability to attack, since compromising even one node...

    Provided By University of Texas

  • White Papers // Apr 2012

    An Empirical Study of Supplementary Bug Fixes

    A recent study finds that errors of omission are harder for programmers to detect than errors of commission. While several change recommendation systems already exist to prevent or reduce omission errors during software development, there have been very few studies on why errors of omission occur in practice and how...

    Provided By University of Texas

  • White Papers // Apr 2012

    Towards Understanding the Fundamentals of Mobility in Cellular Networks

    Despite the central role of mobility in wireless networks, there are surprisingly few fundamental results on its properties. This paper aims to address this gap by proposing a new Random Way-Point (RWP) mobility model defined on the entire plane and applying it to analyze two key cellular network parameters: handover...

    Provided By University of Texas

  • White Papers // Apr 2012

    Vdiff: A Program Differencing Algorithm for Verilog Hardware Description Language

    During code review tasks, comparing two versions of a hardware design description using existing program differencing tools such as diff is inherently limited because these tools implicitly assume sequential execution semantics, while hardware description languages are designed to model concurrent computation. The authors designed a position-independent differencing algorithm to robustly...

    Provided By University of Texas

  • White Papers // Apr 2012

    BRACE: An Assertion Framework for Debugging Cyber-Physical Systems

    Developing Cyber-Physical Systems (CPS) is challenging because correctness depends on both logical and physical states, which are collectively difficult to observe. The developer often need to repeatedly rerun the system while observing its behavior and tweak the hardware and software until it meets minimum requirements. This process is tedious, error-prone,...

    Provided By University of Texas

  • White Papers // Apr 2012

    Extending Java for Android Programming

    Android is one of the most popular platforms for developing mobile applications. However, its framework relies on programming conventions and styles to implement framework-specific concepts like activities and intents, causing problems such as reliability, readability, understandability, and maintainability. The authors propose to extend Java to support Android framework concepts explicitly...

    Provided By University of Texas

  • White Papers // Feb 2012

    A-Serv: A Novel Architecture Providing Scalable Quality of Service

    QoS architectures define how routers process packets to ensure QoS service guarantees enforced. Existing QoS architectures such as Integrated Services (IntServ), Differentiated Services (DiffServ), and Dynamic Packet State (DPS) share one common property that the packet structure and the function of the routers are closely connected. Packets of one data...

    Provided By University of Texas

  • White Papers // Feb 2012

    Security Analysis and Enhancement for Prefix-Preserving Encryption Schemes

    Prefix-Preserving Encryption (PPE) is an important type of encryption scheme, having a wide range of applications, such as IP addresses anonymization, prefix-matching search, and rang search. There are two issues in PPE schemes, security proof and single key requirement. Existing security proofs for PPE only reduce the security of a...

    Provided By University of Texas

  • White Papers // Feb 2012

    Decoupled Dynamic Cache Segmentation

    The Least Recently Used (LRU) replacement policy performs poorly in the Last-Level Cache (LLC) because temporal locality of memory accesses is filtered by first and second level caches. The authors propose a cache segmentation technique that dynamically adapts to cache access patterns by predicting the best number of not-yet-referenced and...

    Provided By University of Texas

  • White Papers // Jan 2012

    Identifying Failure-Inducing Combinations in a Combinatorial Test Set

    A t-way combinatorial test set is designed to detect failures that are triggered by combinations involving no more than t parameters. Assume that the authors have executed a t-way test set and some tests have failed. A natural question to ask is: what combinations have caused these failures? Identifying such...

    Provided By University of Texas

  • White Papers // Jan 2012

    Optimal Surface Deployment Problem in Wireless Sensor Networks

    Sensor deployment is a fundamental issue in a wireless sensor network, which often dictates the overall network performance. Previous studies on sensor deployment mainly focused on sensor networks on 2D plane or in 3D volume. In this paper, the authors tackle the problem of optimal sensor deployment on 3 surfaces,...

    Provided By University of Texas

  • White Papers // Jan 2012

    Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security

    The authors present a new approach for creating chosen ciphertext secure encryption. The focal point of their work is a new abstraction that they call Detectable Chosen Ciphertext Security (DCCA). Intuitively, this notion is meant to capture systems that are not necessarily Chosen Ciphertext Attack (CCA) secure, but where they...

    Provided By University of Texas

  • White Papers // Jan 2012

    XML Query Routing in Structured P2P Systems

    This paper addresses the problem of data placement, indexing, and querying large XML data repositories distributed over an existing P2P service infrastructure. The authors' architecture scales gracefully to the network and data sizes, is fully distributed, fault tolerant and self-organizing, and handles complex queries efficiently, even those queries that use...

    Provided By University of Texas

  • White Papers // Jan 2012

    A Lightweight Algorithm for Causal Message Ordering in Mobile Computing Systems

    Causally ordered message delivery is a required property for several distributed applications particularly those that involve human interactions (such as teleconferencing and collaborative work). In this paper, the authors present an efficient protocol for causal ordering in mobile computing systems. This protocol requires minimal resources on mobile hosts and wireless...

    Provided By University of Texas

  • White Papers // Dec 2011

    Making Argument Systems for Outsourced Computation Practical (Sometimes)

    This paper describes the design, implementation, and evaluation of a system for performing verifiable outsourced computation. It has long been known that this problem can be solved in theory using Probabilistically Checkable Proofs (PCPs) coupled with modern cryptographic tools, and these solutions have wholly impractical performance, according to the conventional...

    Provided By University of Texas

  • White Papers // Nov 2011

    Heterogeneous Cellular Networks: From Theory to Practice

    The proliferation of internet-connected mobile devices will continue to drive growth in data traffic in an exponential fashion, forcing network operators to dramatically increase the capacity of their networks. To do this cost-effectively, a paradigm shift in cellular network infrastructure deployment is occurring away from traditional (expensive) high-power tower-mounted base...

    Provided By University of Texas

  • White Papers // Nov 2011

    Efficient Similarity Search Over Encrypted Data

    In recent years, due to the appealing features of cloud computing, large amount of data have been stored in the cloud. Although cloud based services offer many advantages, privacy and security of the sensitive data is a big concern. To mitigate the concerns, it is desirable to outsource sensitive data...

    Provided By University of Texas

  • White Papers // Nov 2011

    Insider Threat Detection Using Stream Mining and Graph Mining

    Evidence of malicious insider activity is often buried within large data streams, such as system logs accumulated over months or years. Ensemble-based stream mining leverages multiple classification models to achieve highly accurate anomaly detection in such streams even when the stream is unbounded, evolving, and unlabeled. This makes the approach...

    Provided By University of Texas

  • White Papers // Nov 2011

    Program Interferometry

    Modern microprocessors have many micro-architectural features. Quantifying the performance impact of one feature such as dynamic branch prediction can be difficult. On one hand, a timing simulator can predict the difference in performance given two different implementations of the technique, but simulators can be quite inaccurate. On the other hand,...

    Provided By University of Texas

  • White Papers // Nov 2011

    Functional Verification of Class Invariants in CleanJava

    In Cleanroom-style functional program verification, a program is viewed as a mathematical function from one program state to another, and the program is verified by comparing two functions, the implemented and the expected behaviors of a program. The technique requires a minimal mathematical background and supports forward reasoning, but it...

    Provided By University of Texas

  • White Papers // Oct 2011

    An Optimized Scaled Neural Branch Predictor

    Conditional branch prediction remains one of the most important enabling technologies for high-performance microprocessors. A small improvement in accuracy can result in a large improvement in performance as well as a significant reduction in energy wasted on wrong-path instructions. Neural-based branch predictors have been among the most accurate in the...

    Provided By University of Texas

  • White Papers // Sep 2011

    Transmission Capacity of Ad-Hoc Networks With Multiple Antennas Using Transmit Stream Adaptation and Interference Cancelation

    The transmission capacity of an ad-hoc network is the maximum density of active transmitters per unit area, given an outage constraint at each receiver for a fixed rate of transmission. Assuming that the transmitter locations are distributed as a Poisson point process, this paper derives upper and lower bounds on...

    Provided By University of Texas

  • White Papers // Sep 2011

    Supervised Learning for Insider Threat Detection Using Stream Mining

    Insider threat detection requires the identification of rare anomalies in contexts where evolving behaviors tend to mask such anomalies. This paper proposes and tests an ensemble-based stream mining algorithm based on supervised learning that addresses this challenge by maintaining an evolving collection of multiple models to classify dynamic data streams...

    Provided By University of Texas

  • White Papers // Sep 2011

    Toward the Verification of a Simple Hypervisor

    Virtualization promises significant benefits in security, efficiency, dependability, and cost. Achieving these benefits depends upon the reliability of the underlying virtual machine monitors (hypervisors). This paper describes an ongoing project to develop and verify MinVisor, a simple but functional Type-I x86 hypervisor, proving protection properties at the assembly level using...

    Provided By University of Texas

  • White Papers // Sep 2011

    AOVis: A Model-Driven Multiple-Graph Approach to Program Fact Extraction for AspectJ/Java Source Code

    AspectJ reverse engineering and visualization remains a challenge at the architectural and design levels, with fewer tools available for reverse engineers compared to other languages such as Java. Prior work on AspectJ modeling focused on forward engineering or detailed-design reverse engineering, or required special instrumentation to identify cross-cutting relationships. Effective...

    Provided By University of Texas

  • White Papers // Aug 2011

    Remote Batch Invocation for SQL Databases

    Batch services are a new approach to distributed computation in which clients send batches of operations for execution on a server and receive hierarchical results sets in response. In this paper, the authors show how batch services provide a simple and powerful interface to relational databases, with support for arbitrary...

    Provided By University of Texas

  • White Papers // Aug 2011

    The CleanJava Language for Functional Program Verification

    Unlike Hoare-style program verification, functional program verification supports forward reasoning by viewing a program as a mathematical function from one program state to another and proving its correctness by essentially comparing two mathematical functions, the function computed by the program and its specification. Since it requires a minimal mathematical background...

    Provided By University of Texas

  • White Papers // Aug 2011

    A Tutorial on Functional Program Verification

    This paper gives a quick tutorial introduction to functional program verification. In functional program verification, a program is viewed as a mathematical function from one program state to another, and proving its correctness is essentially comparing two mathematical functions, the function computed by the program and the specification of the...

    Provided By University of Texas

  • White Papers // Jul 2011

    Distributed SIR-Aware Scheduling in Large-Scale Wireless Networks

    Opportunistic scheduling and routing can in principle greatly increase the throughput of decentralized wireless networks, but to be practical such algorithms must do so with small amounts of timely side information. In this paper, the authors propose three related techniques for low-overhead Distributed Opportunistic Scheduling (DOS) and precisely determine their...

    Provided By University of Texas

  • White Papers // Jul 2011

    Heterogeneous Cellular Networks With Flexible Cell Association: A Comprehensive Downlink SINR Analysis

    In this paper, the authors develop a tractable framework for SINR analysis in downlink Heterogeneous Cellular Networks (HCNs) with flexible cell association policies. The HCN is modeled as a multi-tier cellular network where each tier's Base Stations (BSs) are randomly located and have a particular transmit power, path loss exponent,...

    Provided By University of Texas

  • White Papers // Jul 2011

    Capacity Bounds on Multiuser MIMO Transmission in Random Wireless Networks

    The authors consider a large wireless ad hoc network in which each multi-antenna transmitting node sends multiple independent streams to different receivers in a Poisson field of interferers. They provide exact expressions and simplified approximations on the outage probability, contention density, and transmission capacity for dirty paper coding with perfect...

    Provided By University of Texas

  • White Papers // Jul 2011

    Multiuser Zero-Forcing Beamforming With Limited Feedback in Wireless Ad Hoc Networks

    The effect of limited feedback on point-to-multipoint communication is investigated in multi-antennas wireless ad hoc networks. The authors consider zero-forcing beamforming with quantized channel direction information and derive new closed-form expressions for the outage probability, throughput, transmission capacity, and average user rate. Expressions for the performance degradation due to finite...

    Provided By University of Texas

  • White Papers // Jun 2013

    Graduates' Perception of Employment in SMEs and Large Enterprises

    This paper looks at non business (n = 66) and business graduates (n = 18) and compares their employment preference in Small and Medium sized Enterprises (SME) or Large Enterprises (LE). In pursuit, a questionnaire was developed measuring the perception of graduates as regards on the content of a job,...

    Provided By University of Texas

  • White Papers // Aug 2010

    Reducing Configurations to Monitor in a Software Product Line

    A software product line is a family of programs where each program is defined by a unique combination of features. Product lines, like conventional programs, can be checked for safety properties through execution monitoring. However, because a product line induces a number of programs that is potentially exponential in the...

    Provided By University of Texas

  • White Papers // Jan 2010

    A Comparative Analysis of Parallel Computing Approaches for Genome Assembly

    Over the last two decades, the authors have witnessed a tremendous growth of sequenced genomic data. However, the algorithms and computational power required to expeditiously process, classify, and analyze genomic data has lagged considerably. In bio-informatics, one of the most challenging and computationally intensive processes, which may take up to...

    Provided By University of Texas

  • White Papers // Feb 2012

    A-Serv: A Novel Architecture Providing Scalable Quality of Service

    QoS architectures define how routers process packets to ensure QoS service guarantees enforced. Existing QoS architectures such as Integrated Services (IntServ), Differentiated Services (DiffServ), and Dynamic Packet State (DPS) share one common property that the packet structure and the function of the routers are closely connected. Packets of one data...

    Provided By University of Texas

  • White Papers // May 2010

    Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE

    The authors present a technique for delegating a short lattice basis that has the advantage of keeping the lattice dimension unchanged upon delegation. Building on this result, they construct two new Hierarchical Identity-Based Encryption (HIBE) schemes, with and without random oracles. The resulting systems are very different from earlier lattice-based...

    Provided By University of Texas

  • White Papers // Mar 2011

    Efficient Lattice (H)IBE in the Standard Model

    The authors construct an efficient identity based encryption system based on the standard Learning With Errors (LWE) problem. Their security proof holds in the standard model. The key step in the construction is a family of lattices for which there are two distinct trapdoors for finding short vectors. One trapdoor...

    Provided By University of Texas

  • White Papers // Jan 2012

    Detecting Dangerous Queries: A New Approach for Chosen Ciphertext Security

    The authors present a new approach for creating chosen ciphertext secure encryption. The focal point of their work is a new abstraction that they call Detectable Chosen Ciphertext Security (DCCA). Intuitively, this notion is meant to capture systems that are not necessarily Chosen Ciphertext Attack (CCA) secure, but where they...

    Provided By University of Texas

  • White Papers // May 2009

    ODON: An On-Demand Security Overlay for Mission-Critical Applications

    In this paper, the authors consider the construction of a large-scale, highly available and secure overlay network to enable mission-critical communication between emergency personnel at a disaster area and their coordinating agencies across the Internet. This network is designed to be secure against network-based failures and external attacks including Denial...

    Provided By University of Texas

  • White Papers // Feb 2012

    Decoupled Dynamic Cache Segmentation

    The Least Recently Used (LRU) replacement policy performs poorly in the Last-Level Cache (LLC) because temporal locality of memory accesses is filtered by first and second level caches. The authors propose a cache segmentation technique that dynamically adapts to cache access patterns by predicting the best number of not-yet-referenced and...

    Provided By University of Texas

  • White Papers // Nov 2011

    Program Interferometry

    Modern microprocessors have many micro-architectural features. Quantifying the performance impact of one feature such as dynamic branch prediction can be difficult. On one hand, a timing simulator can predict the difference in performance given two different implementations of the technique, but simulators can be quite inaccurate. On the other hand,...

    Provided By University of Texas

  • White Papers // Oct 2011

    An Optimized Scaled Neural Branch Predictor

    Conditional branch prediction remains one of the most important enabling technologies for high-performance microprocessors. A small improvement in accuracy can result in a large improvement in performance as well as a significant reduction in energy wasted on wrong-path instructions. Neural-based branch predictors have been among the most accurate in the...

    Provided By University of Texas

  • White Papers // Jun 2009

    Graphical Models of Separation Logic

    Graphs are used to model control and data flow among events occurring in the execution of a concurrent program. The authors' treatment of data flow covers both shared storage and external communication. Nevertheless, the laws of Hoare and Jones correctness reasoning remain valid when interpreted in this general model. In...

    Provided By University of Texas

  • White Papers // Nov 2011

    Heterogeneous Cellular Networks: From Theory to Practice

    The proliferation of internet-connected mobile devices will continue to drive growth in data traffic in an exponential fashion, forcing network operators to dramatically increase the capacity of their networks. To do this cost-effectively, a paradigm shift in cellular network infrastructure deployment is occurring away from traditional (expensive) high-power tower-mounted base...

    Provided By University of Texas

  • White Papers // Apr 2012

    An Empirical Study of Supplementary Bug Fixes

    A recent study finds that errors of omission are harder for programmers to detect than errors of commission. While several change recommendation systems already exist to prevent or reduce omission errors during software development, there have been very few studies on why errors of omission occur in practice and how...

    Provided By University of Texas

  • White Papers // Apr 2012

    Vdiff: A Program Differencing Algorithm for Verilog Hardware Description Language

    During code review tasks, comparing two versions of a hardware design description using existing program differencing tools such as diff is inherently limited because these tools implicitly assume sequential execution semantics, while hardware description languages are designed to model concurrent computation. The authors designed a position-independent differencing algorithm to robustly...

    Provided By University of Texas

  • White Papers // Apr 2012

    BRACE: An Assertion Framework for Debugging Cyber-Physical Systems

    Developing Cyber-Physical Systems (CPS) is challenging because correctness depends on both logical and physical states, which are collectively difficult to observe. The developer often need to repeatedly rerun the system while observing its behavior and tweak the hardware and software until it meets minimum requirements. This process is tedious, error-prone,...

    Provided By University of Texas

  • White Papers // Aug 2010

    Template-Based Reconstruction of Complex Refactorings

    Knowing which types of refactoring occurred between two program versions can help programmers better understand code changes. The authors' survey of refactoring identification techniques found that existing techniques cannot easily identify complex refactorings, such as an replace conditional with polymorphism refactoring, which consist of a set of atomic refactorings. This...

    Provided By University of Texas

  • White Papers // Feb 2009

    Discovering and Representing Systematic Code Changes

    Software engineers often inspect program differences when reviewing others' code changes, when writing check-in comments, or when determining why a program behaves differently from expected behavior after modification. Program differencing tools that support these tasks are limited in their ability to group related code changes or to detect potential inconsistencies...

    Provided By University of Texas

  • White Papers // Apr 2012

    Extending Java for Android Programming

    Android is one of the most popular platforms for developing mobile applications. However, its framework relies on programming conventions and styles to implement framework-specific concepts like activities and intents, causing problems such as reliability, readability, understandability, and maintainability. The authors propose to extend Java to support Android framework concepts explicitly...

    Provided By University of Texas

  • White Papers // Aug 2010

    Minimum-Delay Service Provisioning in Opportunistic Networks

    Opportunistic networks are created dynamically by exploiting contacts between pairs of mobile devices that come within communication range. While forwarding in opportunistic networking has been explored, investigations into asynchronous service provisioning on top of opportunistic networks are unique contributions of this paper. Mobile devices are typically heterogeneous, possess disparate physical...

    Provided By University of Texas

  • White Papers // Apr 2012

    Towards Understanding the Fundamentals of Mobility in Cellular Networks

    Despite the central role of mobility in wireless networks, there are surprisingly few fundamental results on its properties. This paper aims to address this gap by proposing a new Random Way-Point (RWP) mobility model defined on the entire plane and applying it to analyze two key cellular network parameters: handover...

    Provided By University of Texas

  • White Papers // Jun 2011

    Cloaking Malware With the Trusted Platform Module

    The Trusted Platform Module (TPM) is commonly thought of as hardware that can increase platform security. However, it can also be used for malicious purposes. The TPM, along with other hardware, can implement a cloaked computation, whose memory state cannot be observed by any other software, including the operating system...

    Provided By University of Texas

  • White Papers // Apr 2011

    Get Off My Prefix! the Need for Dynamic, Gerontocratic Policies in Inter-Domain Routing

    Inter-domain routing in today's Internet is plagued by security and reliability issues (e.g., prefix hijacking), which are often caused by malicious or Byzantine misbehavior. The authors argue that route selection policies must move beyond static preferences that select routes on the basis of static attributes such as route length or...

    Provided By University of Texas

  • White Papers // Dec 2010

    It's on Me! the Benefit of Altruism in BAR Environments

    Cooperation, a necessity for any Peer-To-Peer (P2P) cooperative service, is often achieved by rewarding good behavior now with the promise of future benefits. However, in most cases, interactions with a particular peer or the service itself eventually end, resulting in some last exchange in which departing participants have no incentive...

    Provided By University of Texas

  • White Papers // Apr 2010

    An Efficient ARQ Scheme for Reliable Video Broadcasting in Wireless LANs

    Video streaming has become a popular and important type of network application. Meanwhile, wireless LANs has been gaining popularity too. It has thus become important to address the reliability problem for video streaming in wireless LANs and for video streaming from the Internet to the users in wireless LANs. This...

    Provided By University of Texas

  • White Papers // Jun 2012

    New Proof Methods for Attribute-Based Encryption: Achieving Full Security Through Selective Techniques

    The authors develop a new methodology for utilizing the prior techniques to prove selective security for functional encryption systems as a direct ingredient in devising proofs of full security. This deepens the relationship between the selective and full security models and provides a path for transferring the best qualities of...

    Provided By University of Texas

  • White Papers // May 2012

    Dual Form Signatures: An Approach for Proving Security From Static Assumptions

    In this paper, the authors introduce the abstraction of Dual Form Signatures as a useful framework for proving security (existential unforgeability) from static assumptions for schemes with special structure that are used as a basis of other cryptographic protocols and applications. They describe the power of this framework by proving...

    Provided By University of Texas

  • White Papers // Feb 2012

    Security Analysis and Enhancement for Prefix-Preserving Encryption Schemes

    Prefix-Preserving Encryption (PPE) is an important type of encryption scheme, having a wide range of applications, such as IP addresses anonymization, prefix-matching search, and rang search. There are two issues in PPE schemes, security proof and single key requirement. Existing security proofs for PPE only reduce the security of a...

    Provided By University of Texas

  • White Papers // May 2012

    Dependency Path Patterns as the Foundation of Access Control in Provenance-Aware Systems

    A unique characteristics of provenance data is that it forms a Directed Acyclic Graph (DAG) in accordance with the underlying causality dependencies between entities (acting users, action processes and data objects) involved in transactions. Data provenance raises at least two distinct security-related issues. One is how to control access to...

    Provided By University of Texas

  • White Papers // May 2012

    Tag-Based Information Flow Analysis for Document Classification in Provenance

    A crucial aspect of certain applications such as the ones pertaining to Intelligence domain or Health-care, is to manage and protect sensitive information effectively and efficiently. In this paper, the authors propose a tagging mechanism to track the flow of sensitive or valuable information in a provenance graph and automate...

    Provided By University of Texas

  • White Papers // Dec 2010

    Just-in-Time Analytics on Large File Systems

    As file systems reach the peta-bytes scale, users and administrators are increasingly interested in acquiring high-level analytical information for file management and analysis. Two particularly important tasks are the processing of aggregate and top-k queries which, unfortunately, cannot be quickly answered by hierarchical file systems such as ext3 and NTFS....

    Provided By University of Texas

  • White Papers // May 2011

    Regret-Freedom Isn't Free

    Cooperative, Peer-To-Peer (P2P) services-distributed systems consisting of participants from Multiple Administrative Domains (MAD)|must deal with the threat of arbitrary (Byzan-tine) failures while incentivizing the cooperation of potentially selfish (rational) nodes that such services rely on to function. Although previous work has generally agreed that these types of participants need to...

    Provided By University of Texas

  • White Papers // May 2011

    Consistency, Availability, and Convergence

    The authors examine the limits of consistency in fault-tolerant distributed storage systems. In particular, they identify fundamental tradeoffs among properties of consistency, availability, and convergence, and the authors close the gap between what is known to be impossible (i.e. CAP) and known systems that are highly-available but that provide weaker...

    Provided By University of Texas

  • White Papers // Jan 2011

    Using Valgrind to Detect Undefined Value Errors With Bit-Precision

    The authors present Memcheck, a tool that has been implemented with the dynamic binary instrumentation framework Valgrind. Memcheck detects a wide range of memory errors in programs as they run. This paper focuses on one kind of error that Memcheck detects: undefined value errors. Such errors are common, and often...

    Provided By University of Texas

  • White Papers // Jan 2011

    DRES: Dynamic Range Encoding Scheme for TCAM Coprocessors

    One of the most critical resource management issues in the use of Ternary Content Addressable Memory (TCAM) for packet classification/filtering is how to effectively support filtering rules with ranges, known as range matching. In this paper, a Dynamic Range Encoding Scheme (DRES) is proposed to significantly improve TCAM storage efficiency...

    Provided By University of Texas

  • White Papers // Jan 2010

    International Protection Of Intellectual Property: A Quantitative Assessment

    The strength of Intellectual Property Right (IPR) protection varies across countries and these differences have persisted across time. In this paper, the author builds a multi-country dynamic model where governments choose IPR policies each period. The author uses country heterogeneity in education, population, and bilateral trade costs to induce IPR...

    Provided By University of Texas

  • White Papers // Jun 2011

    3G Meets the Internet: Understanding the Performance of Hierarchical Routing in 3G Networks

    The volume of Internet traffic over 3G wireless networks is sharply rising. In contrast to many Internet services utilizing replicated resources, such as Content Distribution Networks (CDN), the current 3G standard architecture employs hierarchical routing, where all user data traffic goes through a small number of aggregation points using logical...

    Provided By University of Texas

  • White Papers // Jul 2010

    Wi-HTest: Compliance Test Tool for Real-Time WirelessHART Mesh Network Devices

    WirelessHART was released in September 2007 and became IEC standard in April 2010 (IEC 62591). It is the first open wireless communication standard specifically designed for real-time process control applications. It is designed to the same standard as its wired counterpart for reliability and interoperability. To ensure the compliance with...

    Provided By University of Texas

  • White Papers // Aug 2010

    Greedy Distance Vector Routing

    Greedy Distance Vector (GDV) is the first geographic routing protocol designed to optimize end-to-end path costs using any additive routing metric, such as: hop count, latency, ETX, ETT, etc. GDV requires no node location information. Instead, GDV uses estimated routing costs to destinations which are locally computed from node positions...

    Provided By University of Texas

  • White Papers // Jun 2010

    Geographic Routing in d-Dimensional Spaces With Guaranteed Delivery and Low Stretch

    Almost all geographic routing protocols have been designed for 2D. The authors present a novel geographic routing protocol, MDT, for 2D, 3D, and higher dimensions with these properties: guaranteed delivery for any connected graph of nodes and physical links, and low routing stretch from efficient forwarding of packets at local...

    Provided By University of Texas