Tel Aviv University

Displaying 1-27 of 27 results

  • White Papers // Mar 2013

    Improving IP Geolocation by Crawling the Internet PoP Level Graph

    The geographical location of Internet IP addresses is important for academic research, commercial and homeland security applications. While commercial databases claim to have a very high level of accuracy, the correctness of their databases is questionable. Academic tools, based on delay measurements, were shown to have a large range of...

    Provided By Tel Aviv University

  • White Papers // Jan 2013

    Improving AS Relationship Inference Using PoPs

    The Internet is a complex network, comprised of thousands of interconnected Autonomous Systems. Considerable research is done in order to infer the undisclosed commercial relationships between ASes. These relationships, which have been commonly classified to four distinct Type of Relationships (ToRs), dictate the routing policies between ASes. These policies are...

    Provided By Tel Aviv University

  • White Papers // Dec 2012

    Inferring the Periodicity in Large-Scale Internet Measurements

    Many Internet events exhibit periodical patterns. Such events include the availability of end-hosts, usage of internetwork links for balancing load and cost of transit, traffic shaping during peak hours, etc. Internet monitoring systems that collect huge amount of data can leverage periodicity information for improving resource utilization. However, automatic periodicity...

    Provided By Tel Aviv University

  • White Papers // Apr 2012

    Recursive Composition and Bootstrapping for SNARKs and Proof-Carrying Data

    Succinct Non-interactive ARguments of Knowledge (SNARKs), and their generalization to distributed computations by Proof-Carrying Data (PCD), are powerful tools for enforcing the correctness of dynamically evolving computations among multiple mutually-untrusting parties. The authors present recursive composition and bootstrapping techniques that: transform any SNARK with an expensive preprocessing phase into a...

    Provided By Tel Aviv University

  • White Papers // Feb 2012

    Fast Reductions From RAMs to Delegatable Succinct Constraint Satisfaction Problems

    Succinct arguments for NP are proof systems that allow a weak verifier to retroactively check computation done by a more powerful prover. These protocols prove membership in languages (consisting of succinctly-represented very large constraint satisfaction problems) that, alas, are unnatural in the sense that the problems that arise in practice...

    Provided By Tel Aviv University

  • White Papers // Jul 2011

    Decompression-Free Inspection: DPI for Shared Dictionary Compression Over HTTP

    Deep Packet Inspection (DPI) is the most time and resource consuming procedure in contemporary security tools such as Network Intrusion Detection/Prevention System (NIDS/IPS), Web Application Firewall (WAF), or Content Filtering Proxy. DPI consists of inspecting both the packet header and payload and alerting when signatures of malicious software appear in...

    Provided By Tel Aviv University

  • White Papers // Jun 2011

    On the Optimality of Top-k Algorithms for Interactive Web Applications

    In an interactive Web application, the application state changes according to user choices/actions. To assist users in their interaction with such applications, there is a need to provide them with recommendations for the top-k (according to some ranking metric) interactions. These recommendations must be continually updated, as the user interacts...

    Provided By Tel Aviv University

  • White Papers // Apr 2011

    Leakage Tolerant Interactive Protocols

    The authors put forth a framework for expressing security requirements from interactive protocols in the presence of arbitrary leakage. This allows capturing different levels of leakage tolerance of protocols, namely the preservation (or degradation) of security, under coordinated attacks that include various forms of leakage from the secret states of...

    Provided By Tel Aviv University

  • White Papers // Feb 2011

    On the (In)Security of RSA Signatures

    Bellare and Rogaway [ACM CCS '93] introduced the famous random oracle model as a "Paradigm for designing efficient protocols". This paradigm has led to several highly efficient and widely used in practice constructions, such as the RSA Full Domain Hash signature scheme (RSA-FDH). Unfortunately, little is known about the security...

    Provided By Tel Aviv University

  • White Papers // Dec 2010

    Price Competition Under Limited Comparability

    This paper studies market competition when firms can influence consumers' ability to compare market alternatives, through their choice of price "Formats". The authors introduce random graphs as a tool for modeling limited comparability of formats. The main results concern the interaction between firms' equilibrium price and format decisions and its...

    Provided By Tel Aviv University

  • White Papers // Jul 2010

    Collaborative Filtering Based on P2P Networks

    Peer-To-Peer (P2P) networks are used by millions of people for sharing music files. As these networks become ever more popular, they also serve as an excellent source for Music Information Retrieval (MIR) tasks. This paper reviews the latest MIR studies based on P2P data-sets, and presents a new file sharing...

    Provided By Tel Aviv University

  • White Papers // Jul 2010

    A Study of Geolocation Databases

    The geographical location of Internet IP addresses has an importance both for academic research and commercial applications. Thus, both commercial and academic databases and tools are available for mapping IP addresses to geographic locations. Evaluating the accuracy of thesemapping services is complex since obtaining diverse large scale ground truth is...

    Provided By Tel Aviv University

  • White Papers // Jun 2010

    Analyzing the DC File Sharing Network

    This paper investigates the Direct Connect (DC) file sharing network, which to the best of the authors' knowledge, has never been academically studied before. They developed a participating agent, in order to gather protocol specific information. They quantify network characteristics such as distribution of users in hubs, hubs geography, queries...

    Provided By Tel Aviv University

  • White Papers // May 2010

    The 11-20 Money Request Game: Evaluating The Upper Bound Of K-level Reasoning

    The authors study experimentally a two-player game which they find ideal for investigating k-level reasoning. Each player requests an amount of money between 11 and 20 shekels. He receives the amount that he requests and if he requests exactly one shekel less than the other player, he receives an additional...

    Provided By Tel Aviv University

  • White Papers // Apr 2010

    A Framework for Extracting Musical Similarities From Peer-to-Peer Networks

    The usage of peer-to-peer (p2p) networks for Music Information Retrieval (MIR) tasks is gaining momentum. P2P file sharing networks can be used for collecting both search queries and files from shared folders. The first can be utilized to reveal current taste, users interest, and trends, while the latter can be...

    Provided By Tel Aviv University

  • White Papers // Jan 2010

    A Measurement Study of the Origins of End-to-End Delay Variations

    The end-to-end (e2e) stability of Internet routing has been studied for over a decade, focusing on routes and delays. This paper presents a novel technique for uncovering the origins of delay variations by measuring the overlap between delay distribution of probed routes, and how these are affected by route stability....

    Provided By Tel Aviv University

  • White Papers // Dec 2009

    Limitations and Possibilities of Path Trading Between Autonomous Systems

    When forwarding packets in the Internet, Autonomous Systems (ASes) frequently choose the shortest path in their network to the next-hop AS in the BGP path, a strategy known as hot-potato routing. As a result, paths in the Internet are suboptimal from a global perspective. For peering ASes who exchange traffic...

    Provided By Tel Aviv University

  • White Papers // Nov 2009

    Firewall Configuration Errors Revisited

    Practically every corporation that is connected to the Internet uses firewalls as the first line of its cyber-defense. However, the protection that these firewalls provide is only as good as the policy they are configured to implement. The first quantitative evaluation of the quality of corporate firewall configurations appeared in...

    Provided By Tel Aviv University

  • White Papers // Sep 2009

    Abstract Transformers for Thread Correlation Analysis

    The authors present a new technique for speeding up static analysis of (shared memory) concurrent programs. They focus on analyses that compute thread correlations: such analyses infer invariants that capture correlations between the local states of different threads (as well as the global state). Such invariants are required for verifying...

    Provided By Tel Aviv University

  • White Papers // Sep 2009

    Fiat-Shamir With Aborts: Applications to Lattice and Factoring-Based Signatures

    The authors demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in constructions of the most efficient to-date identification and signature schemes with security based on the worst-case hardness of problems in ideal lattices....

    Provided By Tel Aviv University

  • White Papers // Aug 2009

    Feedback Communication Over Individual Channels

    The authors consider the problem of communicating over a channel for which no mathematical model is specified. They present achievable rates as a function of the channel input and output sequences known a-posteriori for discrete and continuous channels. Furthermore they present a rate-adaptive scheme employing feedback which achieves these rates...

    Provided By Tel Aviv University

  • White Papers // Aug 2009

    Power Adaptive Feedback Communication Over an Additive Individual Noise Sequence Channel

    The authors consider a real-valued additive channel with an individual unknown noise sequence. They present a simple sequential communication scheme based on the celebrated Schalkwijk-Kailath scheme, which varies the transmit power according to the power of the sequence, so that asymptotically the relation between the SNR and the rate matches...

    Provided By Tel Aviv University

  • White Papers // Aug 2009

    How (Not) To Do Decision Theory

    The authors discuss the goals and means of positive decision theory and the implications for how to do decision theory. They argue that the goal of positive economic theory generally is to provide predictions, understanding, representation theorems and other results of decision theory should be seen as ways to achieve...

    Provided By Tel Aviv University

  • White Papers // Jul 2009

    Real Investment, Risk And Risk Dynamics

    The spread in average returns between low and high asset growth and investment portfolios is largely accounted for by their spread in systematic risk, as measured by the Chen, Roll and Ross (1986) factors. In addition, systematic risk and volatility fall sharply during large investment periods. Consistent with the predictions...

    Provided By Tel Aviv University

  • White Papers // Jul 2009

    Strategyproof Approximation Mechanisms for Location on Networks

    The authors consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an agent is the distance between its ideal location and the facility. A mechanism maps the locations reported by...

    Provided By Tel Aviv University

  • White Papers // Jun 2009

    Querying DAG-Shaped Execution Traces Through Views

    The question whether a given set of views, defined by queries, can be used to answer another query, arises in several contexts such as query optimization, data integration and semantic caching. This paper studies a specific instance of this problem, where the queried data has the shape of a DAG...

    Provided By Tel Aviv University

  • White Papers // Jul 2008

    Customization Change Impact Analysis for ERP Professionals via Program Slicing

    The authors describe a new tool that automatically identifies impact of customization changes, i.e., how changes affect software behavior. As opposed to existing static analysis tools that aim at aiding programmers or improve performance, their tool is designed for end-users without prior knowledge in programming. They utilize state-of-the-art static analysis...

    Provided By Tel Aviv University

  • White Papers // Dec 2009

    Limitations and Possibilities of Path Trading Between Autonomous Systems

    When forwarding packets in the Internet, Autonomous Systems (ASes) frequently choose the shortest path in their network to the next-hop AS in the BGP path, a strategy known as hot-potato routing. As a result, paths in the Internet are suboptimal from a global perspective. For peering ASes who exchange traffic...

    Provided By Tel Aviv University

  • White Papers // Jul 2011

    Decompression-Free Inspection: DPI for Shared Dictionary Compression Over HTTP

    Deep Packet Inspection (DPI) is the most time and resource consuming procedure in contemporary security tools such as Network Intrusion Detection/Prevention System (NIDS/IPS), Web Application Firewall (WAF), or Content Filtering Proxy. DPI consists of inspecting both the packet header and payload and alerting when signatures of malicious software appear in...

    Provided By Tel Aviv University

  • White Papers // Jul 2010

    A Study of Geolocation Databases

    The geographical location of Internet IP addresses has an importance both for academic research and commercial applications. Thus, both commercial and academic databases and tools are available for mapping IP addresses to geographic locations. Evaluating the accuracy of thesemapping services is complex since obtaining diverse large scale ground truth is...

    Provided By Tel Aviv University

  • White Papers // Jan 2010

    A Measurement Study of the Origins of End-to-End Delay Variations

    The end-to-end (e2e) stability of Internet routing has been studied for over a decade, focusing on routes and delays. This paper presents a novel technique for uncovering the origins of delay variations by measuring the overlap between delay distribution of probed routes, and how these are affected by route stability....

    Provided By Tel Aviv University

  • White Papers // Jan 2013

    Improving AS Relationship Inference Using PoPs

    The Internet is a complex network, comprised of thousands of interconnected Autonomous Systems. Considerable research is done in order to infer the undisclosed commercial relationships between ASes. These relationships, which have been commonly classified to four distinct Type of Relationships (ToRs), dictate the routing policies between ASes. These policies are...

    Provided By Tel Aviv University

  • White Papers // Dec 2012

    Inferring the Periodicity in Large-Scale Internet Measurements

    Many Internet events exhibit periodical patterns. Such events include the availability of end-hosts, usage of internetwork links for balancing load and cost of transit, traffic shaping during peak hours, etc. Internet monitoring systems that collect huge amount of data can leverage periodicity information for improving resource utilization. However, automatic periodicity...

    Provided By Tel Aviv University

  • White Papers // Mar 2013

    Improving IP Geolocation by Crawling the Internet PoP Level Graph

    The geographical location of Internet IP addresses is important for academic research, commercial and homeland security applications. While commercial databases claim to have a very high level of accuracy, the correctness of their databases is questionable. Academic tools, based on delay measurements, were shown to have a large range of...

    Provided By Tel Aviv University

  • White Papers // Aug 2009

    Feedback Communication Over Individual Channels

    The authors consider the problem of communicating over a channel for which no mathematical model is specified. They present achievable rates as a function of the channel input and output sequences known a-posteriori for discrete and continuous channels. Furthermore they present a rate-adaptive scheme employing feedback which achieves these rates...

    Provided By Tel Aviv University

  • White Papers // Aug 2009

    Power Adaptive Feedback Communication Over an Additive Individual Noise Sequence Channel

    The authors consider a real-valued additive channel with an individual unknown noise sequence. They present a simple sequential communication scheme based on the celebrated Schalkwijk-Kailath scheme, which varies the transmit power according to the power of the sequence, so that asymptotically the relation between the SNR and the rate matches...

    Provided By Tel Aviv University

  • White Papers // Feb 2011

    On the (In)Security of RSA Signatures

    Bellare and Rogaway [ACM CCS '93] introduced the famous random oracle model as a "Paradigm for designing efficient protocols". This paradigm has led to several highly efficient and widely used in practice constructions, such as the RSA Full Domain Hash signature scheme (RSA-FDH). Unfortunately, little is known about the security...

    Provided By Tel Aviv University

  • White Papers // Jul 2009

    Strategyproof Approximation Mechanisms for Location on Networks

    The authors consider the problem of locating a facility on a network, represented by a graph. A set of strategic agents have different ideal locations for the facility; the cost of an agent is the distance between its ideal location and the facility. A mechanism maps the locations reported by...

    Provided By Tel Aviv University

  • White Papers // Nov 2009

    Firewall Configuration Errors Revisited

    Practically every corporation that is connected to the Internet uses firewalls as the first line of its cyber-defense. However, the protection that these firewalls provide is only as good as the policy they are configured to implement. The first quantitative evaluation of the quality of corporate firewall configurations appeared in...

    Provided By Tel Aviv University

  • White Papers // Jun 2009

    Querying DAG-Shaped Execution Traces Through Views

    The question whether a given set of views, defined by queries, can be used to answer another query, arises in several contexts such as query optimization, data integration and semantic caching. This paper studies a specific instance of this problem, where the queried data has the shape of a DAG...

    Provided By Tel Aviv University

  • White Papers // Jun 2011

    On the Optimality of Top-k Algorithms for Interactive Web Applications

    In an interactive Web application, the application state changes according to user choices/actions. To assist users in their interaction with such applications, there is a need to provide them with recommendations for the top-k (according to some ranking metric) interactions. These recommendations must be continually updated, as the user interacts...

    Provided By Tel Aviv University

  • White Papers // Dec 2010

    Price Competition Under Limited Comparability

    This paper studies market competition when firms can influence consumers' ability to compare market alternatives, through their choice of price "Formats". The authors introduce random graphs as a tool for modeling limited comparability of formats. The main results concern the interaction between firms' equilibrium price and format decisions and its...

    Provided By Tel Aviv University

  • White Papers // May 2010

    The 11-20 Money Request Game: Evaluating The Upper Bound Of K-level Reasoning

    The authors study experimentally a two-player game which they find ideal for investigating k-level reasoning. Each player requests an amount of money between 11 and 20 shekels. He receives the amount that he requests and if he requests exactly one shekel less than the other player, he receives an additional...

    Provided By Tel Aviv University

  • White Papers // Aug 2009

    How (Not) To Do Decision Theory

    The authors discuss the goals and means of positive decision theory and the implications for how to do decision theory. They argue that the goal of positive economic theory generally is to provide predictions, understanding, representation theorems and other results of decision theory should be seen as ways to achieve...

    Provided By Tel Aviv University

  • White Papers // Apr 2011

    Leakage Tolerant Interactive Protocols

    The authors put forth a framework for expressing security requirements from interactive protocols in the presence of arbitrary leakage. This allows capturing different levels of leakage tolerance of protocols, namely the preservation (or degradation) of security, under coordinated attacks that include various forms of leakage from the secret states of...

    Provided By Tel Aviv University

  • White Papers // Jul 2009

    Real Investment, Risk And Risk Dynamics

    The spread in average returns between low and high asset growth and investment portfolios is largely accounted for by their spread in systematic risk, as measured by the Chen, Roll and Ross (1986) factors. In addition, systematic risk and volatility fall sharply during large investment periods. Consistent with the predictions...

    Provided By Tel Aviv University

  • White Papers // Sep 2009

    Abstract Transformers for Thread Correlation Analysis

    The authors present a new technique for speeding up static analysis of (shared memory) concurrent programs. They focus on analyses that compute thread correlations: such analyses infer invariants that capture correlations between the local states of different threads (as well as the global state). Such invariants are required for verifying...

    Provided By Tel Aviv University

  • White Papers // Feb 2012

    Fast Reductions From RAMs to Delegatable Succinct Constraint Satisfaction Problems

    Succinct arguments for NP are proof systems that allow a weak verifier to retroactively check computation done by a more powerful prover. These protocols prove membership in languages (consisting of succinctly-represented very large constraint satisfaction problems) that, alas, are unnatural in the sense that the problems that arise in practice...

    Provided By Tel Aviv University

  • White Papers // Apr 2012

    Recursive Composition and Bootstrapping for SNARKs and Proof-Carrying Data

    Succinct Non-interactive ARguments of Knowledge (SNARKs), and their generalization to distributed computations by Proof-Carrying Data (PCD), are powerful tools for enforcing the correctness of dynamically evolving computations among multiple mutually-untrusting parties. The authors present recursive composition and bootstrapping techniques that: transform any SNARK with an expensive preprocessing phase into a...

    Provided By Tel Aviv University

  • White Papers // Jun 2010

    Analyzing the DC File Sharing Network

    This paper investigates the Direct Connect (DC) file sharing network, which to the best of the authors' knowledge, has never been academically studied before. They developed a participating agent, in order to gather protocol specific information. They quantify network characteristics such as distribution of users in hubs, hubs geography, queries...

    Provided By Tel Aviv University

  • White Papers // Jul 2010

    Collaborative Filtering Based on P2P Networks

    Peer-To-Peer (P2P) networks are used by millions of people for sharing music files. As these networks become ever more popular, they also serve as an excellent source for Music Information Retrieval (MIR) tasks. This paper reviews the latest MIR studies based on P2P data-sets, and presents a new file sharing...

    Provided By Tel Aviv University

  • White Papers // Apr 2010

    A Framework for Extracting Musical Similarities From Peer-to-Peer Networks

    The usage of peer-to-peer (p2p) networks for Music Information Retrieval (MIR) tasks is gaining momentum. P2P file sharing networks can be used for collecting both search queries and files from shared folders. The first can be utilized to reveal current taste, users interest, and trends, while the latter can be...

    Provided By Tel Aviv University

  • White Papers // Sep 2009

    Fiat-Shamir With Aborts: Applications to Lattice and Factoring-Based Signatures

    The authors demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in constructions of the most efficient to-date identification and signature schemes with security based on the worst-case hardness of problems in ideal lattices....

    Provided By Tel Aviv University

  • White Papers // Jul 2008

    Customization Change Impact Analysis for ERP Professionals via Program Slicing

    The authors describe a new tool that automatically identifies impact of customization changes, i.e., how changes affect software behavior. As opposed to existing static analysis tools that aim at aiding programmers or improve performance, their tool is designed for end-users without prior knowledge in programming. They utilize state-of-the-art static analysis...

    Provided By Tel Aviv University