University of Waterloo

Displaying 41-80 of 162 results

  • White Papers // Aug 2011

    Specifying Overlaps of Heterogeneous Models for Global Consistency Checking

    Software development often involves a set of models defined in different metamodels, each model capturing a specific view of the system. The authors call this set a multimodel, and its elements partial or local models. Since partial models overlap, they may be consistent or inconsistent wrt. a set of global...

    Provided By University of Waterloo

  • White Papers // Aug 2011

    On Verifying Dynamic Multiple Data Copies Over Cloud Servers

    Currently, many individuals and organizations outsource their data to remote Cloud Service Providers (CSPs) seeking to reduce the maintenance cost and the burden of large local data storage. The CSP offers paid storage space on its infrastructure to store customers' data. Replicating data on multiple servers across multiple data centers...

    Provided By University of Waterloo

  • White Papers // Aug 2011

    SMURFEN: A System Framework for Rule Sharing Collaborative Intrusion Detection

    Intrusion Detection Systems (IDSs) are designed to monitor network traffic and computer activities in order to alert users about suspicious intrusions. Collaboration among IDSs allows users to benefit from the collective knowledge and information from their collaborators and achieve more accurate intrusion detection. However, most existing collaborative intrusion detection networks...

    Provided By University of Waterloo

  • White Papers // Aug 2011

    Privacy: Gone With the Typing! Identifying Web Users by Their Typing Patterns

    The lack of privacy protection for Internet users has been identified as a major problem in modern web browsers. Despite potentially high risk of identification by typing patterns, this topic has received little attention in both the research and general community. In this paper, the authors present a simple but...

    Provided By University of Waterloo

  • White Papers // Jul 2011

    An Efficient and Secure User Revocation Scheme in Mobile Social Networks

    Mobile Social Network (MSN) is a promising networking and communication platform for users having similar interests (or attributes) to connect and interact with one another. For many recently introduced secure MSN data communication schemes, attribute-based encryption is often adopted to preserve user privacy. These schemes are mainly to prevent outside...

    Provided By University of Waterloo

  • White Papers // Jul 2011

    From State-To Delta-Based Bidirectional Model Transformations: The Symmetric Case

    A bidirectional transformation (BX) keeps a pair of interrelated models synchronized. Symmetric BXs are those for which neither model in the pair fully determines the other. The authors build two algebraic frameworks for symmetric BXs, with one correctly implementing the other, and both being delta-based generalizations of known state-based frameworks....

    Provided By University of Waterloo

  • White Papers // Jun 2011

    A Light-weight Message Authentication Scheme for Smart Grid Communications

    Smart Grid (SG) communication has recently received significant attentions to facilitate intelligent and distributed electric power transmission systems. However, communication trust and security issues still present practical concerns to the deployment of SG. In this paper, to cope with these challenging concerns, the authors propose light-weight message authentication scheme features...

    Provided By University of Waterloo

  • White Papers // Jun 2011

    Grammar Inference for Web Documents

    Presentational XML documents, such as XHTML or Presentation MathML, use XML tags mainly for formatting purposes, while descriptive XML applications, such as a well-structured movie database, use tags to structure data items in a semantically meaningful way. There is little semantic connection between tags in a presentational XML document and...

    Provided By University of Waterloo

  • White Papers // Jun 2011

    BUPLE: Securing Passive RFID Communication Through Physical Layer Enhancements

    Although RFID systems offer many noteworthy characteristics, security and privacy issues associated with them are not easy to address. In this paper, the authors investigate how to solve the eavesdrop-ping, modification and one particular type of relay attacks toward the tag-to-reader communication in passive RFID systems without requiring lightweight ciphers...

    Provided By University of Waterloo

  • White Papers // May 2011

    Comments on a Sensor Network Key Redistribution Technique of Cichon, Golebiewski and Kutylowski

    Cichon, Golebiewski and Kutylowski proposed a technique for "Key redistribution" in sensor networks. The idea is that long-term keys held by the sensor nodes are used to encrypt temporal keys that a base station then broadcasts to the network. The temporal keys are used as session keys by the nodes...

    Provided By University of Waterloo

  • White Papers // May 2011

    Throughput Optimization in Multi-Hop Wireless Networks With Random Access

    This paper investigates cross-layer design in multi-hop wireless networks with random access. Due to the complexity of the problem, the authors study cross-layer design with a simple slotted ALOHA Medium Access Control (MAC) protocol without considering any network dynamics. Firstly, they study the optimal joint configuration of routing and MAC...

    Provided By University of Waterloo

  • White Papers // May 2011

    Cooperative Data Dissemination Via Roadside WLANs

    Data dissemination services embrace a wide variety of telematic applications where data packets are generated at a remote server in the Internet and destined to a group of nomadic users such as vehicle passengers and pedestrians. The quality of a data dissemination service is highly dependent on the availability of...

    Provided By University of Waterloo

  • White Papers // May 2011

    TMAC: Timestamp-Ordered MAC for CSMA/CA Wireless Mesh Networks

    The authors propose TMAC, a timestamp-ordered MAC protocol for Wireless Mesh Networks (WMNs). TMAC extends CSMA/CA by scheduling data packets based on their age. Prior to transmitting a data packet, a transmitter broadcasts a request control message appended with a timestamp to a selected list of neighbors. It can proceed...

    Provided By University of Waterloo

  • White Papers // May 2011

    Anonymity and One-Way Authentication in Key Exchange Protocols

    Key establishment is a crucial cryptographic primitive for building secure communication channels between two parties in a network. It has been studied extensively in theory and widely deployed in practice. In the research literature a typical protocol in the public-key setting aims for key secrecy and mutual authentication. However, there...

    Provided By University of Waterloo

  • White Papers // May 2011

    Enabling Network Convergence Through Contextual Session Mobility With IMS

    To fully benefit from the all IP convergence, it should be possible for a user not only to access services ubiquitously and at any time, but also to automatically and seamlessly transfer ongoing communication between different devices. This paper investigates the problem space of supporting Session Mobility (SM) with IMS...

    Provided By University of Waterloo

  • White Papers // Apr 2011

    Paging for Multicore Processors

    Paging for multicore processors extends the classical paging problem to a setting in which several processes simultaneously share the cache. Recently, Hassidim studied cache eviction policies for multicores under the traditional competitive analysis metric, showing that LRU is not competitive against an offline policy that has the power of arbitrarily...

    Provided By University of Waterloo

  • White Papers // Apr 2011

    Improving The Design Of Financial Products In A Multidimensional Black-Scholes Market

    Using various techniques, authors have shown that in one-dimensional markets, complex (path-dependent) contracts are generally not optimal for rational consumers. In this paper the authors generalize these results to a multidimensional Black-Scholes market. In such a market, they discuss optimal contracts for investors who prefer more to less and have...

    Provided By University of Waterloo

  • White Papers // Apr 2011

    Overcoming Adversaries in Sensor Networks: A Survey of Theoretical Models and Algorithmic Approaches for Tolerating Malicious Interference

    Interference is an unavoidable property of the wireless communication medium and, in sensor networks, such interference is exacerbated due to the energy-starved nature of the network devices themselves. In the presence of antagonistic interference, reliable communication in sensor networks becomes an extremely challenging problem that, in recent years, has attracted...

    Provided By University of Waterloo

  • White Papers // Apr 2011

    Selections: Internet Voting with Over-the-Shoulder Coercion-Resistance

    The authors present Selections, a new cryptographic voting protocol that is end-to-end verifiable and suitable for Internet voting. After a one-time in-person registration, voters can cast ballots in an arbitrary number of elections. They say a system provides over-the-shoulder coercion-resistance if a voter can undetectably avoid complying with an adversary...

    Provided By University of Waterloo

  • White Papers // Mar 2011

    Monitoring Burst (M-Burst)- A Novel Framework of Failure Localization in All-Optical Mesh Networks

    Achieving instantaneous and precise failure localization in all-optical Wavelength Division Multiplexing (WDM) networks has been an attractive feature of network fault management systems, and is particularly important when failure-dependent protection is employed. The paper introduces a novel framework of real-time failure localization in all-optical WDM mesh networks, called monitoring-burst (m-burst),...

    Provided By University of Waterloo

  • White Papers // Mar 2011

    Collaborative Intrusion Detection Networks and Insider Attacks

    Cyber intrusion is becoming an increasingly global and urgent problem. Intrusion Detection Systems (IDSs) are deployed to identify intrusions and mitigate their damage. A stand alone IDS does not have complete information or knowledge to detect intrusions. A Collaborative Intrusion Detection Network (CIDN) consists in a set of cooperating IDSs...

    Provided By University of Waterloo

  • White Papers // Mar 2011

    SMURFEN: A Knowledge Sharing Intrusion Detection Network

    The problem of Internet intrusions has become a world-wide security concern. To protect computer users from malicious attacks, Intrusion Detection Systems (IDSs) are designed to monitor network traffic and computer activities in order to alert users about suspicious intrusions. Collaboration among IDSs allows users to benefit from the collective knowledge...

    Provided By University of Waterloo

  • White Papers // Mar 2011

    Unconditionally Secure Signature Schemes Revisited

    Unconditionally Secure Signature (USS) schemes provide the ability to electronically sign documents without the reliance on computational assumptions needed in traditional digital signatures. Unlike digital signatures, USS schemes require both different signing and different verification algorithms for each user in the system. Thus, any viable security definition for a USS...

    Provided By University of Waterloo

  • White Papers // Mar 2011

    Combining Multiple Dimensions of Knowledge in API Migration

    The authors combine multiple dimensions of knowledge about APIs so that they can support API migration by wrapping or transformation in new ways. That is, they assess wrapper-based API re-implementations and provide guidance for migrating API methods. They demonstrate their approach with two major GUI APIs for the Java platform...

    Provided By University of Waterloo

  • White Papers // Feb 2011

    Dynamic Resource Allocation for Spot Markets in Clouds

    Cloud computing promises on-demand provisioning of resource to applications and services. To deal with dynamically fluctuating resource demands, market-driven resource allocation has been proposed and recently implemented by commercial cloud providers like Amazon EC2. In this environment, cloud resources are offered in distinct types of Virtual Machines (VMs) and the...

    Provided By University of Waterloo

  • White Papers // Feb 2011

    D-MG Tradeoff of DF and AF Relaying Protocols Over Asynchronous PAM Cooperative Networks

    The diversity multiplexing tradeoff of a general two-hop asynchronous cooperative network is examined for various relaying protocols such as Non-orthogonal Selection Decode-and-Forward (NSDF), Orthogonal Selection Decode-and-Forward (OSDF), Non-orthogonal Amplify-and-Forward (NAF), and Orthogonal Amplify-and-Forward (OAF). The transmitter nodes are assumed to send Pulse Amplitude Modulation (PAM) signals asynchronously, in which information...

    Provided By University of Waterloo

  • White Papers // Feb 2011

    Side Channel Monitoring: Packet Drop Attack Detection in Wireless Ad Hoc Networks

    Wireless ad hoc networks have great potentials in a broad range of applications. Their inherent vulnerability to various network attacks however limits their wide adaptation and deployment in practice. In this paper, the authors address one of the most dangerous attacks, packet drop attack, in wireless ad hoc networks by...

    Provided By University of Waterloo

  • White Papers // Feb 2011

    Fine-Grained Identification With Real-Time Fairness in Mobile Social Networks

    Mutual user identification is a necessary step for establishing trust among users in an unattended Mobile Social Network (MSN). Directly revealing identity information to others who are unknown to the users may result in an unfair situation regarding identity when other parties of the identification process misbehave. Using an on-line...

    Provided By University of Waterloo

  • White Papers // Jan 2011

    Optimal Scheduling for Roadside WLANs With Pre-Downloaded Messages

    In this paper, data dissemination services are discussed in the context of Vehicular Ad hoc NETworks (VANETs). In order to improve the efficiency of data dissemination, messages are network coded and pre-downloaded to the local nodes within the RoadSide WLANs (RS-WLANs) and then scheduled for transmission when a vehicle goes...

    Provided By University of Waterloo

  • White Papers // Jan 2011

    Link Scheduling in Wireless Networks With Successive Interference Cancellation

    Successive Interference Cancellation (SIC) is an effective way of Multi-Packet Reception (MPR) to combat interference at the physical layer. To understand the potential MPR advantages, the authors study link scheduling in an ad hoc network with SIC at the physical layer. The fact that the links detected sequentially by SIC...

    Provided By University of Waterloo

  • White Papers // Jan 2011

    Universal Top K Keyword Search Over Relational Databases

    Keyword search is one of the most effective paradigms for information discovery. One of the key advantages of keyword search querying is its simplicity. There is an increasing need for allowing ordinary users to issue keyword queries without any knowledge of the database schema. The retrieval unit of keyword search...

    Provided By University of Waterloo

  • White Papers // Jan 2011

    Forward Focus: Medium Access Control for Ad Hoc Networks

    The wireless medium must be effectively shared in an ad hoc network. The multihop nature of the network demands it, with packets often requiring several transmissions in order to reach their destination. This paper describes a mechanism for improving the IEEE 802.11 MAC specifically for ad hoc networks. The Forward...

    Provided By University of Waterloo

  • White Papers // Jan 2011

    Optimal Speedup on a Low-Degree Multi-Core Parallel Architecture (LoPRAM)

    Modern microprocessor architectures have gradually incorporated support for parallelism. In the past the degree of parallelism was rather small and as such it could be best modeled as a constant speedup over the traditional RAM model, however, as a consequence of continued growth this assumption might no longer hold. For...

    Provided By University of Waterloo

  • White Papers // Jan 2011

    Throughput Optimization for Hierarchical Cooperation in Ad Hoc Networks

    Wireless networks formed by radio nodes is a subject of much topical interest, and they are found in various applications such as ad hoc networks, mesh networks, sensor networks, etc. For the optimal design and operation of such networks, it is of fundamental importance to determine the information-theoretic capacity of...

    Provided By University of Waterloo

  • White Papers // Dec 2010

    A Scalable and Effective Trust-Based Framework for Vehicular Ad-Hoc Networks

    In this paper, the authors present a trust-based framework for message propagation and evaluation in vehicular ad-hoc networks where peers share information regarding road condition or safety and others provide opinions about whether the information can be trusted. More specifically, their trust-based message propagation model collects and propagates peers' opinions...

    Provided By University of Waterloo

  • White Papers // Dec 2010

    A Practical Platform for Cube-Attack-Like Cryptanalyses

    Cube Attack was announced by Dinur and Shamir in 2008, and published at Eurocrypt'09. Cube Attack was first designed to search linear expressions of the secret keys in stream ciphers. In Cube Attack, a cipher can be treated as a black box and expressed in Boolean functions. By manipulating the...

    Provided By University of Waterloo

  • White Papers // Nov 2010

    Exact, Efficient and Information-Theoretically Secure Voting With an Arbitrary Number of Cheaters

    The authors present three voting protocols with unconditional privacy and correctness, without assuming any bound on the number of corrupt participants. All protocols have polynomial complexity and require private channels and a simultaneous broadcast channel. Unlike previously proposed protocols in this model, the protocols that they present deterministically output the...

    Provided By University of Waterloo

  • White Papers // Nov 2010

    Omnidirectional Relay in Wireless Networks

    For wireless networks with multiple sources, an omnidirectional relay scheme is developed, where each node can simultaneously relay different messages in different directions. This is accomplished by the decode-and-forward relay strategy, with each relay binning the multiple messages to be transmitted, in the same spirit of network coding. Specially for...

    Provided By University of Waterloo

  • White Papers // Oct 2010

    Improving the Dominating-Set Routing Over Delay-Tolerant Mobile Ad-Hoc Networks Via Estimating Node Intermeeting Times

    With limited coverage of wireless networks and frequent roaming of mobile users, providing a seamless communication service poses a technical challenge. In the authors' previous research, they presented a supernode system architecture that employs the Delay-Tolerant Network (DTN) concept to provide seamless communications for roaming users over interconnected heterogeneous wireless...

    Provided By University of Waterloo

  • White Papers // Sep 2010

    Investigation of Targeting-Assistance Techniques for Distant Pointing With Relative Ray Casting

    Pointing at displays from a distance is becoming a common scenario for controlling computers and entertainment systems. Several devices use direct-pointing methods, where the user points a hand-held device at targets on a screen, but these often suffer from accuracy problems. Many techniques have been explored for improving mouse-based pointing,...

    Provided By University of Waterloo

  • White Papers // Feb 2012

    Optimally Robust Private Information Retrieval

    The authors give a protocol for multi-server information-theoretic private information retrieval which achieves the theoretical limit for Byzantine robustness. That is, the protocol can allow a client to successfully complete queries and identify server misbehavior in the presence of the maximum possible number of malicious servers. They have implemented their...

    Provided By University of Waterloo

  • White Papers // Jan 2012

    PReFilter: An Efficient Privacy-Preserving Relay Filtering Scheme for Delay Tolerant Networks

    Without direct path, information delivery in sparse Delay Tolerant Networks (DTNs) typically relies on intermittent relays, making the transmission not only unreliable but also time consuming. To make the matter even worse, the source nodes may transmit some encrypted "Junk" information, similar as the spam emails in current mail systems,...

    Provided By University of Waterloo

  • White Papers // Feb 2012

    Enabling Pervasive Healthcare With Privacy Preservation in Smart Community

    Smart community is an emerging Internet of Things application. It supports a variety of high-value automated services such as pervasive healthcare through a multi-hop community network of smart homes in a local residential region. In this paper, the authors study privacy preserving data communication between patients and an online healthcare...

    Provided By University of Waterloo

  • White Papers // Jan 2012

    Exploiting Prediction to Enable Secure and Reliable Routing in Wireless Body Area Networks

    In this paper, the authors propose a distributed Prediction-based Secure and Reliable routing framework (PSR) for emerging Wireless Body Area Networks (WBANs). It can be integrated with a specific routing protocol to improve the latter's reliability and prevent data injection attacks during data communication. In PSR, using past link quality...

    Provided By University of Waterloo

  • White Papers // Jan 2012

    Cost-Effective Barrier Coverage by Mobile Sensor Networks

    Barrier coverage problem in emerging mobile sensor networks has been an interesting research issue. Existing solutions to this problem aim to decide one-time movement for individual sensors to construct as many barriers as possible, which may not work well when there are no sufficient sensors to form a single barrier....

    Provided By University of Waterloo

  • White Papers // Jul 2011

    An Efficient and Secure User Revocation Scheme in Mobile Social Networks

    Mobile Social Network (MSN) is a promising networking and communication platform for users having similar interests (or attributes) to connect and interact with one another. For many recently introduced secure MSN data communication schemes, attribute-based encryption is often adopted to preserve user privacy. These schemes are mainly to prevent outside...

    Provided By University of Waterloo

  • White Papers // Feb 2009

    A New Achievable Rate for the Gaussian Parallel Relay Channel

    Schein and Gallager introduced the Gaussian parallel relay channel in 2000. They proposed the Amplify-and-Forward (AF) and the Decode-and-Forward (DF) strategies for this channel. For a long time, the best known achievable rate for this channel was based on the AF and DF with time sharing (AF-DF). Recently, a Rematch-and-Forward...

    Provided By University of Waterloo

  • White Papers // Oct 2008

    Cooperative Strategies for the Half-Duplex Gaussian Parallel Relay Channel: Simultaneous Relaying Versus Successive Relaying

    This paper investigates the problem of communication for a network composed of two half-duplex parallel relays with additive white Gaussian noise. Two protocols, i.e., Simultaneous and Successive relaying, associated with two possible relay orderings are proposed. The simultaneous relaying protocol is based on Dynamic Decode and Forward (DDF) scheme. For...

    Provided By University of Waterloo

  • White Papers // Nov 2008

    On the Optimal Design of Wireless Relay Networks

    It is known that the achievable data rate per user can be increased when relays are deployed in wireless networks. However, the drawback of this solution is that some of the network resources should be allocated to the relays. In this paper, the authors consider a two-tier network where all...

    Provided By University of Waterloo

  • White Papers // Jan 2012

    On the Limitations of the Naive Lattice Decoding

    In this paper, the inherent drawbacks of the naive lattice decoding for MIMO fading systems is investigated. The authors show that using the naive lattice decoding for MIMO systems has considerable deficiencies in terms of the rate-diversity trade-off. Unlike the case of maximum-likelihood decoding, in this case, even the perfect...

    Provided By University of Waterloo

  • White Papers // Dec 2009

    Using Sphinx to Improve Onion Routing Circuit Construction

    This paper presents compact message formats for onion routing circuit construction using the Sphinx methodology developed for mixes. The authors significantly compress the circuit construction messages for three onion routing protocols that have emerged as enhancements to the Tor anonymizing network; namely, Tor with predistributed Diffie-Hellman values, pairing-based onion routing,...

    Provided By University of Waterloo

  • White Papers // Jun 2010

    Analysis of Efficient Techniques for Fast Elliptic Curve Cryptography on x86-64 Based Processors

    Elliptic Curve Cryptography (ECC), discovered independently by Miller and Koblitz in mid 80's, has gained widespread acceptance in recent years, taking over a central role in public-key cryptography that was previously exclusive to the classic RSA. This technological shift is partially explained by ECC's reduced key length requirement to achieve...

    Provided By University of Waterloo

  • White Papers // Jun 2009

    Going Mini: Extreme Lightweight Spam Filters

    In this paper, the authors set out to determine if effective mini-filters could be trained for email spam filtering, using a drastically reduced feature set. The experimental results presented suggest that several methods, including boosting with early stopping, greedy decision lists, and TWFS methods all give effective, low-cost solutions to...

    Provided By University of Waterloo

  • White Papers // Oct 2009

    The Secrecy Capacity Region of the Gaussian MIMO Broadcast Channel

    In this paper, the authors consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers via a Gaussian MIMO broadcast channel. A wire-tapper also receives the transmitted signal via another MIMO channel. First they assumed that the channels are degraded and the wire-tapper...

    Provided By University of Waterloo

  • White Papers // May 2009

    A Thermodynamic Turing Machine: Artificial Molecular Computing Using Classical Reversible Logic Switching Networks

    A Thermodynamic Turing Machine (TTM) concept is introduced. A TTM is a classical computing paradigm where the natural laws of thermodynamics are exploited in the form of a discrete controlled and configurable classical Boltzmann gas to efficiently implement logical mathematical operations. In its most general form the machine consists of...

    Provided By University of Waterloo

  • White Papers // Apr 2009

    The Secrecy Capacity Region of the Degraded Vector Gaussian Broadcast Channel

    In this paper, the authors consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers via a Gaussian MIMO broadcast channel. A wire-tapper also receives the transmitted signal via another MIMO channel. It is assumed that the channels are degraded and the wire-tapper...

    Provided By University of Waterloo

  • White Papers // Nov 2010

    Omnidirectional Relay in Wireless Networks

    For wireless networks with multiple sources, an omnidirectional relay scheme is developed, where each node can simultaneously relay different messages in different directions. This is accomplished by the decode-and-forward relay strategy, with each relay binning the multiple messages to be transmitted, in the same spirit of network coding. Specially for...

    Provided By University of Waterloo

  • White Papers // Apr 2011

    Selections: Internet Voting with Over-the-Shoulder Coercion-Resistance

    The authors present Selections, a new cryptographic voting protocol that is end-to-end verifiable and suitable for Internet voting. After a one-time in-person registration, voters can cast ballots in an arbitrary number of elections. They say a system provides over-the-shoulder coercion-resistance if a voter can undetectably avoid complying with an adversary...

    Provided By University of Waterloo

  • White Papers // May 2009

    Multilevel Coding Over Two-Hop Single-User Networks

    In this paper, a two-hop network in which information is transmitted from a source via a relay to a destination is considered. It is assumed that the channels are static fading with additive white Gaussian noise. All nodes are equipped with a single antenna and the Channel State Information (CSI)...

    Provided By University of Waterloo

  • White Papers // Mar 2011

    Unconditionally Secure Signature Schemes Revisited

    Unconditionally Secure Signature (USS) schemes provide the ability to electronically sign documents without the reliance on computational assumptions needed in traditional digital signatures. Unlike digital signatures, USS schemes require both different signing and different verification algorithms for each user in the system. Thus, any viable security definition for a USS...

    Provided By University of Waterloo

  • White Papers // May 2010

    Efficient Techniques for High-Speed Elliptic Curve Cryptography

    In this paper, a thorough bottom-up optimization process (field, point and scalar arithmetic) is used to speed up the computation of elliptic curve point multiplication and report new speed records on modern x86-64 based processors. The different implementations include elliptic curves using Jacobian coordinates, extended Twisted Ed-wards coordinates and the...

    Provided By University of Waterloo

  • White Papers // Dec 2010

    A Practical Platform for Cube-Attack-Like Cryptanalyses

    Cube Attack was announced by Dinur and Shamir in 2008, and published at Eurocrypt'09. Cube Attack was first designed to search linear expressions of the secret keys in stream ciphers. In Cube Attack, a cipher can be treated as a black box and expressed in Boolean functions. By manipulating the...

    Provided By University of Waterloo

  • White Papers // Nov 2010

    Exact, Efficient and Information-Theoretically Secure Voting With an Arbitrary Number of Cheaters

    The authors present three voting protocols with unconditional privacy and correctness, without assuming any bound on the number of corrupt participants. All protocols have polynomial complexity and require private channels and a simultaneous broadcast channel. Unlike previously proposed protocols in this model, the protocols that they present deterministically output the...

    Provided By University of Waterloo

  • White Papers // Jul 2010

    Short One-Time Signatures

    The authors present a new one-time signature scheme having short signatures. The new scheme is also the first one-time signature scheme that supports aggregation, batch verification, and which admits efficient proofs of knowledge. It has a fast signing algorithm, requiring only modular additions, and its verification cost is comparable to...

    Provided By University of Waterloo

  • White Papers // Oct 2009

    Error Decodable Secret Sharing and One-Round Perfectly Secure Message Transmission for General Adversary Structures

    An error decodable secret-sharing scheme is a secret-sharing scheme with the additional property that the secret can be recovered from the set of all shares, even after a coalition of participants corrupts the shares they possess. In this paper the authors consider schemes that can tolerate corruption by sets of...

    Provided By University of Waterloo

  • White Papers // Jun 2010

    Asynchronous Distributed Private-Key Generators for Identity-Based Cryptography

    An Identity-Based Encryption (IBE) scheme can greatly reduce the complexity of sending encrypted messages over the Internet. However, an IBE scheme necessarily requires a Private-Key Generator (PKG), which can create private keys for clients, and so can passively eavesdrop on all encrypted communications. Although a distributed PKG has been suggested...

    Provided By University of Waterloo

  • White Papers // Aug 2009

    Three Improved Algorithms for Multi-Path Key Establishment in Sensor Networks Using Protocols for Secure Message Transmission

    In this paper, the authors propose a security model to capture active attacks against Multi-Path Key Establishment (MPKE) in sensor networks. The model strengthens previous models to capture more attacks and achieve essential security goals for multipath key establishment. In this model, they can apply protocols for perfectly secure message...

    Provided By University of Waterloo

  • White Papers // Jul 2010

    Dealer-Free Dynamic Secret Sharing Schemes With Unconditional Security

    This paper proposes dealer-free dynamic secret sharing constructions where different parameters of the scheme can be changed after the initialization. In practice, the ability of the adversary might be enhanced over time, for instance, by compromising more players. A possible solution to this problem is to increase the threshold and/or...

    Provided By University of Waterloo

  • White Papers // Jun 2009

    Detecting Patterns in Finite Regular and Context-Free Languages

    The computational complexity of pattern matching has received much attention in the literature. Although determining whether a given word appears inside another can be done in linear time, other pattern-matching problems appear to be computationally intractable. In a classic paper, Angluin showed the problem of determining if an arbitrary pattern...

    Provided By University of Waterloo

  • White Papers // Dec 2008

    Materialized View Selection in XML Databases

    Materialized views, a RDBMS silver bullet, demonstrate its efficacy in many applications, especially as a data warehousing/decision support system tool. The pivot of playing materialized views efficiently is view selection. Though studied for over thirty years in RDBMS, the selection is hard to make in the context of xml databases,...

    Provided By University of Waterloo

  • White Papers // Aug 2009

    Top-K Query Processing in Uncertain Databases

    Top-k processing in uncertain databases is semantically and computationally different from traditional top-k processing. The interplay between score and uncertainty information makes traditional top-k processing techniques inapplicable to uncertain databases. In this paper the authors introduce new probabilistic formulations for top-k queries. The formulations are based on marriage of traditional...

    Provided By University of Waterloo

  • White Papers // Jan 2011

    Optimal Speedup on a Low-Degree Multi-Core Parallel Architecture (LoPRAM)

    Modern microprocessor architectures have gradually incorporated support for parallelism. In the past the degree of parallelism was rather small and as such it could be best modeled as a constant speedup over the traditional RAM model, however, as a consequence of continued growth this assumption might no longer hold. For...

    Provided By University of Waterloo

  • White Papers // Sep 2008

    Robust and Scalable Trust Management for Collaborative Intrusion Detection

    The accuracy of detecting intrusions within an Intrusion Detection Network (IDN) depends on the efficiency of collaboration between the peer Intrusion Detection Systems (IDSes) as well as the security itself of the IDN against insider threats. In this paper, the authors study host-based IDNs and introduce a Dirichlet-based model to...

    Provided By University of Waterloo

  • White Papers // Sep 2008

    Distributed Quality-Lifetime Maximization in Wireless Video Sensor Networks

    Owing to the availability of low-cost and low-power CMOS cameras, Wireless Video Sensor Networks (WVSN) has recently become a reality. However video encoding is still a costly process for energy and capacity constrained sensor nodes and this urges the vitality of the control over the network lifetime. In this paper...

    Provided By University of Waterloo

  • White Papers // Sep 2008

    Evasive Attack on Stateful Signature-Based Network Intrusion Detection Systems

    Network Intrusion Detection Systems (NIDS) have a very important role in network security. Many NIDS evasion techniques as well as solutions were proposed in the literature. Supporting stateful signatures is a very critical function in a signature-based NIDS because many multi-stage attacks can only be detected by tracking multiple rules...

    Provided By University of Waterloo

  • White Papers // Nov 2009

    Mechanism Design for Network Virtualization

    Recently network virtualization has been proposed as a promising approach to thwart the current ossification of the Internet by allowing multiple heterogeneous Virtual Networks (VN) to coexist on a shared infrastructure which itself is controlled by self-interested infrastructure providers. A major challenge in this respect is the VN embedding problem...

    Provided By University of Waterloo

  • White Papers // Jun 2009

    A Survey of Incentive Mechanisms in Peer-to-Peer Systems

    The fundamental assumption that Peer-To-Peer (P2P) networks can thrive on voluntary contribution of altruistic peers can no longer be supported without considering the impact of rational behavior on such decentralized systems. This paper attempts to shed light on the impact of rational free-riding behavior of participating peers on the stability...

    Provided By University of Waterloo

  • White Papers // May 2009

    Taking Advantage of the Interplay Among Software Product Lines, Service-Oriented Architectures and Multi-Agent Systems

    Multi-Agent Systems (MASs) are often being applied in a wide range of industrial applications, showing the effectiveness of the agent abstraction to develop open, highly interactive, autonomous and context-aware systems. MASs have been combined with Service-Oriented Architectures (SOAs) in order to provide customization and flexibility in these systems. This combination...

    Provided By University of Waterloo

  • White Papers // Mar 2009

    Optimizing Distributed XML Queries Through Localization and Pruning

    Distributing data collections by fragmenting them is an effective way of improving the scalability of relational database systems. The unique characteristics of XML data present challenges that require different distribution techniques to achieve scalability. In this paper, the authors propose solutions to two of the problems encountered in distributed query...

    Provided By University of Waterloo

  • White Papers // Jan 2009

    WiFi Overcast: Enabling True Mobility for Realtime Applications in the Enterprise

    Enterprises are increasingly deploying Wireless LANs to provide mobile access to users in corporate offices. However, existing enterprise WLANs are far from being truly mobile. In particular, they do not adequately support continuous mobility, where users access the network on-the-go. Furthermore, WLANs that do provide continuous mobility support require client...

    Provided By University of Waterloo