Tel Aviv University

Displaying 1-40 of 51 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

    Tolerant Algebraic Side-Channel Analysis of AES

    The authors report on a Tolerant Algebraic Side-Channel Analysis (TASCA) attack on an AES implementation, using an optimizing pseudo-Boolean solver to recover the secret key from a vector of Hamming weights corresponding to a single encryption. They first develop a boundary on the maximum error rate that can be tolerated...

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

    Measuring the Validity of Peer-to-Peer Data for Information Retrieval Applications

    Peer-to-Peer (p2p) networks are being increasingly adopted as an invaluable resource for various Information Retrieval (IR) applications, including similarity estimation, content recommendation and trend prediction. However, these networks are usually extremely large and noisy, which raises doubts regarding the ability to actually extract sufficiently accurate information. This paper quantifies the...

    Provided By Tel Aviv University

  • White Papers // Aug 2011

    Real-Time Video Streaming in Multi-Hop Wireless Static Ad Hoc Networks

    The authors deal with the problem of streaming multiple video streams between pairs of nodes in a multi-hop wireless ad hoc network. The nodes are static, know their locations, and are synchronized (via GPS). They introduce a new interference model that uses variable interference radiuses. They present an algorithm for...

    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

    Quantifying the Importance of Vantage Point Distribution in Internet Topology Mapping

    The topology of the Internet has been extensively studied in recent years, driving a need for increasingly complex measurement infrastructures. These measurements have produced detailed topologies with steadily increasing temporal resolution, but concerns exist about the ability of active measurements to measure the true Internet topology. Difficulties in ensuring the...

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

    Joint Unitary Triangularization for MIMO Networks

    This paper considers communication networks where individual links can be described as MIMO channels. Unlike orthogonal modulation methods (such as the singular-value decomposition), the authors allow interference between sub-channels, which can be removed by the receivers via successive cancellation. The degrees of freedom earned by this relaxation are used for...

    Provided By Tel Aviv University

  • White Papers // May 2011

    Cryptanalysis of KeeLoq Code-Hopping Using a Single FPGA

    The KeeLoq cipher is used in many wireless car door systems and garage openers. Recently the algorithm was studied and several attacks have been published. When a random seed is not used the attack on the system is fairly straightforward. However, when a seed is shared between the remote control...

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

    Towards a Game Theoretic View of Secure Computation

    The authors demonstrate how Game Theoretic concepts and formalism can be used to capture cryptographic notions of security. In the restricted but indicative case of two-party protocols in the face of malicious fail-stop faults, they first show how the traditional notions of secrecy and correctness of protocols can be captured...

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

    Key-Dependent Message Security: Generic Amplification and Completeness

    The study of secure encryption scheme is perhaps the most central subject in cryptography. Since the discovery of semantic security till the formulation of CCA-security modern cryptography has successfully developed increasingly stronger notions of security providing secrecy in highly adversarial settings. Still, all these strong notions of security guarantee secrecy...

    Provided By Tel Aviv University

  • White Papers // Dec 2010

    Delay and Redundancy in Lossless Source Coding

    The penalty incurred by imposing a finite delay constraint in lossless source coding of a memoryless source is investigated. It is well known that for the so-called block-to-variable and variable-to-variable codes, the redundancy decays at best polynomially with the delay, which in this case is identified with the block or...

    Provided By Tel Aviv University

  • White Papers // Dec 2010

    Universal Communication Over Modulo-Additive Channels With an Individual Noise Sequence

    Which communication rates can be attained over an unknown channel where the relation between the input and output can be arbitrary? A channel where the output is any arbitrary (possibly stochastic) function of the input that may vary arbitrarily in time with no a-priori model? In this paper the authors...

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

    On the Dynamics of IP Address Allocation and Availability of End-Hosts

    The availability of end-hosts and their assigned routable IP addresses has impact on the ability to fight spammers and attackers, and on peer-to-peer application performance. Previous works study the availability of hosts mostly by using either active pinging or by studying access to a mail service, both approaches suffer from...

    Provided By Tel Aviv University

  • White Papers // Oct 2010

    Semantic Security Under Related-Key Attacks and Applications

    In a Related-Key Attack (RKA) an adversary attempts to break a cryptographic primitive by invoking the primitive with several secret keys which satisfy some known, or even chosen, relation. The authors initiate a formal study of RKA security for randomized encryption schemes. They begin by providing general definitions for semantic...

    Provided By Tel Aviv University

  • White Papers // Aug 2010

    Building Recommendation Systems Using Peer-to-Peer Shared Content

    Peer-To-Peer (p2p) networks are used for sharing content by millions of users. Often, meta-data used for searching is missing or wrong, making it difficult for users to find content. Moreover, this abundance makes searching for new content almost impossible. Recommender systems are not unable to handle p2p data due to...

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

    On the Applicability of Peer-to-Peer Data in Music Information Retrieval Research

    Peer-To-Peer (p2p) networks are being increasingly adopted as an invaluable resource for various Music Information Retrieval (MIR) tasks, including music similarity, recommendation and trend prediction. However, these networks are usually extremely large and noisy, which raises doubts regarding the ability to actually extract sufficiently accurate information. This paper evaluates the...

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

    Efficient Counting of Network Motifs

    Counting network motifs has an important role in studying a wide range of complex networks. However, when the network size is large, as in the case of Internet Topology and WWW graphs counting the number of motifs becomes prohibitive. Devising efficient motif counting algorithms thus becomes an important goal. In...

    Provided By Tel Aviv University

  • White Papers // Feb 2010

    Error Bounds for Repeat-Accumulate Codes Decoded Via Linear Programming

    The authors examine regular and irregular Repeat-Accumulate (RA) codes with repetition degrees which are all even. For these codes and with a particular choice of an interleaver, they give an upper bound on the decoding error probability of a linear-programming based decoder which is an inverse polynomial in the block...

    Provided By Tel Aviv University

  • White Papers // Feb 2010

    On the Diversity, Stability and Symmetry of End-to-End Internet Routes

    The diversity of end-to-end (e2e) Internet routes has been studied for over a decade, dating back to Paxson's seminal work from 1995. This paper presents a measurement study of this issue and systematically evaluate the diversity of the Internet routes, while revisiting some of the conclusions previously made. Two large...

    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

    Predicting Billboard Success Using Data-Mining in P2P Networks

    Peer to Peer networks are the leading cause for music piracy but also used for music sampling prior to purchase. In this paper, the authors investigate the relations between music file sharing and sales (both physical and digital) using large Peer-to-Peer query database information. They compare file sharing information on...

    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

    Public-Key Cryptographic Primitives Provably as Secure as Subset Sum

    The authors propose a semantically-secure public-key encryption scheme whose security is polynomial-time equivalent to the hardness of solving random instances of the subset sum problem. The subset sum assumption required for the security of the scheme is weaker than that of existing subset-sum based encryption schemes, namely the lattice-based schemes...

    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

    Song Clustering Using Peer-to-Peer Co-Occurrences

    Peer-to-peer (p2p) content sharing networks are commonly used by millions of users for sharing music files, often performed by artists even before becoming mainstream. In such networks, as well as modern web 2.0 services, users with similar musical taste often share similar files. This results in songs that have similar...

    Provided By Tel Aviv University

  • White Papers // Sep 2009

    Attacks on RFID-Based Electronic Voting Systems

    Many secure systems, such as contactless credit cards and secure entrance systems are built with contactless smartcard RFID technologies. In many cases these systems are claimed to be secure based on the assumption that readers and tags need to be in close proximity (About 5cm) in order to communicate. However,...

    Provided By Tel Aviv University

  • White Papers // Sep 2009

    Attacks on RFID-Based Electronic Voting Systems

    Many secure systems, such as contactless credit cards and secure entrance systems are built with contactless smartcard RFID technologies. In many cases these systems are claimed to be secure based on the assumption that readers and tags need to be in close proximity (About 5cm) in order to communicate. However,...

    Provided By Tel Aviv University

  • White Papers // Oct 2010

    Semantic Security Under Related-Key Attacks and Applications

    In a Related-Key Attack (RKA) an adversary attempts to break a cryptographic primitive by invoking the primitive with several secret keys which satisfy some known, or even chosen, relation. The authors initiate a formal study of RKA security for randomized encryption schemes. They begin by providing general definitions for semantic...

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

    On the Dynamics of IP Address Allocation and Availability of End-Hosts

    The availability of end-hosts and their assigned routable IP addresses has impact on the ability to fight spammers and attackers, and on peer-to-peer application performance. Previous works study the availability of hosts mostly by using either active pinging or by studying access to a mail service, both approaches suffer from...

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

    Key-Dependent Message Security: Generic Amplification and Completeness

    The study of secure encryption scheme is perhaps the most central subject in cryptography. Since the discovery of semantic security till the formulation of CCA-security modern cryptography has successfully developed increasingly stronger notions of security providing secrecy in highly adversarial settings. Still, all these strong notions of security guarantee secrecy...

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

    Towards a Game Theoretic View of Secure Computation

    The authors demonstrate how Game Theoretic concepts and formalism can be used to capture cryptographic notions of security. In the restricted but indicative case of two-party protocols in the face of malicious fail-stop faults, they first show how the traditional notions of secrecy and correctness of protocols can be captured...

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

    Public-Key Cryptographic Primitives Provably as Secure as Subset Sum

    The authors propose a semantically-secure public-key encryption scheme whose security is polynomial-time equivalent to the hardness of solving random instances of the subset sum problem. The subset sum assumption required for the security of the scheme is weaker than that of existing subset-sum based encryption schemes, namely the lattice-based schemes...

    Provided By Tel Aviv University

  • White Papers // Feb 2010

    Error Bounds for Repeat-Accumulate Codes Decoded Via Linear Programming

    The authors examine regular and irregular Repeat-Accumulate (RA) codes with repetition degrees which are all even. For these codes and with a particular choice of an interleaver, they give an upper bound on the decoding error probability of a linear-programming based decoder which is an inverse polynomial in the block...

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

    Questions In Decision Theory

    This paper surveys a few major questions in the field of decision theory. It is argued that a re-examination of some of the fundamental concepts of the field may have important implications to theoretical and even empirical research in economics and related fields. Decision theory appears to be at a...

    Provided By Tel Aviv University

  • White Papers // Dec 2010

    Universal Communication Over Modulo-Additive Channels With an Individual Noise Sequence

    Which communication rates can be attained over an unknown channel where the relation between the input and output can be arbitrary? A channel where the output is any arbitrary (possibly stochastic) function of the input that may vary arbitrarily in time with no a-priori model? In this paper the authors...

    Provided By Tel Aviv University

  • White Papers // Dec 2010

    Delay and Redundancy in Lossless Source Coding

    The penalty incurred by imposing a finite delay constraint in lossless source coding of a memoryless source is investigated. It is well known that for the so-called block-to-variable and variable-to-variable codes, the redundancy decays at best polynomially with the delay, which in this case is identified with the block or...

    Provided By Tel Aviv University

  • White Papers // May 2011

    Joint Unitary Triangularization for MIMO Networks

    This paper considers communication networks where individual links can be described as MIMO channels. Unlike orthogonal modulation methods (such as the singular-value decomposition), the authors allow interference between sub-channels, which can be removed by the receivers via successive cancellation. The degrees of freedom earned by this relaxation are used for...

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

    Cryptanalysis of KeeLoq Code-Hopping Using a Single FPGA

    The KeeLoq cipher is used in many wireless car door systems and garage openers. Recently the algorithm was studied and several attacks have been published. When a random seed is not used the attack on the system is fairly straightforward. However, when a seed is shared between the remote control...

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

    Productivity And Taxes As Drivers Of FDI

    The authors have developed a framework in which the host country productivity has a positive effect on the intensive margin (the size of FDI flows), but only an ambiguous effect on the extensive margin (the likelihood of FDI flows to occur). The source-country productivity has a negative effect on the...

    Provided By Tel Aviv University

  • White Papers // Sep 2009

    Korset: Automated, Zero False-Alarm Intrusion Detection for Linux

    Host-based Intrusion Detection Systems traditionally compare observable data to pre-constructed models of normal behavior. Such models can either be automatically learnt during a training session, or manually written by the user. Alas, the former technique suffers from false positives, and therefore repeatedly requires user intervention, while the latter technique is...

    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

    Tolerant Algebraic Side-Channel Analysis of AES

    The authors report on a Tolerant Algebraic Side-Channel Analysis (TASCA) attack on an AES implementation, using an optimizing pseudo-Boolean solver to recover the secret key from a vector of Hamming weights corresponding to a single encryption. They first develop a boundary on the maximum error rate that can be tolerated...

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

    Quantifying the Importance of Vantage Point Distribution in Internet Topology Mapping

    The topology of the Internet has been extensively studied in recent years, driving a need for increasingly complex measurement infrastructures. These measurements have produced detailed topologies with steadily increasing temporal resolution, but concerns exist about the ability of active measurements to measure the true Internet topology. Difficulties in ensuring the...

    Provided By Tel Aviv University

  • White Papers // Aug 2010

    Building Recommendation Systems Using Peer-to-Peer Shared Content

    Peer-To-Peer (p2p) networks are used for sharing content by millions of users. Often, meta-data used for searching is missing or wrong, making it difficult for users to find content. Moreover, this abundance makes searching for new content almost impossible. Recommender systems are not unable to handle p2p data due to...

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

    On the Applicability of Peer-to-Peer Data in Music Information Retrieval Research

    Peer-To-Peer (p2p) networks are being increasingly adopted as an invaluable resource for various Music Information Retrieval (MIR) tasks, including music similarity, recommendation and trend prediction. However, these networks are usually extremely large and noisy, which raises doubts regarding the ability to actually extract sufficiently accurate information. This paper evaluates the...

    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