University of Waterloo

Displaying 1-40 of 164 results

  • White Papers // Aug 2012

    A Framework for Ubiquitous IP Communications in Vehicle to Grid Networks

    The electrical grid is a critical infrastructure that is slowly moving towards a more reliable and efficient supply system: the Smart Grid. As part of this migration process, a new group of energy-aware and emission-free technologies are being developed. Electric vehicles are a promising technology that belongs to that group....

    Provided By University of Waterloo

  • White Papers // Aug 2012

    Decentralized Inverter Control in Microgrids Based on Power Sharing Information Through Wireless Communications

    For the future smart grid, decentralized inverter control is essential in Distributed Generation (DG) micro-grids where a powerful central controller is unavailable for cost and reliability concerns. However, decentralized inverter control suffers from limited system stability mainly because of the lack of communications among different inverters. In this paper, the...

    Provided By University of Waterloo

  • White Papers // Jun 2012

    Enable Pervasive Healthcare Through Continuous Remote Health Monitoring

    In this paper, the authors introduce a novel Remote Health Monitoring (RHM) system to enable high-quality pervasive healthcare services to users with low delivery delay and reduced costs. They define the RHM architecture and summarize the design considerations. They then present a promising commercialized solution, ViiCare, with system infrastructures and...

    Provided By University of Waterloo

  • White Papers // Apr 2012

    Implementing Pairings at the 192-Bit Security Level

    The authors implement asymmetric pairings derived from Kachisa-Schaefer-Scott (KSS), Barreto-Naehrig (BN), and Barreto-Lynn-Scott (BLS) elliptic curves at the 192-bit security level. Somewhat surprisingly, they find pairings derived from BLS curves with embedding degree 12 to be the fastest for their serial as well as their parallel implementations. The serial implementations...

    Provided By University of Waterloo

  • White Papers // Apr 2012

    FIFO Queueing Policies for Packets With Heterogeneous Processing

    The authors consider the problem of managing a bounded size First-In-First-Out (FIFO) queue buffer, where each incoming unit-sized packet requires several rounds of processing before it can be transmitted out. Their objective is to maximize the total number of successfully transmitted packets. They consider both push-out (when the policy is...

    Provided By University of Waterloo

  • White Papers // Mar 2012

    Cross-Band Interference Reduction Trade-Offs in SISO and MISO OFDM-Based Cognitive Radios

    Cognitive radio is a promising approach for efficient utilization of radio spectrum. Due to its high spectral efficiency and flexibility, OFDM is considered as a good signaling scheme for cognitive radios. In this paper, the authors investigate the problem of cross-band interference minimization in OFDM-based cognitive systems. Cross-band interference is...

    Provided By University of Waterloo

  • White Papers // Mar 2012

    Multiagent Coordination in Microgrids Via Wireless Networks

    The future smart grid is expected to be an integration of intelligent microgrids featured by localized electricity generation, storage, and consumption. Wireless communication is a promising means to facilitate pervasive microgrid monitoring and control at a high flexibility and low deployment cost. In order to avoid a single point of...

    Provided By University of Waterloo

  • White Papers // Mar 2012

    SUCCESS: A Secure User-Centric and Social-Aware Reputation Based Incentive Scheme for DTNs

    Delay/Disruption Tolerant Networks (DTNs) are self-organized wireless ad-hoc networks, where end-to-end connectivity can not be guaranteed and communications rely on the assumption that the nodes are willing to store-carry-and-forward bundles in an opportunistic way. However, this assumption would be easily violated due to the selfish nodes which are unwilling to...

    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 // Feb 2012

    Multidimensional Meet-in-the-Middle Attack and Its Applications to GOST, KTANTAN and Hummingbird-2

    This paper investigates a new approach to analyze symmetric ciphers by dividing the algorithms to consecutive sub-ciphers and then evaluating them separately. This attack is suitable for ciphers with simple key schedules and having block sizes smaller than key lengths. The authors have successfully applied this multidimensional approach to the...

    Provided By University of Waterloo

  • White Papers // Feb 2012

    A Secure Payment Scheme With Low Communication and Processing Overhead for Multihop Wireless Networks

    The authors propose RACE, a report-based payment scheme for multi-hop wireless networks to stimulate node cooperation, regulate packet transmission, and enforce fairness. The nodes submit lightweight payment reports (instead of receipts) to the Accounting Center (AC) and temporarily store undeniable security tokens called Evidences. The reports contain the alleged charges...

    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

    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 // 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

    Location Privacy Preservation in Collaborative Spectrum Sensing

    Collaborative spectrum sensing has been regarded as a promising approach to enable secondary users to detect primary users by exploiting spatial diversity. In this paper, the authors consider a converse question: could space diversity be exploited by a malicious entity, e.g., an external attacker or an untrusted Fusion Center (FC),...

    Provided By University of Waterloo

  • White Papers // Jan 2012

    Cooperative Cognitive Radio Networking Using Quadrature Signaling

    A quadrature signaling based two-phase cooperation framework for cooperative cognitive radio networking is proposed. By leveraging the degrees of freedom provided by orthogonal modulation, secondary users are able to relay the traffic of primary users and transmit their own in the same time slot without interference. To evaluate the cooperation...

    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 // Jan 2012

    Intermodeling, Queries, and Kleisli Categories

    Specification and maintenance of relationships between models are vital for MDE. The authors show that a wide class of such relationships can be specified in a compact and precise manner, if inter-model mappings are allowed to link derived model elements computed by corresponding queries. Composition of such mappings is not...

    Provided By University of Waterloo

  • White Papers // Jan 2012

    Spectral-Efficient Differential Space-Time Coding Using Non-Full-Diverse Constellations

    In this paper, a method is proposed to construct spectral-efficient unitary space-time codes for high-rate differential communications over multiple-antenna channels. Unlike most of the known methods which are designed to maximize the diversity product (the minimum determinant distance), the authors' objective is to increase the spectral efficiency. The simulation results...

    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 // Jan 2012

    Communication Over MIMO Broadcast Channels Using Lattice-Basis Reduction

    A new viewpoint for adopting the lattice reduction in communication over MIMO broadcast channels is introduced. Lattice basis reduction helps one to reduce the average transmitted energy by modifying the region which includes the constellation points. Also, the outage probability for both cases of fixed-rate users and fixed sum-rate is...

    Provided By University of Waterloo

  • White Papers // Jan 2012

    LLL Reduction Achieves the Receive Diversity in MIMO Decoding

    Diversity order is an important measure for the performance of communication systems over MIMO fading channels. In this paper, the authors prove that in MIMO multiple access systems (or MIMO point-to-point systems with V-BLAST transmission), lattice-reduction-aided decoding achieves the maximum receive diversity (which is equal to the number of receive...

    Provided By University of Waterloo

  • White Papers // Jan 2012

    Soft Reconstruction of Speech in the Presence of Noise and Packet Loss

    Exploiting the residual redundancy in a source coder output stream during the decoding process has been proven to be a bandwidth efficient way to combat the noisy channel degradations. In this paper, the authors consider soft reconstruction of speech spectrum, in GSM Adaptive Multi-Rate and IS-641 vocoders, transmitted over a...

    Provided By University of Waterloo

  • White Papers // Dec 2011

    CommitCoin: Carbon Dating Commitments With Bitcoin

    In the standard definition of a commitment scheme, the sender commits to a message and immediately sends the commitment to the recipient interested in it. However, the sender may not always know at the time of commitment who will become interested in verifying it. Further, when the interested party does...

    Provided By University of Waterloo

  • White Papers // Dec 2011

    Extended Combinatorial Constructions for Peer-to-Peer User-Private Information Retrieval

    The authors consider User-Private Information Retrieval (UPIR), an interesting alternative to Private Information Retrieval (PIR) introduced by Domingo-Ferrer et al.. In UPIR, the database knows which records have been retrieved, but does not know the identity of the person making the query. The goal of UPIR, then, is to disguise...

    Provided By University of Waterloo

  • White Papers // Dec 2011

    Efficient Algorithms to Solve a Class of Resource Allocation Problems in Large Wireless Networks

    The authors focus on efficient algorithms for resource allocation problems in large wireless networks. They first investigate the link scheduling problem and identify the properties that make it possible to compute solutions efficiently. They, then show that the node on-off scheduling problem shares these features and is amenable to the...

    Provided By University of Waterloo

  • White Papers // Dec 2011

    Throughput-Lifetime Tradeoffs in Multihop Wireless Networks Under a Realistic Interference Model

    Throughput and lifetime are both crucial design objectives for multi-hop wireless networks. In general, it is not sufficient to optimize either of them separately. As these two objectives are often conflicting with each other, the authors can only hope to identify the tradeoffs between them. This entails a harder problem...

    Provided By University of Waterloo

  • White Papers // Dec 2011

    TESP2: Timed Efficient Source Privacy Preservation Scheme for Wireless Sensor Networks

    Recent advances in micro electro mechanical systems and wireless communication have paved the way for the rapid deployment of wireless sensor networks, which have been well recognized as a ubiquitous and general approach for some emerging applications such as real-time traffic monitoring, ecosystem and battlefield surveillance. Typically, a wireless sensor...

    Provided By University of Waterloo

  • White Papers // Dec 2011

    Re-Encryption-Based Key Management Towards Secure and Scalable Mobile Applications in Clouds

    Cloud computing confers strong economic advantages, but many clients are reluctant to implicitly trust a third-party cloud provider. To address these security concerns, data may be transmitted and stored in encrypted form. Major challenges exist concerning the aspects of the generation, distribution, and usage of encryption keys in cloud systems,...

    Provided By University of Waterloo

  • White Papers // Dec 2011

    Faster Facility Location and Hierarchical Clustering

    The authors propose several methods to speed up the facility location, and the single link and the complete link clustering algorithms. The local search algorithm for the facility location is accelerated by introducing several space partitioning methods and a parallelisation on the CPU of a standard desktop computer. The influence...

    Provided By University of Waterloo

  • White Papers // Dec 2011

    Efficient On-Demand Data Service Delivery to High-Speed Trains in Cellular/Infostation Integrated Networks

    In this paper, the authors investigate on-demand data services for high-speed trains via a cellular/infostation integrated network. Service requests and acknowledgements are sent through the cellular network to a content server, while data delivery is achieved via trackside infostations. The optimal resource allocation problem is formulated by taking account of...

    Provided By University of Waterloo

  • White Papers // Dec 2011

    Multipath Transmission for Wireless Internet Access - From an End-to-End Transport Layer Perspective

    With the growing demand of Internet services, network operators have put significant efforts to improve network error resilience and efficiency. Since there exist different wired/wireless technologies for Internet access such as Digital Subscriber Line (DSL), Ethernet, and worldwide interoperability for microwave access (WiMax), a mobile host can use multiple access...

    Provided By University of Waterloo

  • White Papers // Nov 2011

    Network Cooperation for Energy Saving in Green Radio Communications

    Financial and environmental considerations have motivated a trend in wireless communication network design and operation to minimize the amount of energy consumption. Such a trend is referred to as green radio communications. In this paper, network cooperation is investigated as a means of energy saving. Networks with overlapped coverage can...

    Provided By University of Waterloo

  • White Papers // Nov 2011

    A Cloud-Based Scheme for Protecting Source-Location Privacy Against Hotspot-Locating Attack in Wireless Sensor Networks

    In wireless sensor networks, adversaries can make use of traffic information to locate the monitored objects, e.g., to hunt endangered animals or kill soldiers. In this paper, the authors first define a hotspot phenomenon that causes an obvious inconsistency in the network traffic pattern due to a large volume of...

    Provided By University of Waterloo

  • White Papers // Oct 2011

    Self Adaptive Contention Aware Routing Protocol for Intermittently Connected Mobile Networks

    This paper introduces a novel multi-copy routing protocol, called Self Adaptive Utility-based Routing Protocol (SAURP), for Delay Tolerant Networks (DTNs) that are possibly composed of a vast number of devices in miniature such as smart phones of heterogeneous capacities in terms of energy resources and buffer spaces. SAURP is characterized...

    Provided By University of Waterloo

  • White Papers // Oct 2011

    Network-Wide Local Unambiguous Failure Localization (NWL-UFL) Via Monitoring Trails

    Monitoring trail (m-trail) has been proposed as an effective approach for link failure localization in all-optical WDM (Wavelength Division Multiplexing) mesh networks. Previous studies in failure localization rely on alarm dissemination via control plane signaling such that the network controller can collect the flooded alarms to form an alarm code...

    Provided By University of Waterloo

  • White Papers // Oct 2011

    Generating Range Fixes for Software Configuration

    To prevent configuration errors, highly configurable software often allows defining constraints over the available options. As these constraints can be complex, fixing a configuration that violates one or more constraints can be challenging. Although several fix-generation approaches exist, their applicability is limited because they typically generate only one fix, failing...

    Provided By University of Waterloo

  • White Papers // Sep 2011

    Model Synchronization, Mappings, Tile Algebra, and Categories

    The paper presents a novel algebraic framework for specification and design of model synchronization tools. The basic premise is that synchronization procedures, and hence algebraic operations modeling them, are diagrammatic: they take a configuration (diagram) of models and mappings as their input and produce a diagram as the output. Many...

    Provided By University of Waterloo

  • White Papers // Sep 2011

    Characterizing Task Usage Shapes in Google~s Compute Clusters

    The increase in scale and complexity of large compute clusters motivates a need for representative workload bench-marks to evaluate the performance impact of system changes, so as to assist in designing better scheduling algorithms and in carrying out management activities. To achieve this goal, it is necessary to construct workload...

    Provided By University of Waterloo

  • White Papers // Sep 2011

    Resolving State Inconsistency in Distributed Fault-Tolerant Real-Time Dynamic TDMA Architectures

    State consistency in safety-critical distributed systems is mandatory for synchronizing distributed decisions as found in dynamic Time Division Multiple Access (TDMA) schedules in the presence of faults. A TDMA schedule that supports networked systems making decisions at run time is sensitive to transient faults, because stations can make incorrect local...

    Provided By University of Waterloo

  • White Papers // Dec 2011

    Faster Facility Location and Hierarchical Clustering

    The authors propose several methods to speed up the facility location, and the single link and the complete link clustering algorithms. The local search algorithm for the facility location is accelerated by introducing several space partitioning methods and a parallelisation on the CPU of a standard desktop computer. The influence...

    Provided By University of Waterloo

  • White Papers // Jul 2009

    Corporate Financial Strategy in SMEs

    Company strategy expresses a basic idea of how to reach company objectives. A whole range of models of strategic management are used in practice. The financial strategy plays an important role in corporate strategy. The paper develops a methodology of strategic model implementing into the category of micro, Small and...

    Provided By University of Waterloo

  • White Papers // Oct 2008

    Policy-Based Security Configuration Management Application to Intrusion Detection and Prevention

    Intrusion Detection and/or Prevention Systems (IDPS) represent an important line of defense against the variety of attacks that can compromise the security and well functioning of an enterprise information system. IDPSes can be network or host-based and can collaborate in order to provide better detections of malicious traffic. Although several...

    Provided By University of Waterloo

  • White Papers // Oct 2009

    Bluetooth-Enabled In-Home Patient Monitoring System: Early Detection of Alzheimer's Disease

    As the baby boom generation is aging, more and more people are diagnosed with Alzheimer's disease, early detection of which is shown to be vital and necessary for better medical treatments and prolonging life expectancies. This paper proposes a Bluetooth-enabled in-home patient monitoring system, facilitating early detection of Alzheimer's disease....

    Provided By University of Waterloo

  • White Papers // Apr 2009

    A Highly Scalable RFID Authentication Protocol

    In previous RFID protocols, a hash-chain is used to achieve good privacy. Each tag is associated with a chain of Q hash values. To identify one tag out of a total of N tags, a server searches a table of size NQ. A naive search takes either ?(NQ) time or...

    Provided By University of Waterloo

  • White Papers // Feb 2009

    How to Improve Security and Reduce Hardware Demands of the WIPR RFID Protocol

    This paper analyzes and improves WIPR, an RFID identification scheme based on public key techniques with efficient hardware implementation. First the paper analyzes the security and privacy features of WIPR. The paper shows that a reduced version of WIPR is vulnerable to short padding attacks and WIPR needs a random...

    Provided By University of Waterloo

  • White Papers // Apr 2009

    Design of a Simulation Framework to Evaluate Trust Models for Collaborative Intrusion Detection

    Different trust models have been developed for dealing with possible dishonest behavior and attacks from malicious peer Intrusion Detection Systems (IDSs) in a collaborative Intrusion Detection Network (IDN). For evaluating and comparing these models, this paper introduces a simulation framework that incorporates different components namely expertise model, deception model, attack...

    Provided By University of Waterloo

  • White Papers // Feb 2010

    Recommendations for Optical Disc Archival Storage

    For a multitude of reasons, printing to paper is still the best option for long term preservation of archival records. However, this is not possible for all records. Audiovisual recordings obviously need to remain in a machine-readable format that can be played using current technology. Many users of digital cameras...

    Provided By University of Waterloo

  • White Papers // Mar 2010

    iMark: An Identity Management Framework for Network Virtualization Environment

    Network virtualization has gained a lot of popularity in the recent years. It has been heralded as a flexible and open ended network for the future. Network Virtualizations allow the existence of multiple Virtual Networks (VNs). These VNs in turn can assume their own individual routing, addressing, naming and transport...

    Provided By University of Waterloo

  • White Papers // Nov 2008

    Multimedia Messaging Service: System Description and Performance Analysis

    Following the success of Short Messaging Service (SMS), multimedia messaging service (MMS) is emerging as a natural but revolutionary successor to short messaging. MMS allows personalized multimedia messages containing content such as images, audio, text and video to be created and transferred between MMS-capable phones and other devices. By using...

    Provided By University of Waterloo

  • White Papers // Jun 2010

    On Generalizations of Network Design Problems With Degree Bounds

    Iterative rounding and relaxation have arguably become the method of choice in dealing with unconstrained and constrained network design problems. This paper extends the scope of the iterative relaxation method in two directions: by handling more complex degree constraints in the minimum spanning tree problem namely laminar crossing spanning tree,...

    Provided By University of Waterloo

  • White Papers // Aug 2008

    Trace-Based Analysis of Wi-Fi Scanning Strategies

    Constant access to the Internet on smartphones enables a plethora of mobile applications. Wireless networking technologies on today's smartphones include: 802.11, and cellular technologies, such as EDGE or EVDO, and recently 3G technologies. Accessing the Internet using Wi-Fi on smartphones requires careful management of the WLAN interface. The design of...

    Provided By University of Waterloo

  • White Papers // Jan 2010

    Notio - A Java API for Developing CG Tools

    Notio is a Java API for constructing conceptual graph tools and systems. Rather than attempting to provide a comprehensive toolset, Notio attempts to address the widely varying needs of the CG community by providing a platform for the development of tools and applications. It is, first and foremost, an API...

    Provided By University of Waterloo

  • White Papers // Jun 2009

    Network Virtualization: State of the Art and Research Challenges

    Recently network virtualization has been pushed forward by its proponents as a long term solution to the gradual ossification problem faced by the existing Internet and proposed to be an integral part of the next-generation networking paradigm. By allowing multiple heterogeneous network architectures to cohabit on a shared physical substrate,...

    Provided By University of Waterloo

  • White Papers // Oct 2008

    A Survey of Network Virtualization

    Due to the existence of multiple stakeholders with conflicting goals and policies, alterations to the existing Internet are now limited to simple incremental updates; deployment of any new, radically different technology is next to impossible. To fend o this ossification once and for all, network virtualization has been propounded as...

    Provided By University of Waterloo

  • White Papers // Jan 2009

    Identity Management and Resource Allocation in the Network Virtualization Environment

    Due to the existence of multiple stakeholders with conflicting goals and policies, alterations to the existing Internet architecture are now limited to simple incremental updates; deployment of any new, radically different technology is next to impossible. To fend off this ossification, network virtualization has been propounded as a diversifying attribute...

    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 // Jul 2010

    ARBR: Adaptive Reinforcement-Based Routing for DTN

    This paper introduces a novel routing protocol in Delay Tolerant Networks (DTNs), aiming to solve the online distributed routing problem. By manipulating a collaborative reinforcement learning technique, a group of nodes can cooperate with each other and make a forwarding decision for the stored messages based on a cost function...

    Provided By University of Waterloo

  • White Papers // Sep 2009

    Optimizing Energy and Modulation Selection in Multi-Resolution Modulation for Wireless Video Broadcast/Multicast

    Emerging technologies in Broadband Wireless Access (BWA) networks and video coding have enabled high-quality wireless video broadcast/multicast services in metropolitan areas. Joint source-channel coded wireless transmission, especially using hierarchical/superposition coded modulation at the channel, is recognized as an effective and scalable approach to increase the system scalability while tackling the...

    Provided By University of Waterloo

  • White Papers // Jan 2009

    Financial Policy And Compensation: Payout Policy, Dividend Covenants And Pay-Performance Sensitivity

    The authors extend John and John's (1993) theoretical analysis of financial policy and managerial incentives to incorporate free cash flow, payout policy, and debt covenants, and test the theory empirically. To maintain efficient investment incentives, the manager's pay-performance sensitivity declines with the firm's dividend payout. A flexible payout policy, including...

    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 // 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 2010

    Design Principles for Robust Opportunistic Communication

    Several researchers have proposed the use of transient communication opportunities, that is, opportunistic communication, to reduce the cost of rural communication. The authors propose some design principles for robust opportunistic communication drawing from the experiences in developing and deploying several practical systems. They conclude with a sketch of some areas...

    Provided By University of Waterloo

  • White Papers // Apr 2010

    On the Capacity and Scheduling of a Multi-Sector Cell With Co-Channel Interference Knowledge

    The authors study the capacity of a single-hop wireless cell comprised of M fixed directional antennas concentrically arranged around a common axis and each reusing the same channel. The premise for this architecture is that co-channel interference between the fixed directional beams can be identified and reported, allowing joint conflict-free...

    Provided By University of Waterloo

  • White Papers // Aug 2008

    Spare Capacity Reprovisioning for Shared Backup Path Protection in Dynamic Generalized Multi-Protocol Label Switched Networks

    Spare capacity allocation serves as one of the most critical tasks in dynamic Generalized Multi-Protocol Label Switching (GMPLS) networks to meet the stringent network availability constraint stipulated in the Service Level Agreements (SLAs) of each connection. In this paper, an availability-aware spare capacity reconfiguration scheme based on Shared Backup Path...

    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