University of Maryland

Displaying 1-40 of 169 results

  • White Papers // Feb 2012

    Deaf Cooperation for Secrecy With Multiple Antennas at the Helper

    In this paper, the authors investigate the roles of Cooperative Jamming (CJ) and Noise Forwarding (NF) in improving the achievable secrecy rates of a Gaussian WireTap channel (GWT) when the helper node is equipped with multiple antennas. They decompose the channel from the helper to the eavesdropper into two orthogonal...

    Provided By University of Maryland

  • White Papers // Feb 2012

    Deaf Cooperation and Relay Selection Strategies for Secure Communication in Multiple Relay Networks

    In this paper, the authors investigate the roles of Cooperative Jamming (CJ) and Noise Forwarding (NF) in improving the achievable secrecy rates of a Gaussian WireTap channel (GWT). In particular, they study the role of a deaf helper in confusing the eavesdropper in a GWT channel by either transmitting white...

    Provided By University of Maryland

  • White Papers // Jan 2012

    Secure Communication in Multiple Relay Networks Through Decode-and-Forward Strategies

    In this paper, the authors first study the Decode-and-Forward strategy for secrecy in a single-relay network. They propose a suboptimal Decode-and-Forward with Zero Forcing (DF/ZF) strategy for which they obtain the optimal power control policy. Next, they consider the multiple relay problem. They propose three different strategies based on DF/ZF....

    Provided By University of Maryland

  • White Papers // Jan 2012

    Formal Specification and Analysis of PCF Protocol in the 802.11 Standard Using Systems of Communicating Machines

    With the widespread usage of the 802.11 protocol, it becomes important to study the protocol operation. In this paper, the authors propose a formal model for the point coordination function of the 802.11 MAC layer using systems of communicating machines. Their goal is to analyze the protocol for safety and...

    Provided By University of Maryland

  • White Papers // Jan 2012

    Towards an Optimal Strategy for WLAN Location Determination Systems

    This paper presents a general analysis for the performance of WLAN location determination systems. In particular, the authors present an analytical method for calculating the average distance error and probability of error of WLAN location determination systems. These expressions are obtained with no assumptions regarding the distribution of signal strength...

    Provided By University of Maryland

  • White Papers // Jan 2012

    Kitsune: Efficient, General-Purpose Dynamic Software Updating for C

    Dynamic Software Updating (DSU) systems allow programs to be updated while running, thereby allowing developers to add features and fix bugs without downtime. This paper introduces Kitsune, a new DSU system for C whose design has three notable features. First, Kitsune's updating mechanism updates the whole program, not individual functions....

    Provided By University of Maryland

  • White Papers // Jan 2012

    Jamming Games for Power Controlled Medium Access With Dynamic Traffic

    Due to the broadcast nature of the wireless medium, wireless networks are highly susceptible to jamming attacks. Such attacks are often studied in a game theoretic framework under the assumption of uninterrupted traffic subject to continuous jamming opportunities. The authors analyze the effect of dynamically changing traffic on jamming games...

    Provided By University of Maryland

  • White Papers // Jan 2012

    Universally-Composable Two-Party Computation in Two Rounds

    Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. The authors show here a Universally Composable (UC) protocol (in the common reference string model) for two-party computation of any functionality, where both parties receive output,...

    Provided By University of Maryland

  • White Papers // Dec 2011

    Neighbor Discovery in a Wireless Sensor Network: Multipacket Reception Capability and Physical-Layer Signal Processing

    In randomly deployed networks, such as sensor networks, an important problem for each node is to discover its neighbor nodes so that the connectivity amongst nodes can be established. In this paper, the authors consider this problem by incorporating the physical layer parameters in contrast to the most of the...

    Provided By University of Maryland

  • White Papers // Dec 2011

    Chinese Restaurant Game - Part II: Applications to Wireless Networking, Cloud Computing, and Online Social Networking

    In this paper, the authors proposed a new game, called Chinese restaurant game, to analyze the social learning problem with negative network externality. The best responses of agents in the Chinese restaurant game with imperfect signals are constructed through a recursive method, and the influence of both learning and network...

    Provided By University of Maryland

  • White Papers // Oct 2011

    Wiretap Channels: Implications of the More Capable Condition and Cyclic Shift Symmetry

    Characterization of the rate-equivocation region of a general wiretap channel involves two auxiliary random variables: U, for rate splitting and V, for channel prefixing. Evaluation of regions involving auxiliary random variables is generally difficult. In this paper, the authors explore specific classes of wiretap channels for which the expression and...

    Provided By University of Maryland

  • White Papers // Oct 2011

    The Network Stack Trace: Performance Diagnosis for Networked Systems

    Transient network stalls that degrade application performance are frustrating to users and developers alike. Software bugs, network congestion, and intermittent connectivity all have the same symptoms - low throughput, high latency, and user-level timeouts. In this paper, the authors show how an end host can identify the sources of network...

    Provided By University of Maryland

  • White Papers // Sep 2011

    ITree: Efficiently Discovering High-Coverage Configurations Using Interaction Trees

    Software configurability has many benefits, but it also makes programs much harder to test, as in the worst case the program must be tested under every possible configuration. One potential remedy to this problem is Combinatorial Interaction Testing (CIT), in which typically the developer selects a strength t and then...

    Provided By University of Maryland

  • White Papers // Sep 2011

    Evaluating Dynamic Software Update Safety Using Systematic Testing

    Dynamic Software Updating (DSU) systems patch programs on the fly without incurring downtime. To avoid failures due to the updating process itself, many DSU systems employ timing restrictions. However, timing restrictions are theoretically imperfect, and their practical effectiveness is an open question. This paper presents the first significant empirical evaluation...

    Provided By University of Maryland

  • White Papers // Sep 2011

    Bandwidth Management for Mobile Media Delivery

    Mobile broadband networks such as 3G and WiMAX present unique challenges to media delivery. Rich media applications require high throughput and low end-to-end delay in order to maintain good quality. Due to the inherent noise in congestion signals (delay / loss) on mobile networks, existing bandwidth management approaches are unable...

    Provided By University of Maryland

  • White Papers // Aug 2011

    A Demo of Coco: A Compiler for Monadic Coercions in ML

    Combining monadic computations may induce a significant syntactic overhead. To allow monadic programming in direct style, the authors have developed Coco, a type-based tool that automatically rewrites ML code inserting necessary binds, unit, and morphisms between monads. This tool demonstration will show how to take advantage of Coco to facilitate...

    Provided By University of Maryland

  • White Papers // Aug 2011

    MultiOtter: Multiprocess Symbolic Execution

    Symbolic execution can be an effective technique for exploring large numbers of program paths, but it has generally been applied to programs running in isolation, whose inputs are files or command-line arguments. Programs that take inputs from other programs-servers, for example-have been beyond the reach of symbolic execution. To address...

    Provided By University of Maryland

  • White Papers // Jul 2011

    Motif-Based Topology Design for Efficient Performance by Networks of Mobile Autonomous Vehicles

    Networked systems of autonomous agents have emerged in a variety of applications such as collaborative robotics, mobile sensor networks and disaster relief operations. Complex phenomena are often observed in these systems due to the large number of agents, nonlinear interactions, locality of information transmission, and changes in the connectivity of...

    Provided By University of Maryland

  • White Papers // Jun 2011

    History-Free Sequential Aggregate Signatures

    Aggregation schemes allows to combine several cryptographic values like message authentication codes or signatures into a shorter value such that, despite compression, some notion of unforgeability is preserved. Recently, Eikemeier et al. (SCN 2010) considered the notion of history-free sequential aggregation for message authentication codes, where the sequentially-executed aggregation algorithm...

    Provided By University of Maryland

  • White Papers // Jun 2011

    Towards Shrink-Wrapped Security: Practically Incorporating Context Into Security Services

    The mobile workforce is rapidly increasing, and technological advances make it feasible for these workers to have ubiquitous access to a variety of resources with various protection requirements. The dynamic computing environment of these workers mandates a security paradigm in which security is tightly coupled with a user's current situation....

    Provided By University of Maryland

  • White Papers // Jun 2011

    Universally Composable Synchronous Computation

    In synchronous networks, protocols can achieve security guarantees that are not possible in an asynchronous world: i.e., they can simultaneously achieve input completeness (all honest parties' inputs are included in the computation) and guaranteed termination (honest parties do not "Hang" indefinitely). In practice, truly synchronous networks rarely exist, but synchrony...

    Provided By University of Maryland

  • White Papers // Jun 2011

    Directed Symbolic Execution

    In this paper, the authors study the problem of automatically finding program executions that reach a particular target line. This problem arises in many debugging scenarios; for example, a developer may want to confirm that a bug reported by a static analysis tool on a particular line is a true...

    Provided By University of Maryland

  • White Papers // Jun 2011

    Optimal Packet Scheduling in a Multiple Access Channel With Energy Harvesting Transmitters

    In this paper, the authors investigate the optimal packet scheduling problem in a two-user multiple access communication system, where the transmitters are able to harvest energy from the nature. Under a deterministic system setting, they assume that the energy harvesting times and harvested energy amounts are known before the transmission...

    Provided By University of Maryland

  • White Papers // Jun 2011

    Multi-Receiver Wiretap Channel With Public and Confidential Messages

    The authors study the multi-receiver wiretap channel with public and confidential messages. In this channel, there is a transmitter that wishes to communicate with two legitimate users in the presence of an external eavesdropper. The transmitter sends a pair of public and confidential messages to each legitimate user. While there...

    Provided By University of Maryland

  • White Papers // May 2011

    Round Optimal Blind Signatures

    All known round optimal (i.e., two-move) blind signature schemes either need a common reference string, rely on random oracles, or assume the hardness of some interactive assumption. At Eurocrypt 2010, Fischlin and Schr?der showed that a broad class of three-move blind signature scheme cannot be instantiated in the standard model...

    Provided By University of Maryland

  • White Papers // May 2011

    Secure Multi-Party Computation of Boolean Circuits With Applications to Privacy in On-Line Marketplaces

    Protocols for generic secure Multi-Party Computation (MPC) come in two forms: they either represent the function being computed as a Boolean circuit or as an arithmetic circuit over a large field. Either type of protocol can be used for any function, but the choice of which type of protocol to...

    Provided By University of Maryland

  • White Papers // May 2011

    Analysis of Explanatory and Predictive Architectures and the Relevance in Explaining the Adoption of IT in SMEs

    This paper critiques the explanatory and predictive architectures of six prominent innovation adoption theories with a view to unraveling their individual capabilities in providing lenses to the understanding of the social and idiosyncratic components of Small and Medium Enterprise (SMEs) in adopting Information Technology (IT). The analysis unravels that the...

    Provided By University of Maryland

  • White Papers // May 2011

    Adaptive Transmission Policies for Energy Harvesting Wireless Nodes in Fading Channels

    In this paper, the authors consider a single-user communication system, where an energy harvesting transmitter communicates with a receiver over a fading wireless channel. They design adaptive transmission policies that adapt to the random energy arrivals at the transmitter and random fluctuations in the channel, in order to maximize the...

    Provided By University of Maryland

  • White Papers // May 2011

    LeechLock: Preventing Selfish Clients in the BitTorrent Protocol

    Although the BitTorrent protocol incentivizes sharing by increasing a peer's download rate, tools have demonstrated that the tit-for-tat mechanism alone is insufficient to prevent peers from downloading content without reciprocation. The authors propose an enhancement to the BitTorrent protocol, called Leechlock, which uses globally shared tables to track peers' ratings...

    Provided By University of Maryland

  • White Papers // Apr 2011

    Dynamic Enforcement of Knowledge-Based Security Policies

    This paper explores the idea of knowledge-based security policies, which are used to decide whether to answer queries over secret data based on an estimation of the querier's (possibly increased) knowledge given the results. Limiting knowledge is the goal of existing information release policies that employ mechanisms such as noising,...

    Provided By University of Maryland

  • White Papers // Apr 2011

    CloudFuice: A flexible Cloud-Based Data Integration System

    The advent of cloud computing technologies shows great promise for web engineering and facilitates the development of flexible, distributed, and scalable web applications. Data integration can notably benefit from cloud computing because integrating web data is usually an expensive task. This paper introduces CloudFuice, a data integration system that follows...

    Provided By University of Maryland

  • White Papers // Apr 2011

    Neural Network to Identify Individuals at Health Risk

    The risk of diseases such as heart attack and high blood pressure could be reduced by adequate physical activity. However, even though majority of general population claims to perform some physical exercise, only a minority exercises enough to keep a healthy living style. Thus, physical inactivity has become one of...

    Provided By University of Maryland

  • White Papers // Apr 2011

    Virtual MeshTest - Improving Wireless Network Testbed Using Virtualization and Migration Algorithm

    There are several laboratory-based mobile wireless testbeds such as the MeshTest and the CMU wireless emulator. These testbeds provide powerful computing network platforms for users who want to perform controlled, repeatable, mobile experiments in the lab. However, such systems can only use 10-15 nodes in an experiment. The Virtual Mesh...

    Provided By University of Maryland

  • White Papers // Mar 2011

    Image Ranking and Retrieval Based on Multi-Attribute Queries

    The authors propose a novel approach for ranking and retrieval of images based on multi-attribute queries. Existing image retrieval methods train separate classifiers for each word and heuristically combine their outputs for retrieving multiword queries. Moreover, these approaches also ignore the interdependencies among the query terms. In contrast, they propose...

    Provided By University of Maryland

  • White Papers // Mar 2011

    Constructing Inverted Files on a Cluster of Multicore Processors Near Peak I/O Throughput

    The authors develop a new strategy for processing a collection of documents on a cluster of multicore processors to build the inverted files at almost the peak I/O throughput of the underlying system. The algorithm is based on a number of novel techniques including: A high-throughput pipelined strategy that produces...

    Provided By University of Maryland

  • White Papers // Feb 2011

    Partitioning Detection and Connectivity Restoration Algorithm for Wireless Sensor Actor Networks

    Recently, Wireless Sensor and Actor Networks have been receiving a growing attention from the research community because of their suitability for critical applications. Maintaining inter-actor connectivity becomes extremely crucial in such situations where actors have to quickly plan optimal coordinated response to detected events. Failure of critical actor partitions the...

    Provided By University of Maryland

  • White Papers // Feb 2011

    Managing the Quality of Virtualized Services

    Managing the quality of virtualized services that are delivered on the cloud is very challenging. Such services are often composed of smaller components that are assembled on an as-needed basis. In this paper, the authors propose a framework to measure and semi-automatically track quality delivered by a Virtualized service delivery...

    Provided By University of Maryland

  • White Papers // Jan 2011

    Retrofitting Security in COTS Software With Binary Rewriting

    The authors present a practical tool for inserting security features against low-level software attacks into third-party, proprietary or otherwise binary-only software. They are motivated by the inability of software users to select and use low-overhead protection schemes when source code is unavailable to them, by the lack of information as...

    Provided By University of Maryland

  • White Papers // Jan 2011

    Position Paper: Dynamically Inferred Types for Dynamic Languages

    Over the past few years the authors have been developing Diamondback Ruby (DRuby), a tool that brings static type inference to Ruby, a dynamically typed, object-oriented language. Developing DRuby required creating a Ruby front-end, which was extremely challenging: like other dynamic languages, Ruby has a complex, yet poorly documented syntax...

    Provided By University of Maryland

  • White Papers // Jan 2011

    Using Data for Systemic Financial Risk Management

    The recent financial collapse has laid bare the inadequacies of the information infrastructure supporting the US financial system. Technical challenges around large-scale data systems interact with significant economic forces involving innovation, transparency, confidentiality, complexity, and organizational change, to create a very difficult problem. The post-crisis reform legislation has created a...

    Provided By University of Maryland

  • White Papers // Jan 2011

    Resilient Multicast Using Overlays

    This paper introduces PRM (Probabilistic Resilient Multicast): a multicast data recovery scheme that improves data delivery ratios while maintaining low end-to-end latencies. PRM has both a proactive and a reactive components; this paper describes how PRM can be used to improve the performance of application-layer multicast protocols, especially when there...

    Provided By University of Maryland

  • White Papers // Jan 2011

    Distribution of Path Durations in Mobile Ad-Hoc Networks - Palm's Theorem to the Rescue

    The authors first study the distribution of path duration in multi-hop wireless networks. This paper shows that as the number of hops along a path increases, the path duration distribution can be accurately approximated by an exponential distribution under a set of mild conditions, even when the link duration distributions...

    Provided By University of Maryland

  • White Papers // Jan 2010

    Secure Spaces: Location-Based Secure Wireless Group Communication

    This paper defines "Secure Space" as an enclosed area within which wireless devices can participate in secure group communication. A device is able to join a secure space group by the virtue of its location within the enclosure. The devices communicate with each other using IEEE 802.11 wireless LAN or...

    Provided By University of Maryland

  • White Papers // Mar 2010

    Maranello: Practical Partial Packet Recovery for 802.11

    Partial packet recovery protocols attempt to repair corrupted packets instead of retransmitting them in their entirety. Recent approaches have used physical layer confidence estimates or additional error detection codes embedded in each transmission to identify corrupt bits, or have applied forward error correction to repair without such explicit knowledge. In...

    Provided By University of Maryland

  • White Papers // Jun 2010

    Using Virtualization and Live Migration in a Scalable Mobile Wireless Testbed

    Laboratory-based mobile wireless testbeds such as MeshTest and the CMU Wireless Emulator are powerful platforms that allow users to perform controlled, repeatable, mobile wireless experiments in the lab. Unfortunately such systems can only accommodate 10-20 nodes in an experiment. The authors have designed and built a prototype of a system...

    Provided By University of Maryland

  • White Papers // May 2009

    Cloud-Based Decision Support Systems and Availability Context: The Probability of Successful Decision Outcomes

    In an age of cloud computing, mobile users, and wireless networks, the availability of decision support related computing resources can no longer guarantee five-nines (99.999%) availability but the dependence on decision support systems is ever increasing. If not already, the likelihood of obtaining accurate deterministic advice from these systems will...

    Provided By University of Maryland

  • White Papers // Jan 2010

    Crafting Integrated Multichannel Retailing Strategies

    Multichannel retailing is the set of activities involved in selling merchandise or services to consumers through more than one channel. Multichannel retailers dominate today's retail landscape. While there are many benefits of operating multiple channels, these retailers also face many challenges. In this paper, they discuss the key issues concerning...

    Provided By University of Maryland

  • White Papers // Jan 2011

    Finding and Removing Performance Bottlenecks in Large Systems

    Software systems obey the 80/20 rule: aggressively optimizing a vital few execution paths yields large speedups. However, finding the vital few paths can be difficult, especially for large systems like web applications. This paper describes a novel approach to finding bottlenecks in such systems, given (Possibly very large) pro les...

    Provided By University of Maryland

  • White Papers // Sep 2010

    Sub-Saharan Growth Surprises: Geography, Institutions And History in an all African Data Panel

    The authors use two types of cross-country growth regression models to revisit explanations of slow growth in Africa looking at growth rate variation among African countries only. Both sets of models produce results that are surprising given conclusions based on global sample: within Africa, they find greater coastal population negatively...

    Provided By University of Maryland

  • White Papers // Sep 2010

    Integrating DFM With CAD Through Design Critiquing

    The increasing focus on Design For Manufacturability (DFM) in research in concurrent engineering and engineering design is expanding the scope of traditional design activities in order to identify and eliminate manufacturing problems during the design stage. Manufacturing a product generally involvesmany different kinds of manufacturing activities, each having different characteristics....

    Provided By University of Maryland

  • White Papers // Dec 2009

    Network Connectivity and Related Optimization Problems on Random Graphs

    Network connectivity and propagation problems arise naturally in many social networks. The authors examine problems where some property, such as an infection or influence, starts from some initially seeded set of nodes and every affected node transmits the property to its neighbors with a probability determined by the connecting edge....

    Provided By University of Maryland

  • White Papers // Aug 2009

    Passive Aggressive Measurement With MGRP

    The authors present the Measurement Manager Protocol (MGRP), an in-kernel service that schedules and transmits probes on behalf of active measurement tools. Unlike prior measurement services, MGRP transparently piggybacks application packets inside the often significant amounts of empty padding contained in typical probes. Using MGRP thus combines the modularity, flexibility,...

    Provided By University of Maryland

  • White Papers // Jan 2011

    Punishment in Selfish Wireless Networks: A Game Theoretic Analysis

    In currently deployed wireless networks, rational participants have no incentive to cooperatively forward traffic for others. Though much work has focused on providing such incentives, few have done so with adequate focus on the ease of deployment; often, these systems require trusted third parties or tamper-proof hardware. In this paper,...

    Provided By University of Maryland

  • White Papers // Oct 2009

    Stay or Go? Participation in Under-Provisioned Video Streams

    The authors consider the problem of choosing whether or not to participate in a video streaming session under the condition that there is insufficient upload capacity to serve all peers. This paper explores the connections between this problem and that of market entry. The fundamental difference arises from a lack...

    Provided By University of Maryland

  • White Papers // Aug 2009

    Authenticated Broadcast With a Partially Compromised Public-Key Infrastructure

    Given a Public-Key Infrastructure (PKI) and digital signatures, it is possible to construct broadcast protocols tolerating any number of corrupted parties. Almost all existing protocols, however, do not distinguish between corrupted parties (Who do not follow the protocol), and honest parties whose secret (Signing) keys have been compromised (But who...

    Provided By University of Maryland

  • White Papers // Aug 2010

    Enforcing Secure and Robust Routing With Declarative Policies

    Internet routers must adhere to many polices governing the selection of paths that meet potentially complex constraints on length, security, symmetry and organizational preferences. Many routing problems are caused by their misconfiguration, usually due to a combination of human errors and the lack of a high-level formal language for specifying...

    Provided By University of Maryland

  • White Papers // Mar 2010

    Coping With Node Misbehaviors in Ad Hoc Networks: A Multi-Dimensional Trust Management Approach

    Nodes in Mobile Ad hoc NETworks (MANETs) are required to relay data packets to enable communication between other nodes that are not in radio range with each other. However, whether for selfish or malicious reasons, a node may fail to cooperate during the network operations or even attempt to disturb...

    Provided By University of Maryland

  • White Papers // Oct 2010

    Correcting Routing Failures Using Declarative Policies and Argumentation

    Many Internet failures are caused by misconfigurations of the BGP routers that manage routing of traffic between domains. The problems are usually due to a combination of human errors and the lack of a high-level language for specifying routing policies that can be used to generate router configurations. This paper...

    Provided By University of Maryland

  • White Papers // Aug 2009

    Policy-Based Malicious Peer Detection in Ad Hoc Networks

    Mobile Ad hoc NETworks (MANETs) are susceptible to various node misbehaviors due to their unique features, such as highly dynamic network topology, rigorous power constraints and error-prone transmission media. Significant research efforts have been made to address the problem of misbehavior detection. However, little research work has been done to...

    Provided By University of Maryland

  • White Papers // Jan 2011

    Ontology-Driven Adaptive Sensor Networks

    A wireless sensor network deployed in an area of interest is affected by variations in environmental conditions associated with that area. It must adapt to these variations in order to continue functioning as desired by the user. The authors present a novel, two-phase solution to the wireless sensor network adaptivity...

    Provided By University of Maryland

  • White Papers // Aug 2010

    Locksmith: Practical Static Race Detection for C

    Locksmith is a static analysis tool for automatically detecting data races in C programs. In this paper, the authors describe each of Locksmith's component analyses precisely, and present systematic measurements that isolate interesting tradeoffs between precision and efficiency in each analysis. Using a benchmark suite comprising standalone applications and Linux...

    Provided By University of Maryland

  • White Papers // Jul 2010

    Dynamic Inference of Static Types for Ruby

    There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In authors' experience, however, such type inference systems are extremely difficult to develop, because dynamic languages are typically complex, poorly specified, and include features, such as eval and reflection, that...

    Provided By University of Maryland

  • White Papers // Jan 2011

    Position Paper: Dynamically Inferred Types for Dynamic Languages

    Over the past few years the authors have been developing Diamondback Ruby (DRuby), a tool that brings static type inference to Ruby, a dynamically typed, object-oriented language. Developing DRuby required creating a Ruby front-end, which was extremely challenging: like other dynamic languages, Ruby has a complex, yet poorly documented syntax...

    Provided By University of Maryland

  • White Papers // Jan 2011

    Retrofitting Security in COTS Software With Binary Rewriting

    The authors present a practical tool for inserting security features against low-level software attacks into third-party, proprietary or otherwise binary-only software. They are motivated by the inability of software users to select and use low-overhead protection schemes when source code is unavailable to them, by the lack of information as...

    Provided By University of Maryland

  • White Papers // Jan 2011

    A Game Theoretic Approach Toward Multi-Party Privacy-Preserving Distributed Data Mining

    Analysis of privacy-sensitive data in a multi-party environment often assumes that the parties are well-behaved and they abide by the protocols. Parties compute whatever is needed, communicate correctly following the rules, and do not collude with other parties for exposing third party sensitive data. This paper argues that most of...

    Provided By University of Maryland

  • White Papers // Jan 2011

    On the Privacy Preserving Properties of Random Data Perturbation Techniques

    Privacy is becoming an increasingly important issue in many data mining applications. This has triggered the development of many privacy-preserving data mining techniques. A large fraction of them use randomized data distortion techniques to mask the data for preserving the privacy of sensitive data. This methodology attempts to hide the...

    Provided By University of Maryland

  • White Papers // Jan 2011

    Security for Sensor Networks

    Sensor networks have been identified as being useful in a variety of domains to include the battlefield and perimeter defense. The authors motivate the security problems that sensor networks face by developing a scenario representative of a large application class where these networks would be used in the future. This...

    Provided By University of Maryland

  • White Papers // Jan 2010

    State-Dependent Risk Preferences in Evolutionary Games

    There is much empirical evidence that human decision-making under risk does not correspond the decision-theoretic notion of "Rational" decision making, namely to make choices that maximize the expected value. An open question is how such behavior could have arisen evolutionarily. The authors believe that the answer to this question lies,...

    Provided By University of Maryland

  • White Papers // Aug 2010

    Sticky Wages, Incomplete Pass-Through And Inflation Targeting: What Is The Right Index To Target?

    This paper studies monetary policy rules in a small open economy with Inflation Targeting, incomplete pass-through and rigid nominal wages. The paper shows that, when nominal wages are fully flexible and pass-through is low to moderate, the monetary authority should target the Consumer Price Index (CPI) rather than the Domestic...

    Provided By University of Maryland

  • White Papers // Jul 2009

    A Policy and Trust Driven Framework for Securing Cyber Physical Systems

    Cyber Physical Systems play a crucial role in national infrastructure and securing them is of vital importance to national security. There has been ample evidence in the recent past exposing the vulnerabilities of these systems, and this has even been reported in the popular media. Further, CPS have been evolving...

    Provided By University of Maryland

  • White Papers // Nov 2010

    VMCrypt - Modular Software Architecture for Scalable Secure Computation

    Garbled circuits play a key role in secure computation. Unlike previous work, which focused mainly on efficiency and automation aspects of secure computation, in this paper the authors focus on software modularity and scalability, considering very large circuits. The main contribution is a virtual machine that dynamically loads hardware descriptions...

    Provided By University of Maryland

  • White Papers // Nov 2009

    Secure Network Coding Over the Integers

    Network coding has received significant attention in the networking community for its potential to increase throughput and improve robustness without any centralized control. Unfortunately, network coding is highly susceptible to "Pollution attacks" in which malicious nodes modify packets in a way that prevents the reconstruction of information at recipients; such...

    Provided By University of Maryland

  • White Papers // Apr 2011

    Neural Network to Identify Individuals at Health Risk

    The risk of diseases such as heart attack and high blood pressure could be reduced by adequate physical activity. However, even though majority of general population claims to perform some physical exercise, only a minority exercises enough to keep a healthy living style. Thus, physical inactivity has become one of...

    Provided By University of Maryland

  • White Papers // Jun 2010

    A New Framework for Password-Based Authenticated Key Exchange

    Protocols for Password-based Authenticated Key Exchange (PAKE) allow two users who share only a short, low-entropy password to agree on a cryptographically strong session key. The challenge in designing such protocols is that they must be immune to off-line dictionary attacks in which an eavesdropping adversary exhaustively enumerates the dictionary...

    Provided By University of Maryland

  • White Papers // Dec 2009

    Choosing a Network Management Solution for a Converged Internet Protocol Network

    The coming of age of IP convergence has streamlined to delivery of voice, video, and data. Midsized companies and governmental organizations are collapsing their disparate networks into one, allowing the similar consolidation of network management functions. This research paper seeks to educate the reader on the factors that must be...

    Provided By University of Maryland

  • White Papers // Jun 2010

    One-Round Password-Based Authenticated Key Exchange

    The authors show a general framework for constructing password-based authenticated key exchange protocols with optimal round complexity - one message per party, sent simultaneously - in the standard model, assuming the existence of a common reference string. When the framework is instantiated using bilinear-map cryptosystems, the resulting protocol is also...

    Provided By University of Maryland

  • White Papers // Feb 2011

    Managing the Quality of Virtualized Services

    Managing the quality of virtualized services that are delivered on the cloud is very challenging. Such services are often composed of smaller components that are assembled on an as-needed basis. In this paper, the authors propose a framework to measure and semi-automatically track quality delivered by a Virtualized service delivery...

    Provided By University of Maryland

  • White Papers // Oct 2010

    Using Linked Data to Interpret Tables

    Vast amounts of information are available in structured forms like spreadsheets, database relations, and tables found in documents and on the Web. The Authors describe an approach that uses linked data to interpret such tables and associate their components with nodes in a reference linked data collection. The proposed framework...

    Provided By University of Maryland

  • White Papers // Sep 2010

    T2LD: Interpreting and Representing Tables as Linked Data

    A vast amount of information is available in structured forms like spreadsheets, database relations, and tables in documents found on the Web. The authors describe a framework for interpreting such tables and extracting entities and relations from them. The results can be used to annotate the table or to contribute...

    Provided By University of Maryland

  • White Papers // Apr 2010

    Exploiting a Web of Semantic Data for Interpreting Tables

    Much of the world's knowledge is contained in structured documents like spreadsheets, database relations and tables in documents found on the Web and in print. The information in these tables might be much more valuable if it could be appropriately exported or encoded in RDF, making it easier to share,...

    Provided By University of Maryland