Ben-Gurion University of the Negev

Displaying 1-22 of 22 results

  • White Papers // Oct 2012

    Data Interpolation: An Efficient Sampling Alternative for Big Data Aggregation

    Given a large set of measurement sensor data, in order to identify a simple function that captures the essence of the data gathered by the sensors, the authors suggest representing the data by (spatial) functions, in particular by polynomials. Given a (sampled) set of values, they interpolate the datapoints to...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Jun 2012

    Recent Advances in Region-of-interest Video Coding

    Recently, the content distribution network industry has become exposed to significant changes. The advent of cheaper and more powerful mobile devices having the ability to play, create, and transmit video content and which maximize a number of multimedia content distributions on various mobile networks will place unprecedented demands on networks...

    Provided By Ben-Gurion University of the Negev

  • White Papers // May 2012

    Detecting Spammers via Aggregated Historical Data Set

    The battle between email service providers and senders of mass unsolicited emails (Spam) continues to gain traction. Vast numbers of Spam emails are sent mainly from automatic botnets distributed over the world. One method for mitigating Spam in a computationally efficient manner is fast and accurate blacklisting of the senders....

    Provided By Ben-Gurion University of the Negev

  • White Papers // Apr 2012

    Mal-ID: Automatic Malware Detection Using Common Segment Analysis and Meta-Features

    In this paper, the authors propose several novel methods, based on machine learning, to detect malware in executable files without any need for preprocessing, such as unpacking or disassembling. The basic method (Mal-ID) is a new static (form-based) analysis methodology that uses common segment analysis in order to detect malware...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Jul 2011

    Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast

    This paper addresses two primary questions: how much faster can one disseminate information in a large wireless network if one has multiple communication channels available (as compared to relying on only a single communication channel)? Can one still disseminate information reliably, even if some subsets of the channels are disrupted?...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Jun 2011

    Tool Support for Enforcing Security Policies on Databases

    Security in general and database protection from unauthorized access in particular, are crucial for organizations. It has long been accepted that security requirements should be considered from the early stages of the development. However, such requirements tend to be neglected or dealt-with only at the end of the development process....

    Provided By Ben-Gurion University of the Negev

  • White Papers // Jan 2011

    Energy and Lifetime Efficient Connectivity in Wireless Ad-Hoc Networks

    A wireless ad-hoc network consists of several transceivers (nodes) located in the plane, communicating by radio. The underlying physical topology of the network depends on the distribution of the wireless nodes (location) as well as the transmission power (range) assignment of each node. In addition to the general case, there...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Jan 2011

    Energy Efficient Connectivity in Ad Hoc Networks From User's and Designer's Perspective

    The authors consider a game that models the creation of a wireless ad hoc network, where nodes are owned by selfish agents. They study a novel cost sharing model in which agents may pay for the transmission power of the other nodes. Each agent has to satisfy some connectivity requirement...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Nov 2010

    Secure Multiparty Computation With Partial Fairness

    A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a trusted party which returns the output of the functionality to all parties. This is formalized by requiring that for every...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Oct 2010

    An Approximation Algorithm for the Euclidean Bottleneck Steiner Tree Problem

    Consider a wireless communication network with n stations, each station has a limited power so that it can only communicate with stations within a limited range, and suppose that, in order to make the network connected and due to budget limits, one is only allowed to put at most k...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Aug 2010

    Direction Assignment in Wireless Networks

    In this paper, the authors consider a wireless network, where each transceiver is equipped with a directional antenna, and study two direction assignment problems, determined by the type of antennas employed. Given a set S of transceivers with directional antennas, located in the plane. They investigate two types of directional...

    Provided By Ben-Gurion University of the Negev

  • White Papers // May 2010

    Efficient Set Operations in the Presence of Malicious Adversaries

    The authors revisit the problem of constructing efficient secure two-party protocols for the problems of set-intersection and set-union, focusing on the model of malicious parties. The main results are constant round protocols that exhibit linear communication and a (practically) linear number of exponentiations with simulation based security. In the heart...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Apr 2010

    Bounded-Hop Strong Connectivity for Flocking Swarms

    In this paper, the authors consider a set of n mobile wireless nodes, which have no information about each other. The only information a single node holds is its current location and future mobility plan. They develop a two-phase distributed self-stabilizing scheme for producing a bounded hop-diameter communication graph. The...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Oct 2009

    Improving Malware Detection by Applying Multi-Inducer Ensemble

    Detection of malicious software (malware) using machine learning methods has been explored extensively to enable fast detection of new released malware. The performance of these classifiers depends on the induction algorithms being used. In order to benefit from multiple different classifiers, and exploit their strengths the authors suggest using an...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Jul 2009

    Simple Random Walks on Radio Networks

    In recent years, protocols that are based on the properties of random walks on graphs have found many applications in communication and information networks, such as wireless networks, peer-to-peer networks and the Web. For wireless networks (and other networks), graphs are actually not the correct model of the communication; instead...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Jul 2009

    Bayesian Network Structure Learning by Recursive Autonomy Identification

    This paper proposes the Recursive Autonomy Identification (RAI) algorithm for Constraint-Based (CB) Bayesian network structure learning. The RAI algorithm learns the structure by sequential application of Conditional Independence (CI) tests, edge direction and structure decomposition into autonomous sub-structures. The sequence of operations is performed recursively for each autonomous substructure while...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Jun 2009

    Improving Worm Detection With Artificial Neural Networks Through Feature Selection and Temporal Analysis Techniques

    Computer worm detection is commonly performed by antivirus software tools that rely on prior explicit knowledge of the worm's code (detection based on code signatures). The authors present an approach for detection of the presence of computer worms based on Artificial Neural Networks (ANN) using the computer's behavioral measures. Identification...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Mar 2009

    RFID Authentication Efficient Proactive Information Security Within Computational Security

    The authors consider repeated communication sessions between a RFID Tag (e.g., Radio Frequency Identification, RFID Tag) and a RFID Verifier. A proactive information theoretic security scheme is proposed. The scheme is based on the assumption that the information exchanged during at least one of every n successive communication sessions is...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Feb 2009

    Mastering (Virtual) Networks A Case Study of Virtualizing Internet Lab

    In this paper, the authors describe a single-server-based system they developed for a large scale networking laboratory. The system, based on virtual machines, is capable of running many concurrent virtual networks, each consisting of PCs, routers and switches that can be connected in various configurations. Lab users can initiate and...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Nov 2008

    On Minimizing the Total Power of K-Strongly Connected Wireless Networks

    Given a wireless network, the authors want to assign each node a transmission power, which will enable transmission between any two nodes (via other nodes). Moreover, due to possible faults, they want to have at least k vertex-disjoint paths from any node to any other, where k is some fixed...

    Provided By Ben-Gurion University of the Negev

  • White Papers // May 2008

    Enabling Off-Line Business Process Analysis: A Transformation-Based Approach

    Business process lifecycle consists of four stages: process specification, process implementation, process execution and monitoring and process analysis. Usually, the relationships among the stages are loosely defined. Due to the frequent changes in today's market, business processes are also changing constantly, thus the need for synchronized the various business process...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Nov 2007

    Effective Business Process Outsourcing: The Prosero Approach

    The convergence between business process modeling and the service-oriented architecture has created a significant opportunity for Information Technology (IT) system integrators: they can offer effective business process outsourcing for Small Medium Enterprises (SME)s that often cannot afford the cost of designing, provisioning, and operating their own software service bus. In...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Nov 2010

    Secure Multiparty Computation With Partial Fairness

    A protocol for computing a functionality is secure if an adversary in this protocol cannot cause more harm than in an ideal computation where parties give their inputs to a trusted party which returns the output of the functionality to all parties. This is formalized by requiring that for every...

    Provided By Ben-Gurion University of the Negev

  • White Papers // May 2010

    Efficient Set Operations in the Presence of Malicious Adversaries

    The authors revisit the problem of constructing efficient secure two-party protocols for the problems of set-intersection and set-union, focusing on the model of malicious parties. The main results are constant round protocols that exhibit linear communication and a (practically) linear number of exponentiations with simulation based security. In the heart...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Jul 2009

    Simple Random Walks on Radio Networks

    In recent years, protocols that are based on the properties of random walks on graphs have found many applications in communication and information networks, such as wireless networks, peer-to-peer networks and the Web. For wireless networks (and other networks), graphs are actually not the correct model of the communication; instead...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Jun 2009

    Improving Worm Detection With Artificial Neural Networks Through Feature Selection and Temporal Analysis Techniques

    Computer worm detection is commonly performed by antivirus software tools that rely on prior explicit knowledge of the worm's code (detection based on code signatures). The authors present an approach for detection of the presence of computer worms based on Artificial Neural Networks (ANN) using the computer's behavioral measures. Identification...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Aug 2010

    Direction Assignment in Wireless Networks

    In this paper, the authors consider a wireless network, where each transceiver is equipped with a directional antenna, and study two direction assignment problems, determined by the type of antennas employed. Given a set S of transceivers with directional antennas, located in the plane. They investigate two types of directional...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Nov 2008

    On Minimizing the Total Power of K-Strongly Connected Wireless Networks

    Given a wireless network, the authors want to assign each node a transmission power, which will enable transmission between any two nodes (via other nodes). Moreover, due to possible faults, they want to have at least k vertex-disjoint paths from any node to any other, where k is some fixed...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Jan 2011

    Energy and Lifetime Efficient Connectivity in Wireless Ad-Hoc Networks

    A wireless ad-hoc network consists of several transceivers (nodes) located in the plane, communicating by radio. The underlying physical topology of the network depends on the distribution of the wireless nodes (location) as well as the transmission power (range) assignment of each node. In addition to the general case, there...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Apr 2010

    Bounded-Hop Strong Connectivity for Flocking Swarms

    In this paper, the authors consider a set of n mobile wireless nodes, which have no information about each other. The only information a single node holds is its current location and future mobility plan. They develop a two-phase distributed self-stabilizing scheme for producing a bounded hop-diameter communication graph. The...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Jan 2011

    Energy Efficient Connectivity in Ad Hoc Networks From User's and Designer's Perspective

    The authors consider a game that models the creation of a wireless ad hoc network, where nodes are owned by selfish agents. They study a novel cost sharing model in which agents may pay for the transmission power of the other nodes. Each agent has to satisfy some connectivity requirement...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Feb 2009

    Mastering (Virtual) Networks A Case Study of Virtualizing Internet Lab

    In this paper, the authors describe a single-server-based system they developed for a large scale networking laboratory. The system, based on virtual machines, is capable of running many concurrent virtual networks, each consisting of PCs, routers and switches that can be connected in various configurations. Lab users can initiate and...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Jul 2011

    Leveraging Channel Diversity to Gain Efficiency and Robustness for Wireless Broadcast

    This paper addresses two primary questions: how much faster can one disseminate information in a large wireless network if one has multiple communication channels available (as compared to relying on only a single communication channel)? Can one still disseminate information reliably, even if some subsets of the channels are disrupted?...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Oct 2012

    Data Interpolation: An Efficient Sampling Alternative for Big Data Aggregation

    Given a large set of measurement sensor data, in order to identify a simple function that captures the essence of the data gathered by the sensors, the authors suggest representing the data by (spatial) functions, in particular by polynomials. Given a (sampled) set of values, they interpolate the datapoints to...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Jun 2012

    Recent Advances in Region-of-interest Video Coding

    Recently, the content distribution network industry has become exposed to significant changes. The advent of cheaper and more powerful mobile devices having the ability to play, create, and transmit video content and which maximize a number of multimedia content distributions on various mobile networks will place unprecedented demands on networks...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Nov 2007

    Effective Business Process Outsourcing: The Prosero Approach

    The convergence between business process modeling and the service-oriented architecture has created a significant opportunity for Information Technology (IT) system integrators: they can offer effective business process outsourcing for Small Medium Enterprises (SME)s that often cannot afford the cost of designing, provisioning, and operating their own software service bus. In...

    Provided By Ben-Gurion University of the Negev

  • White Papers // May 2008

    Enabling Off-Line Business Process Analysis: A Transformation-Based Approach

    Business process lifecycle consists of four stages: process specification, process implementation, process execution and monitoring and process analysis. Usually, the relationships among the stages are loosely defined. Due to the frequent changes in today's market, business processes are also changing constantly, thus the need for synchronized the various business process...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Oct 2009

    Improving Malware Detection by Applying Multi-Inducer Ensemble

    Detection of malicious software (malware) using machine learning methods has been explored extensively to enable fast detection of new released malware. The performance of these classifiers depends on the induction algorithms being used. In order to benefit from multiple different classifiers, and exploit their strengths the authors suggest using an...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Apr 2012

    Mal-ID: Automatic Malware Detection Using Common Segment Analysis and Meta-Features

    In this paper, the authors propose several novel methods, based on machine learning, to detect malware in executable files without any need for preprocessing, such as unpacking or disassembling. The basic method (Mal-ID) is a new static (form-based) analysis methodology that uses common segment analysis in order to detect malware...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Jun 2011

    Tool Support for Enforcing Security Policies on Databases

    Security in general and database protection from unauthorized access in particular, are crucial for organizations. It has long been accepted that security requirements should be considered from the early stages of the development. However, such requirements tend to be neglected or dealt-with only at the end of the development process....

    Provided By Ben-Gurion University of the Negev

  • White Papers // May 2012

    Detecting Spammers via Aggregated Historical Data Set

    The battle between email service providers and senders of mass unsolicited emails (Spam) continues to gain traction. Vast numbers of Spam emails are sent mainly from automatic botnets distributed over the world. One method for mitigating Spam in a computationally efficient manner is fast and accurate blacklisting of the senders....

    Provided By Ben-Gurion University of the Negev

  • White Papers // Jul 2009

    Bayesian Network Structure Learning by Recursive Autonomy Identification

    This paper proposes the Recursive Autonomy Identification (RAI) algorithm for Constraint-Based (CB) Bayesian network structure learning. The RAI algorithm learns the structure by sequential application of Conditional Independence (CI) tests, edge direction and structure decomposition into autonomous sub-structures. The sequence of operations is performed recursively for each autonomous substructure while...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Oct 2010

    An Approximation Algorithm for the Euclidean Bottleneck Steiner Tree Problem

    Consider a wireless communication network with n stations, each station has a limited power so that it can only communicate with stations within a limited range, and suppose that, in order to make the network connected and due to budget limits, one is only allowed to put at most k...

    Provided By Ben-Gurion University of the Negev

  • White Papers // Mar 2009

    RFID Authentication Efficient Proactive Information Security Within Computational Security

    The authors consider repeated communication sessions between a RFID Tag (e.g., Radio Frequency Identification, RFID Tag) and a RFID Verifier. A proactive information theoretic security scheme is proposed. The scheme is based on the assumption that the information exchanged during at least one of every n successive communication sessions is...

    Provided By Ben-Gurion University of the Negev