Cornell University

Displaying 361-400 of 1227 results

  • White Papers // Feb 2013

    A Genetic Algorithm for Power-Aware Virtual Machine Allocation in Private Cloud

    Energy efficiency has become an important measurement of scheduling algorithm for private cloud. The challenge is trade-off between minimizing of energy consumption and satisfying Quality of Service (QoS) (e.g. performance or resource availability on time for reservation request). The authors consider resource needs in context of a private cloud system...

    Provided By Cornell University

  • White Papers // Feb 2013

    Efficient Computations of a Security Index for False Data Attacks in Power Networks

    The resilience of Supervisory Control and Data Acquisition (SCADA) systems for electric power networks for certain cyber-attacks are considered. The authors analyze the vulnerability of the measurement system to false data attack on communicated measurements. The vulnerability analysis problem is shown to be NP-hard, meaning that unless P=NP there is...

    Provided By Cornell University

  • White Papers // Feb 2013

    Silent Transitions in Automata with Storage

    The authors consider the problem of removing silent transitions from one-way automata with various kinds of storage. Specifically, they ask for which kinds of storage the real-time and the general version have equal computational power. They consider the computational power of silent transitions in one-way automata with storage. Specifically, they...

    Provided By Cornell University

  • White Papers // Feb 2013

    On Weak Dress Codes for Cloud Storage

    In a distributed storage network, reliability and bandwidth optimization can be provided by regenerating codes. Recently table based regenerating codes viz. DRESS (Distributed Replication-based Exact Simple Storage) codes has been proposed which also optimizes the disk I/O. Dress codes consists of an outer MDS code with an inner Fractional Repetition...

    Provided By Cornell University

  • White Papers // Feb 2013

    Partial Third-Party Information Exchange with Network Coding

    In this paper, the authors consider the problem of exchanging channel state information in a wireless network such that a subset of the clients can obtain the complete channel state information of all the links in the network. They first derive the minimum number of required transmissions for such partial...

    Provided By Cornell University

  • White Papers // Feb 2013

    Error Rate Analysis of GF(q) Network Coded Detect-and-Forward Wireless Relay Networks Using Equivalent Relay Channel Models

    This paper investigates simple means of analyzing the error rate performance of a general qary Galois Field network coded detect-and-forward cooperative relay network with known relay error statistics at the destination. Equivalent relay channels are used in obtaining an approximate error rate of the relay network, from which the diversity...

    Provided By Cornell University

  • White Papers // Feb 2013

    Face Recognition for Social Media With Mobile Cloud Computing

    Social Networking has become today's lifestyle and anyone can easily receive information about everyone in the world. It is very useful if a personal identity can be obtained from the mobile device and also connected to social networking. Therefore, the authors proposed a face recognition system on mobile devices by...

    Provided By Cornell University

  • White Papers // Jan 2013

    A Study of Influential Factors in the Adoption and Diffusion of B2C E-Commerce

    In this paper, the authors look at the present standing of e-commerce in Saudi Arabia, as well as the challenges and strengths of Business To Customers (B2C) electronic commerce. Many studies have been conducted around the world in order to gain a better understanding of the demands, needs and effectiveness...

    Provided By Cornell University

  • White Papers // Jan 2013

    An Overview of Codes Tailor-made for Better Repairability in Networked Distributed Storage Systems

    The increasing amount of digital data generated by today's society asks for better storage solutions. This survey looks at a new generation of coding techniques designed specifically for the maintenance needs of Networked Distributed Storage Systems (NDSS), trying to reach the best compromise among storage space efficiency, fault-tolerance, and maintenance...

    Provided By Cornell University

  • White Papers // Jan 2013

    Energy Efficiency of Network Cooperation for Cellular Uplink Transmissions

    There is a growing interest in energy efficient or so-called "Green" wireless communication to reduce the energy consumption in cellular networks. Since today's wireless terminals are typically equipped with multiple network access interfaces such as Bluetooth, Wi-Fi, and cellular networks, this paper investigates user terminals cooperating with each other in...

    Provided By Cornell University

  • White Papers // Jan 2013

    A Fully Distributed Opportunistic Network Coding Scheme for Cellular Relay Networks

    In this paper, the authors propose an Opportunistic Network Coding (ONC) scheme in cellular relay networks, which operates depending on whether the relay decodes source messages successfully or not. A fully distributed method is presented to implement the proposed opportunistic network coding scheme without the need of any feedback between...

    Provided By Cornell University

  • White Papers // Jan 2013

    Energy-Efficient Power Allocation in OFDM Systems with Wireless Information and Power Transfer

    In this paper, the authors consider an Orthogonal Frequency Division Multiplexing (OFDM) downlink point-to-point system with simultaneous wireless information and power transfer. It is assumed that the receiver is able to harvest energy from noise, interference, and the desired signals. They study the design of power allocation algorithms maximizing the...

    Provided By Cornell University

  • White Papers // Jan 2013

    Why Quantum Computing Is Hard - and Quantum Cryptography Is Not Provably Secure

    Despite high hopes for quantum computation in the 1990s, progress in the past decade has been slow; the people still cannot perform computation with more than about three qubits and are no closer to solving problems of real interest than a decade ago. Separately, recent experiments in fluid mechanics have...

    Provided By Cornell University

  • White Papers // Jan 2013

    Increasing Network Visibility Using Coded Repetition Beacon Piggybacking

    Vehicular Ad-hoc NETworks (VANET) is one of the most challenging research areas in the field of Mobile Ad Hoc Networks. In this research, the authors propose a new mechanism for increasing network visibility, by taking the information gained from periodic safety messages (beacons), and inserting it into a 'Neighbor' table....

    Provided By Cornell University

  • White Papers // Jan 2013

    Towards Optimal Broadcast in Wireless Networks

    Broadcast is a fundamental operation in networks, especially in wireless Mobile Ad-hoc NETworks (MANETs). For example, some form of broadcasting is used by all on-demand MANET routing protocols, when there is uncertainty as to the location of the destination node, or for service discovery. Being such a basic operation of...

    Provided By Cornell University

  • White Papers // Jan 2013

    The Capacity of Wireless Channels: A Physical Approach

    The capacity of Multiple-Input Multiple-Output (MIMO) channels has been considered to be severely limited by the size of antenna arrays. The capacity scaling for a three-dimensional network and the degree-of-freedom analysis for a polarimetric antenna array were provided based on the spherical vector wave decomposition, and both showed the number...

    Provided By Cornell University

  • White Papers // Jan 2013

    Integrated Approach to Data Center Power Management

    Energy accounts for a significant fraction of the operational costs of a data center, and data center operators are increasingly interested in moving towards low-power designs. Two distinct approaches have emerged towards achieving this end: the power proportional approach focuses on reducing disk and server power consumption, while the green...

    Provided By Cornell University

  • White Papers // Jan 2013

    On the Achievable Region for Interference Networks with Point-to-Point Codes

    This paper studies evaluation of the capacity region for interference networks with Point-to-Point (p2p) capacity-achieving codes. Such capacity region has recently been characterized as union of several sub-regions each of which has distinctive operational characteristics. Detailed evaluation of this region, therefore, can be accomplished in a very simple manner by...

    Provided By Cornell University

  • White Papers // Jan 2013

    Generalized Degrees of Freedom for Network-Coded Cognitive Interference Channel

    The authors explain a two-user cognitive Interference Channel (CIC) where one of the transmitters (primary) has knowledge of a linear combination (over an appropriate finite field) of the two information messages. They refer to this channel model as Network-Coded CIC, since the linear combination may be the result of some...

    Provided By Cornell University

  • White Papers // Jan 2013

    Efficient Compressive Sampling of Spatially Sparse Fields in Wireless Sensor Networks

    Wireless Sensor Networks (WSN), i.e. networks of autonomous, wireless sensing nodes spatially deployed over a geographical area, are often faced with acquisition of spatially sparse fields. In this paper, the authors present a novel bandwidth/energy efficient CS scheme for acquisition of spatially sparse fields in a WSN. The paper contribution...

    Provided By Cornell University

  • White Papers // Jan 2013

    Evaluating Cloud Computing Techniques for Smart Power Grid Design Using Parallel Scripting

    Applications used to evaluate next-generation electrical power grids ("Smart grids") are anticipated to be compute and data-intensive. In this paper, the authors parallelize and improve performance of one such application which was run sequentially prior to the use of their cloud-based configuration. They examine multiple cloud computing offerings, both commercial...

    Provided By Cornell University

  • White Papers // Jan 2013

    Toward a Reliable, Secure and Fault Tolerant Smart Grid State Estimation in the Cloud

    The collection and prompt analysis of synchrophasor measurements is a key step towards enabling the future smart power grid, in which grid management applications would be deployed to monitor and react intelligently to changing conditions. The potential exists to slash inefficiencies and to adaptively reconfigure the grid to take better...

    Provided By Cornell University

  • White Papers // Jan 2013

    Generalized Cut-Set Bounds for Broadcast Networks

    A broadcast network is a classical network with all source messages collocated at a single source node. For broadcast networks, the standard cut-set bounds, which are known to be loose in general, are closely related to union as a specific set operation to combine the basic cuts of the network....

    Provided By Cornell University

  • White Papers // Jan 2013

    Efficient Identification of Equivalences in Dynamic Graphs and Pedigree Structures

    The authors propose a new framework for designing test and query functions for complex structures that vary across a given parameter such as genetic marker position. The operations they are interested in include equality testing, set operations, isolating unique states, duplication counting, or finding equivalence classes under identifiability constraints. A...

    Provided By Cornell University

  • White Papers // Jan 2013

    Relative Generalized Rank Weight of Linear Codes and Its Applications to Network Coding

    Secure network coding was first introduced by Cai and Yeung, and further investigated by Feldman et al... In the scenario of secure network coding, a source node transmits n packets from n outgoing links to sink nodes through a network that implements network coding, and each sink node receives N...

    Provided By Cornell University

  • White Papers // Jan 2013

    Utility-Privacy Tradeoff in Databases: An Information-Theoretic Approach

    Ensuring the usefulness of electronic data sources while providing necessary privacy guarantees is an important unsolved problem. This problem drives the need for an analytical framework that can quantify the privacy of personally identifiable information while still providing a quantifiable benefit (utility) to multiple legitimate information consumers. This paper presents...

    Provided By Cornell University

  • White Papers // Jan 2013

    The Case for Cross-Layer Optimizations in Storage: A Workflow-Optimized Storage System

    In this paper, the authors propose using file system custom metadata as a bidirectional communication channel between applications and the storage system. This channel can be used to pass hints that enable cross-layer optimizations, an option hindered today by the ossified file-system interface. The authors study this approach in context...

    Provided By Cornell University

  • White Papers // Jan 2013

    Relay Augmentation for Lifetime Extension of Wireless Sensor Networks

    The authors propose a novel relay augmentation strategy for extending the lifetime of a certain class of Wireless Sensor Networks. In this class, sensors are located at fixed and pre-determined positions and all communication takes place via multi-hop paths in a fixed routing tree rooted at the base station. It...

    Provided By Cornell University

  • White Papers // Jan 2013

    Adaptive Space-Time Decision Feedback Neural Detectors with Data Selection for High-Data Rate Users in DS-CDMA Systems

    A space-time adaptive Decision Feedback (DF) receiver using Recurrent Neural Networks (RNN) is proposed for joint equalization and interference suppression in Direct Sequence Code-Division-Multiple-Access (DS-CDMA) systems equipped with antenna arrays. The proposed receiver structure employs dynamically driven RNNs in the feed forward section for equalization and multi-access interference suppression and...

    Provided By Cornell University

  • White Papers // Jan 2013

    Blind Adaptive Algorithms for Decision Feedback DS-CDMA Receivers in Multipath Channels

    In this paper, the authors examine blind adaptive and iterative Decision Feedback (DF) receivers for Direct Sequence Code Division Multiple Access (DS-CDMA) systems in frequency selective channels. Code-constrained Minimum Variance (CMV) and Constant Modulus (CCM) design criteria for DF receivers based on constrained optimization techniques are investigated for scenarios subject...

    Provided By Cornell University

  • White Papers // Jan 2013

    Adaptive Interference Suppression for CDMA Systems using Interpolated FIR Filters with Adaptive Interpolators in Multipath Channels

    In this paper, the authors propose an adaptive linear receiver structure based on interpolated Finite Impulse Response (FIR) filters with adaptive interpolators for Direct Sequence Code Division Multiple Access (DS-CDMA) systems in multipath channels. The interpolated Minimum Mean-Squared Error (MMSE) and the interpolated Constrained Minimum Variance (CMV) solutions are described...

    Provided By Cornell University

  • White Papers // Jan 2013

    Physical Layer Network Coding for Two-Way Relaying with QAM

    The design of modulation schemes for the physical layer network-coded two way relaying scenario was studied. It was shown that every network coding map that satisfies the exclusive law is represent able by a Latin Square and conversely, and this relationship can be used to get the network coding maps...

    Provided By Cornell University

  • White Papers // Jan 2013

    Physical Layer Network Coding for the K-User Multiple Access Relay Channel

    A Physical layer Network Coding (PNC) scheme is proposed for the K-user wireless Multiple Access Relay Channel (MARC), in which K source nodes transmit their messages to the destination node D with the help of a relay node R: The proposed PNC scheme involves two transmission phases: Phase 1 during...

    Provided By Cornell University

  • White Papers // Jan 2013

    Decentralized Lifetime Minimizing Tree for Data Aggregation in Wireless Sensor Networks

    To meet the demands of Wireless Sensor Networks (WSNs) where data are usually aggregated at a single source prior to transmitting to any distant user, there is a need to establish a tree structure inside any given event region. In this paper, the authors propose a novel technique to create...

    Provided By Cornell University

  • White Papers // Jan 2013

    Network Throughput Optimization via Error Correcting Codes

    A new network construction method is presented for building of scalable, high throughput, low latency networks. The method is based on the exact equivalence discovered between the problems of maximizing network throughput (measured as bisection bandwidth) for a large class of practically interesting Cayley graphs and the problem of maximizing...

    Provided By Cornell University

  • White Papers // Jan 2013

    Low-Complexity Scheduling Policies for Achieving Throughput and Delay Optimality in Multi-Channel Wireless Networks

    In this paper, the authors study the scheduling problem for downlink transmission in a multi-channel (e.g., OFDM-based) wireless network. They focus on a single cell, with the aim of developing a unifying framework for designing low-complexity scheduling policies that can provide optimal performance in terms of both throughput and delay....

    Provided By Cornell University

  • White Papers // Jan 2013

    Faster Quantum Number Factoring via Circuit Synthesis

    Shor's number factoring remains the most striking algorithm for quantum computation as it quickly solves an important task for which no conventional fast algorithms were found in 2,300 years. A major obstacle to implementing Shor's quantum number-factoring algorithm is the large size of modular-exponentiation circuits. The authors reduce this bottleneck...

    Provided By Cornell University

  • White Papers // Jan 2013

    New Variant of ElGamal Signature Scheme

    Since the invention of the public key cryptography in the late 1970s, several new subjects related to the data security as identification, authentication, zero-knowledge proof and secret sharing were explored. In this paper, the authors described a new variant of ElGamal signature scheme and analyzed its security. Their method relies...

    Provided By Cornell University

  • White Papers // Jan 2013

    Clustering Based Lifetime Maximizing Aggregation Tree for Wireless Sensor Networks

    Energy efficiency is the most important issue in all facets of Wireless Sensor Networks (WSNs) operations because of the limited and non-replenish able energy supply. Data aggregation mechanism is one of the possible solutions to prolong the life time of sensor nodes and on the other hand it also helps...

    Provided By Cornell University

  • White Papers // Jan 2013

    An Efficient Hybrid Localization Technique in Wireless Sensor Networks

    Sensor nodes are low cost, low power devices that are used to collect physical data and monitor environmental conditions from remote locations. Wireless Sensor Networks (WSN's) are collection of sensor nodes, coordinating among themselves to perform a particular task. Localization is defined as the deployment of the sensor nodes at...

    Provided By Cornell University

  • White Papers // Apr 2012

    An Exact Solution to the Power Networks Security Index Problem and Its Generalized Min Cut Formulation

    The resilience of Supervisory Control And Data Acquisition (SCADA) systems for electric power networks for certain cyber-attacks is considered. In particular, the authors study the robustness of the observability properties of the network to the loss of some measurements. It was recently shown, under the full measurement assumption, that the...

    Provided By Cornell University

  • White Papers // Apr 2012

    STP/HAMPI and Computer Security

    In the past several years, the author have written two SMT solvers called STP and HAMPI that have found widespread use in computer security research by leading groups in academia, industry and the government. In this paper, the author summarize the features of STP/HAMPI that make them particularly suited for...

    Provided By Cornell University

  • White Papers // Apr 2012

    Towards a Security Engineering Process Model for Electronic Business Processes

    Business Process Management (BPM) and accompanying systems aim at enabling enterprises to become adaptive. In spite of the dependency of enterprises on secure business processes, BPM languages and techniques provide only little support for security. Several complementary approaches have been proposed for security in the domain of BPM. Nevertheless, support...

    Provided By Cornell University

  • White Papers // Apr 2012

    A Formal Definition and a New Security Mechanism of Physical Unclonable Functions

    The characteristic novelty of what is generally meant by a "Physical Unclonable Function" (PUF) is precisely defined, in order to supply a firm basis for security evaluations and the proposal of new security mechanisms. A PUF is defined as a hardware device which implements a physical function with an output...

    Provided By Cornell University

  • White Papers // Jan 2012

    Deducing Security Goals From Shape Analysis Sentences

    Guttman presented a model-theoretic approach to establishing security goals in the context of Strand Space theory. In his approach, a run of the Cryptographic Protocol Shapes Analyzer (CPSA) produces models that determine if a goal is satisfied. This paper presents a method for extracting a sentence that completely characterizes a...

    Provided By Cornell University

  • White Papers // Jun 2012

    A Mathematical Problem for Security Analysis of Hash Functions and Pseudorandom Generators

    In this paper, the authors specify a class of mathematical problems, which they refer to as "Function Density Problems" (FDPs), and point out novel connections of FDPs to the following two cryptographic topics; theoretical security evaluations of keyless hash functions (such as SHA-1), and constructions of provably secure PseudoRandom Generators...

    Provided By Cornell University

  • White Papers // Oct 2010

    E-Net Models of a Software System for Web Pages Security

    This paper presents solutions for cryptography protection for web pages. The solutions comprise the authors' experience in development and implementation of systems for information security in the Automated Information Systems of Bulgarian Armed Forces. The architecture, the models and the methods are being explained. With the increase of the possibilities...

    Provided By Cornell University

  • White Papers // Oct 2009

    Scalable Database Access Technologies for ATLAS Distributed Computing

    ATLAS event data processing requires access to non-event data (detector conditions, calibrations, etc.) stored in relational databases. The database-resident data are crucial for the event data reconstruction processing steps and often required for user analysis. A main focus of ATLAS database operations is on the worldwide distribution of the Conditions...

    Provided By Cornell University

  • White Papers // Jun 2010

    Tata Kelola Database Perguruan Tinggi Yang Optimal Dengan Data Warehouse

    The emergence of new higher education institutions has created the competition in higher education market, and data warehouse can be used as an effective technology tools for increasing competitiveness in the higher education market. Data warehouse produce reliable reports for the institution's high-level management in short time for faster and...

    Provided By Cornell University

  • White Papers // May 2010

    Efficient Support Coupled Frequent Pattern Mining Over Progressive Databases

    There have been many recent studies on sequential pattern mining. The sequential pattern mining on progressive databases is relatively very new, in which, the authors progressively discover the sequential patterns in period of interest. Period of interest is a sliding window continuously advancing as the time goes by. As the...

    Provided By Cornell University

  • White Papers // Apr 2010

    Mobile Database System: Role of Mobility on the Query Processing

    The rapidly expanding technology of mobile communication will give mobile users capability of accessing information from anywhere and anytime. The wireless technology has made it possible to achieve continuous connectivity in mobile environment. When the query is specified as continuous, the requesting mobile user can obtain continuously changing result. In...

    Provided By Cornell University

  • White Papers // Mar 2010

    Mining The Data from Distributed Database Using an Improved Mining Algorithm

    Association Rule Mining is an active data mining research area and most ARM algorithms cater to a centralized environment. Centralized data mining to discover useful patterns in distributed databases isn't always feasible because merging data sets from different sites incurs huge network communication costs. In this paper, an Improved algorithm...

    Provided By Cornell University

  • White Papers // Mar 2010

    Table Manipulation in Simplicial Databases

    The authors developed a category of databases in which the schema of a database is represented as a simplicial set. Each simplex corresponds to a table in the database. There, their main concern was to find a categorical formulation of databases; the simplicial nature of the schemas was to some...

    Provided By Cornell University

  • White Papers // Mar 2010

    Inductive Logic Programming in Databases: from Datalog to DL+log

    In this paper, the authors address an issue that has been brought to the attention of the database community with the advent of the Semantic Web, i.e. the issue of how ontologies (and semantics conveyed by them) can help solving typical database problems, through a better understanding of KR aspects...

    Provided By Cornell University

  • White Papers // May 2012

    Mining Educational Data Using Classification to Decrease Dropout Rate of Students

    In the last two decades, number of Higher Education Institutions (HEI) grows rapidly in India. Since most of the institutions are opened in private mode therefore, a cut throat competition rises among these institutions while attracting the student to got admission. This is the reason for institutions to focus on...

    Provided By Cornell University

  • White Papers // Nov 2012

    Multi Relational Data Mining Approaches: A Data Mining Technique

    The multi relational data mining approach has developed as an alternative way for handling the structured data such that RDBMS. This will provides the mining in multiple tables directly. In MRDM the patterns are available in multiple tables (relations) from a relational database. As the data are available over the...

    Provided By Cornell University

  • White Papers // Aug 2012

    Data Mining the MNC Like Internal Co-Opetition Duality in a University Context

    The goal of the paper is to quantify the simultaneous competition and cooperation that takes place in organizations. As the concepts seem to be dichotomous opposites at first, the term internal co-opetition duality is put forth. Parallels are drawn between co-opetitive processes in big MultiNational Corporations (MNCs) and these taking...

    Provided By Cornell University

  • White Papers // May 2012

    Data Mining on Educational Domain

    Educational Data Mining (EDM) is defined as the area of scientific inquiry centered around the development of methods for making discoveries within the unique kinds of data that come from educational settings, and using those methods to better understand students and the settings which they learn in. Data mining enables...

    Provided By Cornell University

  • White Papers // Jun 2012

    MediaWise - Designing a Smart Media Cloud

    The MediaWise project aims to expand the scope of existing media delivery systems with novel cloud, personalization and collaboration capabilities that can serve the needs of more users, communities, and businesses. The project develops a MediaWise Cloud platform that supports do-it-yourself creation, search, management, and consumption of multimedia content. The...

    Provided By Cornell University

  • White Papers // Nov 2011

    Secured Data Consistency and Storage Way in Untrusted Cloud Using Server Management Algorithm

    It is very challenging part to keep safely all required data that are needed in many applications for user in cloud. Storing user's data in cloud may not be fully trustworthy. Since client doesn't have copy of all stored data, he has to depend on Cloud Service Provider. But dynamic...

    Provided By Cornell University

  • White Papers // Sep 2012

    Quantum/Relativistic Computation of Security and Efficiency of Electrical Power System for a Day-Ahead

    An algorithm for Electrical Power System (EPS) quantum/relativistic security and efficiency computation via perturbative renormalization of the EPS, finding the computation flowcharts, verification and validation is built in this paper. EPS renormalization is performed via virtual thermalization. EPS energy renormalization provides EPS critical load and outlines the EPS fractal landscape....

    Provided By Cornell University

  • White Papers // Jun 2011

    Attack Interference in Non-Collaborative Scenarios for Security Protocol Analysis

    In security protocol analysis, the traditional choice to consider a single Dolev-Yao attacker is supported by the fact thatmodels with multiple collaborating Dolev-Yao attackers have been shown to be reducible to models with one Dolev-Yao attacker. In this paper, the authors take a fundamentally different approach and investigate the case...

    Provided By Cornell University

  • White Papers // May 2011

    Securing the Kernel Via Static Binary Rewriting and Program Shepherding

    Recent Microsoft security bulletins show that kernel vulnerabilities are becoming more and more important security threats. Despite the pretty extensive security mitigations many of the kernel vulnerabilities are still exploitable. Successful kernel exploitation typically grants the attacker maximum privilege level and results in total machine compromise. To protect against kernel...

    Provided By Cornell University

  • White Papers // May 2011

    On the Cryptanalysis of the Generalized Simultaneous Conjugacy Search Problem and the Security of the Algebraic Eraser

    The Algebraic Eraser (AE) is a cryptographic primitive that can be used to obscure information in certain algebraic cryptosystems. The Colored Burau Key Agreement Protocol (CBKAP), which is built on the AE, was introduced by I. Anshel, M. Anshel, D. Goldfeld, and S. Lemieux in 2006 as a protocol suitable...

    Provided By Cornell University

  • White Papers // Jan 2011

    Design and Implementation of a Secure Web-Based File Exchange Server: Specification Design Document

    Building Trust is the basis of all communication, especially electronic one, as the identity of the other entity remains concealed. To address problems of trust, authentication and security over the network, electronic communications and transactions need a framework that provides security policies, encryption mechanisms and procedures to generate manage and...

    Provided By Cornell University

  • White Papers // Jan 2011

    A Secure Web-Based File Exchange Server: Software Requirements Specification Document

    Building Trust is the basis of all communication, especially electronic one, as the identity of the other entity remains concealed. To address problems of trust, authentication and security over the network, electronic communications and transactions need a framework that provides security policies, encryption mechanisms and procedures to generate manage and...

    Provided By Cornell University

  • White Papers // Oct 2011

    Secure Capacity Region for Erasure Broadcast Channels with Feedback

    The authors formulate and explain a cryptographic problem relevant to wireless: a sender, Alice, wants to transmit private messages to two receivers, Bob and Calvin, using unreliable wireless broadcast transmissions and short public feedback from Bob and Calvin. They ask, at what rates can, they broadcast the private messages if...

    Provided By Cornell University

  • White Papers // Sep 2011

    Enhanced Secure Algorithm for Message Communion

    This paper puts forward a safe mechanism of data transmission to tackle the security problem of information which is transmitted in Internet. The encryption standards such as DES (Data Encryption Standard), AES (Advanced Encryption Standard) and EES (Escrowed Encryption Standard) are widely used to solve the problem of communication over...

    Provided By Cornell University

  • White Papers // Sep 2011

    A Contribution to Secure the Routing Protocol "Greedy Perimeter Stateless Routing" Using a Symmetric Signature-Based AES and MD5 Hash

    This paper presents a contribution to secure the routing protocol GPSR (Greedy Perimeter Stateless Routing) for vehicular ad hoc networks, the authors examine the possible attacks against GPSR and security solutions proposed by different research teams working on ad hoc network security. Then, they propose a solution to secure GPSR...

    Provided By Cornell University

  • White Papers // Sep 2011

    Increasing Physical Layer Security Through Scrambled Codes and ARQ

    The authors develop the proposal of non-systematic channel codes on the AWGN wire-tap channel. Such coding technique, based on scrambling, achieves high transmission security with a small degradation of the eavesdropper's channel with respect to the legitimate receiver's channel. In this paper, they show that, by implementing scrambling and descrambling...

    Provided By Cornell University

  • White Papers // Jul 2011

    Secure and Robust IPV6 Autoconfiguration Protocol for Mobile Adhoc Networks Under Strong Adversarial Model

    Automatic IP address assignment in Mobile Ad hoc NETworks (MANETs) enables nodes to obtain routable addresses without any infrastructure. Different protocols have been developed throughout the last years to achieve this service. However, research primarily focused on correctness, efficiency and scalability; much less attention has been given to the security...

    Provided By Cornell University

  • White Papers // May 2011

    Double Blind Comparisons: A New Approach to the Database Aggregation Problem

    The Data Aggregation Problem occurs when a large collection of data takes on a higher security level than any of its individual component records. Traditional approaches of breaking up the data and restricting access on a "Need to know" basis take away one of the great advantages of collecting the...

    Provided By Cornell University

  • White Papers // Dec 2009

    Mnesors for Databases

    The authors add commutatively to axioms defining mnesors and substitute a bitrop for the lattice. They show that it can be applied to relational database querying: set union, intersection and selection are redefined only from the mnesor addition and the granular multiplication. Union-compatibility is not required. Their purpose is to...

    Provided By Cornell University

  • White Papers // Sep 2012

    Teaching Cloud Computing: A Software Engineering Perspective

    The authors have already seen a number of cloud computing courses being offered and even some Master's degrees. Lee Gillam's course at Surrey University was one of the earliest and he has written some reflections on this course. His course is a general introductory course in cloud computing that starts...

    Provided By Cornell University

  • White Papers // Jul 2012

    Analysis of Cloud Storage Prices

    Cloud storage is a fast growing service, whereby an individual or a company stores its data on a storage facility owned and managed by a third party (the cloud provider). The actual storage facility may be positioned at a single location or scattered around the globe, but the cloud user...

    Provided By Cornell University

  • White Papers // May 2012

    Implementation of Private Cloud Using Eucalyptus and an Open Source Operating System

    Cloud computing is bringing a revolution in computing environment replacing traditional software installations, licensing issues into complete on-demand services through internet. Microsoft office 365 a cloud based office application is available to clients online hence no need to buy and install the software. On Facebook a social networking website, users...

    Provided By Cornell University

  • White Papers // Sep 2012

    Fuzzy Keyword Search Over Encrypted Data Using Symbol-Based Trie-Traverse Search Scheme in Cloud Computing

    As Cloud Computing becomes prevalent, more and more sensitive information are being centralized into the cloud. Although traditional searchable encryption schemes allow a user to securely search over encrypted data through keywords and selectively retrieve files of interest, these techniques support only exact keyword search. In this paper, for the...

    Provided By Cornell University

  • White Papers // Sep 2012

    Preserving Privacy for Secure and Outsourcing for Linear Programming in Cloud Computing

    Cloud computing is the long dreamed vision of computing as a utility, where users can remotely store their data into the cloud so as to enjoy the on-demand high quality applications and services from a shared pool of configurable computing resources. By data outsourcing, users can be relieved from the...

    Provided By Cornell University

  • White Papers // Sep 2012

    Toward Cloud Computing Evolution

    Information Technology (IT) shaped the success of organizations, giving them a solid foundation that increases both their level of efficiency as well as productivity. The computing industry is witnessing a paradigm shift in the way computing is performed worldwide. There is a growing awareness among consumers and enterprises to access...

    Provided By Cornell University

  • White Papers // May 2011

    Performance Issues of Heterogeneous Hadoop Clusters in Cloud Computing

    Nowadays most of the cloud applications process large amount of data to provide the desired results. Data volumes to be processed by cloud applications are growing much faster than computing power. This growth demands new strategies for processing and analyzing information. Dealing with large data volumes requires two things: Inexpensive,...

    Provided By Cornell University