University of Illinois

Displaying 1-40 of 311 results

  • White Papers // Sep 2013

    Factoring RSA Keys From Certified Smart Cards: Coppersmith in the Wild

    In this paper, the authors explain how an attacker can efficiently factor 184 distinct RSA keys out of more than two million 1024-bit RSA keys downloaded from Taiwan's national \"Citizen digital certificate\" database. These keys were generated by government-issued smart cards that have built-in hardware random-number generators and that are...

    Provided By University of Illinois

  • White Papers // Jun 2013

    Authentication in Ethos

    The abstractions used to provide Operating System (OS) authentication are fundamental to a system's security. Authentication primitives should be simple, general, and robust against attack. The authors describe the authentication mechanisms of Ethos, an experimental, clean-slate operating system that has been designed for security. They reexamine and redesign software layering...

    Provided By University of Illinois

  • White Papers // May 2013

    MinimaLT: Minimal-latency Networking Through Better Security

    Minimal Latency Tunneling (MinimaLT) is a new network protocol that provides ubiquitous encryption for maximal confidentiality, including protecting packet headers. MinimaLT provides server and user authentication, extensive Denial-of-Service protections, and IP mobility while approaching perfect forward secrecy. The authors describe the protocol, demonstrate its performance relative to TLS and unencrypted...

    Provided By University of Illinois

  • White Papers // Dec 2012

    WAVES: Automatic Synthesis of Client-Side Validation Code for Web Applications

    The current practice of web application development treats the client and server components of the application as two separate but interacting pieces of software. Each component is written independently, usually in distinct programming languages and development platforms - a process known to be prone to errors when the client and...

    Provided By University of Illinois

  • White Papers // Sep 2012

    Faster Batch Forgery Identification

    The authors' goal in this paper is to minimize the cost of elliptic-curve signature verification. Batch signature verification detects whether a batch of signatures contains any forgeries. Batch forgery identification pinpoints the location of each forgery. Existing forgery-identification schemes vary in their strategies for selecting sub-batches to verify (individual checks,...

    Provided By University of Illinois

  • White Papers // Sep 2012

    Computing Small Discrete Logarithms Faster

    Computations of small discrete logarithms are feasible even in "Secure" groups, and are used as subroutines in several cryptographic protocols in the literature. For example, the Boneh-Goh-Nissim degree- 2-homomorphic public-key encryption system uses generic square-root discrete-logarithm methods for decryption. This paper shows how to use a small group-specific table to...

    Provided By University of Illinois

  • White Papers // Sep 2012

    SipHash: A Fast Short-Input PRF

    SipHash is a family of pseudorandom functions optimized for short inputs. Target applications include network traffic authentication and hash-table lookups protected against hash-flooding denial-of-service attacks. SipHash is simpler than MACs based on universal hashing, and faster on short inputs. Compared to dedicated designs for hash-table lookup, SipHash has well-defined security...

    Provided By University of Illinois

  • White Papers // Aug 2012

    Optimal Cooperative Spectrum Sensing in Cognitive Radio with Taguchi Method

    Spectrum sensing is an essential topic in cognitive radio networks to detect primary users. Cooperative spectrum sensing with linear fusion scheme is studied in multiband channel systems. The problem turns out to be a non-convex optimization problem in general with thresholds of the energy detectors and the weights of linear...

    Provided By University of Illinois

  • White Papers // Jun 2012

    Two-Way Networks: When Adaptation Is Useless

    Most wireless communication networks are two-way, where nodes act as both sources and destinations of messages. This allows for "Adaptation" at or "Interaction" between the nodes - a node's channel inputs may be functions of its message(s) and previously received signals, in contrast to feedback-free one-way channels where inputs are...

    Provided By University of Illinois

  • White Papers // Jun 2012

    Never Trust a Bunny

    Lapin is a lightweight "RFID authentication" system introduced at FSE 2012. The system is claimed to be "Provably Secure Against Active Attacks". This claim is qualified elsewhere in: attacking Lapin-n is provably as difficult as attacking an n-bit "Ring-LPN" problem introduced in the same paper. "Lapin" is a new RFID...

    Provided By University of Illinois

  • White Papers // May 2012

    On the Capacity of Multi-User Two-Way Linear Deterministic Channels

    In multi-user two-way channels nodes are both sources and destinations of messages. This allows for "Adaptation" at or "Interaction" between the nodes - the next channel inputs may be a function of the past received signals at a particular node. How to best adapt is key to two-way communication problems,...

    Provided By University of Illinois

  • White Papers // May 2012

    Exploiting Opportunistic Overhearing to Improve Performance of Mutual Exclusion in Wireless Ad Hoc Networks

    The authors design two mutual exclusion algorithms for wireless networks. Their mutual exclusion algorithms are distributed token based algorithms which exploit the opportunistic message overhearing in wireless networks. One of the algorithms is based on overhearing of token transmission. In the other algorithm, overhearing of both token and request messages...

    Provided By University of Illinois

  • White Papers // May 2012

    The Sum-Capacity of the Linear Deterministic Three-User Cognitive Interference Channel

    Inspired by cognitive networks, the authors consider the linear deterministic three-user cognitive interference channel with one primary and two secondary/cognitive transmitters which approximates the Gaussian channel at high SNR. Outer bounds on the sum-rate are derived and matching transmission schemes are provided in all interference regimes, thereby completely characterizing the...

    Provided By University of Illinois

  • White Papers // May 2012

    Waveform Scheduling Via Directed Information in Cognitive Radar

    The objective of waveform scheduling is to achieve maximal information extraction of the radar scene, which typically changes from one measurement to the next, by exploiting prior statistics and waveform diversity. In this paper waveform scheduling is addressed using information theoretic concepts. A pre-defined waveform library is assumed to be...

    Provided By University of Illinois

  • White Papers // Apr 2012

    Defining the Undefinedness of C

    This paper investigates undefined behavior in C and offers a few simple techniques for operationally specifying such behavior formally. A semantics-based undefinedness checker for C is developed using these techniques, as well as a test suite of undefined programs. The tool is evaluated against other popular analysis tools, using the...

    Provided By University of Illinois

  • White Papers // Apr 2012

    An Architecture for Dynamic Service-Oriented Computing in Networked Embedded Systems

    Software development in real-time and embedded systems has traditionally focused on stand-alone applications with static models for scheduling and resource allocation. The authors' goal is to facilitate the development of embedded applications in an open system, where tasks and resources arrive and leave dynamically, and their execution is concurrent. They...

    Provided By University of Illinois

  • White Papers // Apr 2012

    Algorithmic Approaches to Low Overhead Fault Detection for Sparse Linear Algebra

    The increasing size and complexity of High-Performance Computing systems is making it increasingly likely that individual circuits will produce erroneous results, especially when operated in a low energy mode. Previous techniques for Algorithm - Based Fault Tolerance (ABFT) have been proposed for detecting errors in dense linear operations, but have...

    Provided By University of Illinois

  • White Papers // Apr 2012

    Scoped Synchronization Constraints for Large Scale Actor Systems

    Very large scale systems of autonomous concurrent objects (Actors) require coordination models to meet two competing goals. On the one hand, the coordination models must allow Actors to dynamically modify protocols in order to adapt to requirement changes over the, likely extensive, lifetime of the system. On the other hand,...

    Provided By University of Illinois

  • White Papers // Apr 2012

    Scalable Parametric Runtime Monitoring

    Run-time monitoring is an effective means to improve the reliability of systems. In recent years, parametric monitoring, which is highly suitable for object-oriented systems, has gained significant traction. Previous work on the performance of parametric run-time monitoring has focused on the performance of monitoring only one specification at a time....

    Provided By University of Illinois

  • White Papers // Mar 2012

    JavaMOP: Efficient Parametric Runtime Monitoring Framework

    Runtime monitoring is a technique usable in all phases of the software development cycle, from initial testing, to debugging, to actually maintaining proper function in production code. Of particular importance are parametric monitoring systems, which allow the specification of properties that relate objects in a program, rather than only global...

    Provided By University of Illinois

  • White Papers // Mar 2012

    Usable Assembly Language for GPUs: A Success Story

    The NVIDIA compilers nvcc and ptxas leave the programmer with only very limited control over register allocation, register spills, instruction selection, and instruction scheduling. In theory a programmer can gain control by writing an entire kernel in van der Laan's cudasm assembly language, but this requires tedious, error-prone tracking of...

    Provided By University of Illinois

  • White Papers // Mar 2012

    Non-Blind Watermarking of Network Flows

    Linking network flows is an important problem in intrusion detection as well as anonymity. Passive traffic analysis can link flows but requires long periods of observation to reduce errors. Active traffic analysis, also known as flow watermarking, allows for better precision and is more scalable. Previous flow watermarks introduce significant...

    Provided By University of Illinois

  • White Papers // Mar 2012

    Self-Partitioning Cloud Datastore for Scalable Transaction Processing Proposal

    The authors are designing a new cloud data storage system that will be highly scalable and yet still be able to provide strong data consistency guarantees. Their system extends existing cloud key/value stores with modular components for transaction management and access-based partitioning. They plan to utilize graph theory, clustering algorithms,...

    Provided By University of Illinois

  • White Papers // Mar 2012

    Maximum Likelihood Time Delay Estimation and Cramer-Rao Bounds for Multipath Exploitation

    In this paper, time delay estimation using the maximum likelihood principle is addressed for the multipath exploitation problem, and the corresponding Cramer-Rao bounds are derived. A single wideband radar, and a target in a known reflecting geometry are assumed. If the multipath is indeed detectable and resolvable, it is shown...

    Provided By University of Illinois

  • White Papers // Mar 2012

    OSA: An Optical Switching Architecture for Data Center Networks With Unprecedented Flexibility

    Data Center Networks (DCNs) form the backbone infrastructure of many large-scale enterprise applications as well as emerging cloud computing providers. This paper describes the design, implementation and evaluation of OSA, a novel optical switching architecture for DCNs. Leveraging runtime reconfigurable optical devices, OSA dynamically changes its topology and link capacities,...

    Provided By University of Illinois

  • White Papers // Mar 2012

    From Hoare Logic to Matching Logic

    Matching logic has been recently proposed as an alternative program verification approach. Unlike Hoare logic, where one defines a language-specific proof system that needs to be proved sound for each language separately, matching logic provides a language-independent and sound proof system that directly uses the trusted operational semantics of the...

    Provided By University of Illinois

  • White Papers // Mar 2012

    Towards Categorizing and Formalizing the JDK API

    Formal specification of correct library usage is extremely useful, both for software developers and for the formal analysis tools they use, such as model checkers or runtime monitoring systems. Unfortunately, the process of creating formal specifications is time consuming, and, for the most part, even the libraries in greatest use,...

    Provided By University of Illinois

  • White Papers // Feb 2012

    Making Maude Definitions More Interactive

    This paper presents an interface for achieving interactive executions of Maude terms by allowing console and file Input/Output (I/O) operations. This interface consists of a Maude API for I/O operations, a Java-based server offering I/O capabilities, and a communication protocol between the two implemented using the external objects concept and...

    Provided By University of Illinois

  • White Papers // Feb 2012

    On the Capacity of the Symmetric Interference Channel With a Cognitive Relay at High SNR

    The capacity of the Interference Channel with Cognitive Relay, a channel model which generalizes the broadcast, interference and cognitive interference channels, is still an open question. To make progress towards understanding this complex channel, the authors first consider the binary linear deterministic models that approximate the Gaussian channel at high...

    Provided By University of Illinois

  • White Papers // Feb 2012

    Token-DCF: An Opportunistic MAC Protocol for Wireless Networks

    IEEE 802.11 DCF is the MAC protocol currently used in wireless LANs. 802.11 DCF is inefficient due to two types of overhead; channel idle time and collision time. This paper presents the design and performance evaluation of an efficient MAC protocol for wireless networks, called Token-DCF. Token-DCF decreases both idle...

    Provided By University of Illinois

  • White Papers // Feb 2012

    Towards a Unified Theory of Operational and Axiomatic Semantics

    This paper presents a nine-rule language-independent proof system that takes an operational semantics as axioms and derives program properties, including ones corresponding to Hoare triples. This eliminates the need for language-specific Hoare-style proof rules in order to verify programs, and, implicitly, the tedious step of proving such proof rules sound...

    Provided By University of Illinois

  • White Papers // Jan 2012

    Optimizing Quality-of-Information in Cost-Sensitive Sensor Data Fusion

    This paper investigates maximizing quality of information subject to cost constraints in data fusion systems. The authors consider data fusion applications that try to estimate or predict some current or future state of a complex physical world. Examples include target tracking, path planning, and sensor node localization. Rather than optimizing...

    Provided By University of Illinois

  • White Papers // Jan 2012

    Evaluating Polynomials in Several Variables and Their Derivatives on a GPU Computing Processor

    In order to obtain more accurate solutions of polynomial systems with numerical continuation methods the users use multiprecision arithmetic. Their goal is to offset the overhead of double arithmetic accelerating the path trackers and in particular Newton's method with a general purpose graphics processing unit. In this paper, the authors...

    Provided By University of Illinois

  • White Papers // Jan 2012

    Service Composition for Advanced Multimedia Applications

    By composing distributed, autonomous services dynamically to provide new functionalities, service composition provides an attractive way for customized multimedia content production and delivery. Previous research work has addressed various aspects of service composition such as composibility, QoS-awareness, and load balancing. However, most of the work has focused on applications where...

    Provided By University of Illinois

  • White Papers // Jan 2012

    Enforcing Alias Analysis for Weakly Typed Languages

    Static analysis of programs in weakly typed languages such as C and C++ is generally not sound because of possible memory errors due to dangling pointer references, uninitialized pointers, and array bounds overflow. Optimizing compilers can produce unpredictable results when such errors occur, but this is quite undesirable for many...

    Provided By University of Illinois

  • White Papers // Dec 2011

    Making DTNs Robust Against Spoofing Attacks With Localized Countermeasures

    In this paper, the authors propose countermeasures to mitigate damage caused by spoofing attacks in Delay-Tolerant Networks (DTNs). In their model, an attacker spoofs someone else's address (the victim's) to absorb packets from the network intended for that victim. Address spoofing is arguably a very severe attack in DTNs, compared...

    Provided By University of Illinois

  • White Papers // Dec 2011

    Tiresias: Online Anomaly Detection for Hierarchical Operational Network Data

    Operational network data, management data such as customer care call logs and equipment system logs, is a very important source of information for network operators to detect problems in their networks. Unfortunately, there is lack of efficient tools to automatically track and detect anomalous events on operational data, causing ISP...

    Provided By University of Illinois

  • White Papers // Dec 2011

    Capacity of Byzantine Consensus in Capacity Limited Point-to-Point Networks

    In this paper, the authors investigate the problem of maximizing the throughput, i.e., achieving capacity, of Byzantine consensus in point-to-point networks, in which each link has a capacity constraint. They derive an upper bound of the capacity of consensus in general point-to-point networks, and prove its tightness in 4-node complete...

    Provided By University of Illinois

  • White Papers // Dec 2011

    The Security Impact of a New Cryptographic Library

    This paper introduces a new cryptographic library, NaCl, and explains how the design and implementation of the library avoid various types of cryptographic disasters suffered by previous cryptographic libraries such as OpenSSL. For most cryptographic operations there exist widely accepted standards, such as the Advanced Encryption Standard (AES) for secret-key...

    Provided By University of Illinois

  • White Papers // Nov 2011

    Capacity of Multiple Unicast in Wireless Networks: A Polymatroidal Approach

    A classical result in undirected wireline networks is the near optimality of routing (flow) for multiple-unicast traffic (multiple sources communicating independent messages to multiple destinations): the min cut upper bound is within a logarithmic factor of the number of sources of the max flow. In this paper, the authors "Extend"...

    Provided By University of Illinois

  • White Papers // Sep 2008

    Protecting SIP Proxy Servers From Ringing-Based Denial-of-Service Attacks

    As Internet telephony systems continue to replace existing Public Switched Telephone Network systems, proxy servers running the Session Initiation Protocol (SIP) will continue to grow in importance for Voiceover-IP deployments that use SIP for call signaling. Since the protection of the global telecommunications infrastructure is critical to people's everyday lives,...

    Provided By University of Illinois

  • White Papers // May 2008

    A Lightweight Hypervisor for Malware Analysis

    Malicious software is rampant on the Internet and is costing billions of dollars each year. Safe and thorough analysis of malware is key to protecting systems and cleaning those that have already been infected. This paper proposes a lightweight hardware-supported virtualization platform that is purpose-built for malware analysis. Hardware virtualization...

    Provided By University of Illinois

  • White Papers // Apr 2009

    On Availability of Intermediate Data in Cloud Computations

    This paper takes a renewed look at the problem of managing intermediate data that is generated during dataflow computations (e.g., MapReduce, Pig, Dryad, etc.) within clouds. It discusses salient features of the intermediate data and outline requirements for a solution. Its experiments show that existing local write remote read solutions,...

    Provided By University of Illinois

  • White Papers // May 2009

    Tele-Immersion for Wireless Networks

    Tele-immersive 3D multi camera environments are beginning to emerge and they bring with them lots of applications as well as challenging research problems. They enable cooperative interaction between geographically distributed sites. One of the important questions that arises in the design and implementation of such systems is that how to...

    Provided By University of Illinois

  • White Papers // Jan 2010

    Parallel Objects: Virtualization and In-Process Components

    Developing complex parallel applications that run efficiently on large parallel machines is dif-cult because the programmer has to handle many interrelated issues. Two issues that are of interest here are the specification of the parallel algorithm, and its efficient parallel implementation. Most current parallel programming models require the programmer to...

    Provided By University of Illinois

  • White Papers // Mar 2009

    A New Framework for On-Demand Virtualization, Repurposing and Fusion of Heterogeneous Sensors

    This paper describes the first step towards the realization of complex and large scale cross-organization virtual observatories by presenting a new semantically-enhanced "Sensor Network as a Service" (SNaaS) framework, which can repurpose existing sensor networks as needed and aggregate and fuse heterogeneous sensors into new virtual sensors in near-real-time. The...

    Provided By University of Illinois

  • White Papers // Nov 2008

    Location-Aware Computing

    Location-aware computing refers to systems that can sense the current location of a user or device and change behavior based on this location. Location-aware computing allows institutions to offer new and exciting applications on campus. It also provides a rich environment for experimentation and for construction of interesting prototypes. Precisely,...

    Provided By University of Illinois

  • White Papers // Jan 2010

    Efficient Metadata Management for Cloud Computing Applications

    Cloud computing applications require scalable, elastic and fault tolerant storage system. In this paper, the authors describe how metadata management can be improved for a file system built for large scale data-intensive applications. The authors implement Ring File System (RFS) that uses a single hop Distributed Hash Table, found in...

    Provided By University of Illinois

  • White Papers // Jan 2010

    Interference-Aware Loop-Free Routing For Mesh Networks

    In recent years, there has been an explosive growth in the development of mesh networks to provide cheap yet high band width Internet access to areas that does not have coverage of high-bandwidth wired networks. Such mesh networks are composed of static wireless nodes. Each of these wireless nodes can...

    Provided By University of Illinois

  • White Papers // Sep 2009

    Secure Unified Cellular Ad Hoc Network Routing

    Previous simulations have shown substantial performance gains can be achieved by using hybrid cellular and Wireless LAN (WLAN) approaches. In a hybrid system, a proxy in an area of strong connectivity (And therefore higher bandwidth) forwards traffic on behalf of a client in an area of weaker connectivity (And therefore...

    Provided By University of Illinois

  • White Papers // Jan 2010

    An Architecture for Regulatory Compliant Database Management

    Spurred by financial scandals and privacy concerns, governments worldwide have moved to ensure confidence in digital records by regulating their retention and deletion. These requirements have led to a huge market for compliance storage servers, which ensure that data are not shredded or altered before the end of their mandatory...

    Provided By University of Illinois

  • White Papers // Jan 2010

    Log Correlation for Intrusion Detection: A Proof of Concept

    Intrusion detection is an important part of networked systems security protection. Although commercial products exist, finding intrusions has proven to be a difficult task with limitations under current techniques. Therefore, improved techniques are needed. The authors argue the need for correlating data among different logs to improve intrusion detection systems...

    Provided By University of Illinois

  • White Papers // Dec 2008

    The Design of VoIP Systems With High Perceptual Conversational Quality

    This paper describes the work on real-time two-party and multi-party VoIP (voice-over-IP) systems that can achieve high perceptual conversational quality. It focuses on the fundamental understanding of conversational quality and its trade-offs among the design of speech codecs and strategies for network control, playout scheduling, and loss concealments. The authors'...

    Provided By University of Illinois

  • White Papers // Sep 2008

    Building The Next Silicon Valley: The Role Of Angel Investors In Economic Development

    The success of California's Silicon Valley has led other regions to attempt their own high-tech transformations, yet most imitators have failed. To build a start-up driven high-tech community, at least two base elements must be present: entrepreneurs and funding for their ventures. While some regions face a shortage of talented...

    Provided By University of Illinois

  • White Papers // Sep 2010

    Proteus: A Topology Malleable Data Center Network

    Full-bandwidth connectivity between all servers of a data center may be necessary for all-to-all traffic patterns, but such interconnects suffer from high cost, complexity, and energy consumption. Recent work has argued that if all-to-all traffic is uncommon, oversubscribed network architectures that can adapt the topology to meet traffic demands, are...

    Provided By University of Illinois

  • White Papers // Sep 2009

    OCast: Optimal Multicast Routing Protocol for Wireless Sensor Networks

    In this paper, authors describe oCast, an energy-optimal multicast routing protocol for wireless sensor networks. The general minimum-energy multicast problem is NP-hard. Intermittent connectivity that results from duty-cycling further complicates the problem. Nevertheless, authors present both a centralized and distributed algorithm that are provably optimal when the number of destinations...

    Provided By University of Illinois

  • White Papers // Oct 2008

    Specifying and Analyzing Workflows for Automated Identification and Data Capture

    Humans use computers to carry out tasks that neither is able to do easily alone: humans provide eyes, hands, and judgment while computers provide computation, networking, and storage. This symbiosis is especially evident in workflows where humans identify objects using bar codes or RFID tags and capture data about them...

    Provided By University of Illinois

  • White Papers // May 2009

    Security Policy Implementation Strategies for Common Carrier Monitoring Service Providers

    There are increasing capabilities and demands for the remote monitoring of homes and their occupants. There are a variety of options for the architecture of such monitoring systems entailing trade-offs between privacy, security, cost, manageability and other factors. This paper considers the virtues of building Monitoring Service Providers (MSPs) based...

    Provided By University of Illinois

  • White Papers // Jan 2009

    A Theory of QoS for Wireless

    Wireless networks are increasingly used to carry applications with QoS constraints. Two problems arise when dealing with traffic with QoS constraints. One is admission control, which consists of determining whether it is possible to fulfill the demands of a set of clients. The other is finding an optimal scheduling policy...

    Provided By University of Illinois

  • White Papers // Nov 2008

    Abstractions, Architecture, Mechanisms, and a Middleware for Networked Control

    This paper focus on the mechanism half of the policy mechanism divide for networked control systems, and address the issue of what are the appropriate abstractions and architecture to facilitate their development and deployment. This paper proposes an abstraction of "Virtual Collocation" and its realization by the software infrastructure of...

    Provided By University of Illinois

  • White Papers // Dec 2009

    Q-CSMA: Queue-Length Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks

    Recently, it has been shown that CSMA-type random access algorithms can achieve the maximum possible throughput in ad hoc wireless networks. However, these algorithms assume an idealized continuous-time CSMA protocol where collisions can never occur. In addition, simulation results indicate that the delay performance of these algorithms can be quite...

    Provided By University of Illinois

  • White Papers // Feb 2009

    Embedding Data Within Knowledge Spaces

    The promise of e-Science will only be realized when data is discoverable, accessible, and comprehensible within distributed teams, across disciplines, and over the long-term - without reliance on out-of-band (non-digital) means. The authors have developed the open-source Tupelo semantic content management framework and are employing it to manage a wide...

    Provided By University of Illinois

  • White Papers // Aug 2009

    On Approximating Gaussian Relay Networks With Deterministic Networks

    The authors examine the extent to which Gaussian relay networks can be approximated by deterministic networks, and present two results, one negative and one positive. The gap between the capacities of a Gaussian relay network and a corresponding linear deterministic network can be unbounded. The key reasons are that the...

    Provided By University of Illinois

  • White Papers // Nov 2010

    Attribute-Based Signatures

    The authors introduce Attribute-Based Signatures (ABS), a versatile primitive that allows a party to sign a message with ne-grained control over identifying information. In ABS, a signer, who possesses a set of attributes from the authority, can sign a message with a predicate that is satisfied by his attributes. The...

    Provided By University of Illinois

  • White Papers // Jul 2009

    Attribute-Sets: A Practically Motivated Enhancement to Attribute-Based Encryption

    In distributed systems users need to share sensitive objects with others based on the recipients' ability to satisfy a policy. Attribute-Based Encryption (ABE) is a new paradigm where such policies are specified and cryptographically enforced in the encryption algorithm itself. Ciphertext-Policy ABE (CP-ABE) is a form of ABE where policies...

    Provided By University of Illinois

  • White Papers // Jun 2009

    Minimizing Maximum Response Time and Delay Factor in Broadcast Scheduling

    The authors consider online algorithms in pull-based broadcasting. In this model there are n pages (representing some form of useful information) available at a server and clients request a page that they are interested in. When the server transmits a page p, all outstanding requests for that page p are...

    Provided By University of Illinois

  • White Papers // Oct 2008

    Reliability and Route Diversity in Wireless Networks

    The authors study the problem of communication reliability of wireless networks in a fading environment based on the outage probability formulation. The exact expression for the disconnect probability, the probability that a transmission by a node is not received correctly by any other node in the network, is obtained for...

    Provided By University of Illinois

  • White Papers // Jul 2009

    Reciprocity in Linear Deterministic Networks Under Linear Coding

    The linear deterministic model has been used recently to get a first order understanding of many wireless communication network problems. In many of these cases, it has been pointed out that the capacity regions of the network and its reciprocal (where the communication links are reversed and the roles of...

    Provided By University of Illinois

  • White Papers // Jan 2011

    An Overview of Data Aggregation Architecture For1 Real-Time Tracking With Sensor Networks

    Since sensor nodes normally have limited resources in terms of energy, bandwidth and computation capability, efficiency is a key design goal in sensor network research. As one of techniques to achieve efficiency, data aggregation has been extensively investigated in recent literature. Previous research on data aggregation has demonstrated its effectiveness...

    Provided By University of Illinois

  • White Papers // Jul 2009

    The Open Cloud Testbed: A Wide Area Testbed for Cloud Computing Utilizing High Performance Network Services

    Recently, a number of cloud platforms and services have been developed for data intensive computing, including Hadoop, Sector, CloudStore (formerly KFS), HBase, and Thrift. In order to benchmark the performance of these systems, to investigate their interoperability, and to experiment with new services based on flexible compute node and network...

    Provided By University of Illinois

  • White Papers // Dec 2009

    Optimal Scheduling for Fair Resource Allocation in Ad Hoc Networks With Elastic and Inelastic Traffic

    This paper studies the problem of congestion control and scheduling in ad hoc wireless networks that have to support a mixture of best-effort and real-time traffic. Optimization and stochastic network theory have been successful in designing architectures for fair resource allocation to meet long-term throughput demands. However, to the best...

    Provided By University of Illinois

  • White Papers // Aug 2010

    CPU Gradients: Performance-Aware Energy Conservation in Multitier Systems

    Dynamic Voltage and Frequency Scaling (DVFS) and Virtual Machine (VM) based server consolidation are well known CPU scaling techniques for energy conservation that can have an adverse impact on system performance. For the responsiveness-sensitive multitier applications running in today's data centers, queuing models should ideally be used to predict the...

    Provided By University of Illinois

  • White Papers // Oct 2009

    Routing Tables: Is Smaller Really Much Better?

    The authors examine the case for small Internet routing and forwarding tables in the context of router design. If Moore's Law drives cost effective scaling of hardware performance in excess of the Internet's growth, protocol modifications and "Clean slate" efforts to achieve major reduction in routing table sizes may be...

    Provided By University of Illinois

  • White Papers // Mar 2010

    Securing Vehicular Networks With VIBES

    One of the biggest challenges in making vehicular networks a reality is security. Aside from the clear need for vehicles to be able to authenticate messages from certain personnel, such as police officers and ambulances, secure end-to-end communication will also benefit numerous distributed applications that will be running over these...

    Provided By University of Illinois

  • White Papers // Mar 2011

    Reliability Trade-Off Analysis of Deadline-Sensitive Wireless Messaging Systems

    The need for deadline-sensitive messaging systems is growing fast with the growth in the number of mobile and static devices communicating with each other. With many such devices from different locations exchanging messages over a network, understanding the reliability of message delivery so as to cost-effectively improve it becomes challenging....

    Provided By University of Illinois

  • White Papers // Apr 2011

    Security Through Amnesia: A Software-Based Solution to the Cold Boot Attack on Disk Encryption

    Disk encryption has become an important security measure for a multitude of clients, including governments, corporations, activists, security-conscious professionals, and privacy-conscious individuals. Unfortunately, recent research has discovered an effective side channel attack against any disk mounted by a running machine. This attack, known as the cold boot attack, is effective...

    Provided By University of Illinois

  • White Papers // Apr 2011

    Using the High Productivity Language Chapel to Target GPGPU Architectures

    It has been widely shown that GPGPU architectures offer large performance gains compared to their traditional CPU counterparts for many applications. The downside to these architectures is that the current programming models present numerous challenges to the programmer: lower-level languages, explicit data movement, loss of portability, and challenges in performance...

    Provided By University of Illinois

  • White Papers // Dec 2008

    iShare: Exploiting Opportunistic Ad Hoc Connections for Improving Data Download of Cellular Users

    This paper presents an Incentive-based Sharing (iShare) protocol that blends cellular and ad hoc networks for content dissemination services. With iShare, mobile users download content from a source via cellular links and at the same time form a mesh ad hoc network for peer-to-peer exchange of content data. The mesh...

    Provided By University of Illinois

  • White Papers // Mar 2009

    Runtime Verification of C Memory Safety

    C is the most widely used imperative system's implementation language. While C provides types and high-level abstractions, its design goal has been to provide highest performance which often requires low-level access to memory. As a consequence C supports arbitrary pointer arithmetic, casting, and explicit allocation and deallocation. These operations are...

    Provided By University of Illinois

  • White Papers // Mar 2009

    Effective Ranking of XML Keyword Search Results (Extended Version)

    The popularity of XML has exacerbated the need for an easy-to-use, high precision query interface for XML data. When traditional document-oriented keyword search techniques do not suffice, natural language interfaces and key-word search techniques that take advantage of XML structure make it very easy for ordinary users to query XML...

    Provided By University of Illinois