Ecole Polytechnique Federale de Lausanne

Displaying 1-40 of 91 results

  • White Papers // Apr 2014

    A Computationally Efficient Limited Memory CMA-ES for Large Scale Optimization

    The authors propose a computationally efficient Limited Memory Co-variance Matrix Adaptation Evolution Strategy for large scale optimization, which they call the LM-CMA-ES. The LM-CMA-ES is a stochastic, derivative-free algorithm for numerical optimization of non-linear, non-convex optimization problems in continuous domain. Inspired by the limited memory BFGS method, the LM- CMA-ES...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Oct 2013

    Solving Shortest and Closest Vector Problems: The Decomposition Approach

    In this paper, the authors present a heuristic algorithm for solving exact, as well as approximate, SVP and CVP for lattices. This algorithm is based on a new approach which is very different from and complementary to the sieving technique. This new approach frees them from the kissing number bound...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Aug 2013

    Improving Flash Write Performance by Using Update Frequency

    Solid-State Drives (SSDs) are quickly becoming the de-fault storage medium as the cost of NAND ash memory continues to drop. However, ash memory introduces new challenges, as data cannot be efficiently updated in-place. To overcome the technology's limitations, SSDs incorporate a software Flash Translation Layer (FTL) that implements out-of-place updates,...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jul 2013

    Task Scheduling for Highly Concurrent Analytical and Transactional Main-Memory Workloads

    Task scheduling typically employs a worker thread per hardware context to process a dynamically changing set of tasks. It is an appealing solution to exploit modern multi-core processors, as it eases parallelization and avoids unnecessary context switches and their associated costs. Naively bundling DBMS operations into tasks, however, can result...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jul 2013

    Practical & Provably Secure Distance-Bounding

    Distance-bounding is a practical solution to be used in security-sensitive contexts, to prevent relay attacks. Its applied cryptographic role is definitely spreading fast and it is clearly far reaching, extending from contactless payments to remote car unlocking. However, security models for distance-bounding are not well-established and, as far as the...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jan 2013

    A Prototype Implementation for the IntServ Operation Over DiffServ Networks

    Combining Integrated Services QoS mechanisms for end-to-end signaling at hosts and Differentiated Services QoS mechanisms in the network core is one proposal for overcoming the limitation of either mechanism when applied alone. In this paper, some of the open issues are discussed and a concrete proposal is presented, which maps...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Sep 2012

    CoRD: A Collaborative Framework for Distributed Data Race Detection

    Modern concurrent software is riddled with data races and these races constitute the source of many problems. Data races are hard to detect accurately before software is shipped and, once they cause failures in production, developers find it challenging to reproduce and debug them. Ideally, all data races should be...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Sep 2012

    Several Weak Bit-Commitments Using Seal-Once Tamper-Evident Devices

    Following both theoretical and practical arguments, the authors construct UC-secure bit-commitment protocols that place their strength on the sender's side and are built using tamper-evident devices, e.g., a type of distinguishable, sealed envelopes. They show that by using a second formalization of tamper-evident distinguishable envelopes they can attain better security...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jan 2012

    Model Checking Duration Calculus: A Practical Approach

    Model checking of real-time systems with respect to Duration Calculus (DC) specifications requires the translation of DC formulae into automata-based semantics. This task is difficult to automate. The existing algorithms provide a limited DC coverage and do not support compositional verification. The authors propose a translation algorithm that advances the...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Dec 2011

    Same Queries, Different Data: Can we Predict Runtime Performance?

    The authors consider MapReduce workloads that are produced by analytics applications. In contrast to ad hoc query workloads, analytics applications are comprised of fixed data flows that are run over newly arriving data sets or on different portions of an existing data set. Examples of such workloads include document analysis/indexing,...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Dec 2011

    Distributed Rate Allocation in P2P Networks with Inter-Session Network Coding

    In this paper, the authors propose a distributed rate allocation algorithm for delay minimal data delivery in overlay networks where multiple sources compete simultaneously for the available network resources. In order to efficiently utilize the network resources, they propose to use inter-session network coding. They devise a distributed algorithm that...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Sep 2011

    Distributed Sensor Failure Detection in Sensor Networks

    The authors investigate distributed sensors' failure detection in networks with a small number of defective sensors. They assume that sensors measure a smooth physical phenomenon and that defective sensors' measurements significantly differ from neighboring sensor measurements. They consider that the defective sensors are well represented by binary sparse signals. Sensor...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jul 2011

    Network Coding for Undirected Information Exchange

    The authors consider the information exchange problem where each in a set of terminals transmits information to all other terminals in the set, over an undirected network. They show that the design of only a single network code for multicasting is sufficient to achieve an arbitrary point in the achievable...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jul 2011

    On the Road: Reflections on the Security of Vehicular Communication Systems

    Vehicular Communication (VC) systems have recently drawn the attention of industry, authorities, and academia. A consensus on the need to secure VC systems and protect the privacy of their users led to concerted efforts to design security architectures. Interestingly, the results different project contributed thus far bear extensive similarities in...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jul 2011

    Architecture for Secure and Private Vehicular Communications

    The deployment of Vehicular Communication (VC) systems is strongly dependent on their security and privacy features. In this paper, the authors propose a security architecture for VC. The primary objectives of the architecture include the management of identities and cryptographic keys, the security of communications, and the integration of privacy...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jul 2011

    Impact of Vehicular Communication Security on Transportation Safety

    Transportation safety, one of the main driving forces of the development of Vehicular Communication (VC) systems, relies on high-rate safety messaging (beaconing). At the same time, there is consensus among authorities, industry, and academia on the need to secure VC systems. With specific proposals in the literature, a critical question...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jul 2011

    Privacy and Identity Management for Vehicular Communication Systems: A Position Paper

    The emerging technology of Vehicular Communications (VC) raises a number of technical problems that need to be addressed. Among those, security and privacy concerns are paramount for the wide adoption of VC. In this position paper, the authors are concerned with privacy and identity management in the context of these...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jun 2011

    Cache-Aware Lock-Free Concurrent Hash Tries

    This paper describes an implementation of a non-blocking concurrent shared-memory hash trie based on single-word compare-and-swap instructions. Insert, lookup and remove operations modifying different parts of the hash trie can be run independent of each other and do not contend. Remove operations ensure that the unneeded memory is freed and...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // May 2011

    Chebyshev Polynomial Approximation for Distributed Signal Processing

    Unions of graph Fourier multipliers are an important class of linear operators for processing signals defined on graphs. The authors present a novel method to efficiently distribute the application of these operators to the high-dimensional signals collected by sensor networks. The proposed method features approximations of the graph Fourier multipliers...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Mar 2011

    Are Sparse Representations Really Relevant for Image Classification?

    Recent years have seen an increasing interest in sparse representations for image classification and object recognition, probably motivated by evidence from the analysis of the primate visual cortex. It is still unclear, however, whether or not sparsity helps classification. In this paper, the authors evaluate its impact on the recognition...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Feb 2011

    Autonomic SLA-Driven Provisioning for Cloud Applications

    Significant achievements have been made for automated allocation of cloud resources. However, the performance of applications may be poor in peak load periods, unless their cloud resources are dynamically adjusted. Moreover, although cloud resources dedicated to different applications are virtually isolated, performance fluctuations do occur because of resource sharing, and...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jan 2011

    A Real-Time Compressed Sensing-Based Personal Electrocardiogram Monitoring System

    Wireless Body Sensor Networks (WBSN) hold the promise to enable next-generation patient-centric mobile-cardiology systems. A WBSN-enabled ElectroCardioGram (ECG) monitor consists of wearable, miniaturized and wireless sensors able to measure and wirelessly report cardiac signals to a WBSN coordinator, which is responsible for reporting them to the tele-health provider. However, state-of-the-art...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jan 2011

    Performance Profiling of Virtual Machines

    Profilers based on hardware performance counters are indispensable for performance debugging of complex software systems. All modern processors feature hardware performance counters, but current Virtual Machine Monitors (VMMs) do not properly expose them to the guest operating systems. Existing profiling tools require privileged access to the VMM to profile the...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jan 2011

    Robust Routing for Dynamic Wireless Networks Based on Stable Embeddings

    Routing packets is a central function of multi-hop wireless networks. Traditionally, there have been two paradigms for routing, either based on the geographical coordinates of the nodes (geographic routing), or based on the connectivity graph (topology-based routing). The former implicitly assumes that geometry determines connectivity, whereas the latter does not...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jan 2011

    Multi-Radio Diversity in Wireless Networks

    This paper describes the Multi-Radio Diversity (MRD) wireless system, which uses path diversity to improve loss resilience in Wireless Local Area Networks (WLANs). MRD coordinates wireless receptions among multiple radios to improve loss resilience in the face of path-dependent frame corruption over the radio. MRD incorporates two techniques to recover...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jan 2011

    Analysis of Supportable Rates in Symmetric Blocking Wavelength Routers

    Constructing an n ? n non-blocking wavelength router using n ? n optical cross-connects may be impractical due to certain constraints such as the cost or space limitations. Moreover, in many cases the traffic requirements can be handled without a non-blocking router. In this paper, the authors study blocking wavelength...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jan 2011

    Indexing Data-Oriented Overlay Networks

    The application of structured overlay networks to implement index structures for data-oriented applications such as peer-to-peer databases or peer-to-peer information retrieval, requires highly efficient approaches for overlay construction, as changing application requirements frequently lead to re-indexing of the data and hence (re-)construction of overlay networks. This problem has so far...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jan 2011

    On Survivable Routing of Mesh Topologies in IP-Over-WDM Networks

    Generally, there are two approaches for providing survivability of IP-over-WDM networks: protection and restoration. Protection uses pre-computed backup paths applied in the case of a failure. Restoration finds dynamically a new path, once a failure has occurred. Protection is less resource efficient (the resources are committed without prior knowledge of...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jan 2011

    Survivable Mapping Algorithm by Ring Trimming (SMART) for Large IP-Over-WDM Networks

    The authors develop a fast and efficient algorithm that finds a survivable (i.e., robust to single fiber failures) mapping of IP topology on the mesh of fibers in IP-over-WDM networks; they call it SMART. A number of algorithms solving this problem can be found in the literature. Since ILP solutions...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jan 2011

    Local Binary Patterns as an Image Preprocessing for Face Authentication

    One of the major problems in face authentication systems is to deal with variations in illumination. In a realistic scenario, it is very likely that the lighting condition of the probe image does not correspond to those of the gallery image, hence there is a need to handle such variations....

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jan 2011

    Online Broadcasting With Network Coding

    Consider a source broadcasting M packets to N receivers over independent erasure channels, where perfect feedback is available from the receivers to the source, and the source is allowed to use coding. The authors investigate offline and online algorithms that optimize delay, both through theoretical analysis as well as simulation...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Dec 2010

    TPC-E vs. TPC-C: Characterizing the New TPC-E Benchmark via an I/O Comparison Study

    TPC-E is a new OLTP benchmark recently approved by the Transaction Processing Performance Council (TPC). In this paper, the authors compare TPC-E with the familiar TPCC benchmark in order to understand the behavior of the new TPC-E benchmark. In particular, they compare the I/O access patterns of the two benchmarks...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Dec 2010

    Flash in a DBMS: Where and How?

    For the past 40 years, Hard Disk Drives (HDDs) have been the building blocks of storage systems. The mechanics of HDDs rotating platters dictate their performance limitations: latencies dominated by mechanical delays (seeks and rotational latencies), throughputs for random accesses much lower than sequential accesses, interference between multiple concurrent workloads...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Nov 2010

    Improving OLTP concurrency through Early Lock Release

    Since the beginning of the multi-core era, database systems research has restarted focusing on increasing concurrency. Even though database systems have been able to accommodate concurrent requests, the exploding number of available cores per chip has surfaced new difficulties. More and more transactions can be served in parallel (since more...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Oct 2010

    The Improbable Differential Attack: Cryptanalysis of Reduced Round CLEFIA

    In this paper the authors present a new statistical cryptanalytic technique that they call improbable differential cryptanalysis which uses a differential that is less probable when the correct key is used. The authors provide data complexity estimates for this kind of attacks and they also show a method to expand...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Oct 2010

    Tracking of Mobile Devices Through Bluetooth Contacts

    The authors investigate if it is possible to reconstruct a mobile phone's mobility using its Bluetooth contacts with other mobile devices, some of which are equipped with GPS receivers. The data mining analysis, based on two different data sets, shows that in certain environments coarse grained mobility of a significant...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Oct 2010

    Improving API Documentation for Java-Like Languages

    The Javadoc paradigm for displaying API documentation to users is quite popular, with similar variants existing for many mainstream languages. However, two user interface design properties of Javadoc may reduce its utility when displaying documentation for APIs that make use of inheritance and parametric polymorphism. First, Javadoc does not show...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Sep 2010

    Thermal-Aware Compilation for Register Window-Based Embedded Processors

    The development of compiler-based mechanisms to optimize the thermal profile of large register files to improve the processor reliability has become an important issue. Thermal hotspots have been known to cause severe reliability issues, while the thermal profile of the devices is also related to the leakage power consumption and...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Sep 2010

    Tracking Games in Mobile Networks

    Users of mobile networks can change their identifiers in regions called mix zones in order to defeat the attempt of third parties to track their location. Mix zones must be deployed carefully in the network to reduce the cost they induce on mobile users and to provide high location privacy....

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Sep 2010

    Using Social Software for Teamwork and Collaborative Project Management in Higher Education

    This paper discusses the potential role of social software in supporting teamwork and collaborative project management in higher education. Based on the fact that social software has been widely spread among young students nowadays, using it for collaborative learning is believed to increase students' involvement and create learning incentives. Two...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jul 2011

    Network Coding for Undirected Information Exchange

    The authors consider the information exchange problem where each in a set of terminals transmits information to all other terminals in the set, over an undirected network. They show that the design of only a single network code for multicasting is sufficient to achieve an arbitrary point in the achievable...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Mar 2009

    ProtoPeer: A P2P Toolkit Bridging the Gap Between Simulation and Live Deployment

    Simulators are a commonly used tool in peer-to-peer systems research. However, they may not be able to capture all the details of a system operating in a live network. Transitioning from the simulation to the actual system implementation is a non-trivial and time-consuming task. The authors present ProtoPeer, a peer-to-peer...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Nov 2008

    Friend-to-Friend Computing: Building the Social Web at the Internet Edges

    The current Social Web is centralized. Large information silos store all the users' profiles, their social links and much of the other personal data. In return for the reliable service the users allow their data and activities to be data mined by the service providers, which in this way increase...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Sep 2009

    More on Castor: The Scalable Secure Routing Protocol for Ad-Hoc Networks

    Wireless ad hoc networks are inherently vulnerable, as any node can disrupt the communication of potentially any other node in the network. Many solutions to this problem have been proposed. In this paper, the authors take a fresh and comprehensive approach, simultaneously addressing three aspects: security, scalability and adaptability to...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Sep 2011

    Distributed Sensor Failure Detection in Sensor Networks

    The authors investigate distributed sensors' failure detection in networks with a small number of defective sensors. They assume that sensors measure a smooth physical phenomenon and that defective sensors' measurements significantly differ from neighboring sensor measurements. They consider that the defective sensors are well represented by binary sparse signals. Sensor...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jan 2011

    Robust Routing for Dynamic Wireless Networks Based on Stable Embeddings

    Routing packets is a central function of multi-hop wireless networks. Traditionally, there have been two paradigms for routing, either based on the geographical coordinates of the nodes (geographic routing), or based on the connectivity graph (topology-based routing). The former implicitly assumes that geometry determines connectivity, whereas the latter does not...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jul 2011

    On the Road: Reflections on the Security of Vehicular Communication Systems

    Vehicular Communication (VC) systems have recently drawn the attention of industry, authorities, and academia. A consensus on the need to secure VC systems and protect the privacy of their users led to concerted efforts to design security architectures. Interestingly, the results different project contributed thus far bear extensive similarities in...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jul 2011

    Architecture for Secure and Private Vehicular Communications

    The deployment of Vehicular Communication (VC) systems is strongly dependent on their security and privacy features. In this paper, the authors propose a security architecture for VC. The primary objectives of the architecture include the management of identities and cryptographic keys, the security of communications, and the integration of privacy...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jul 2011

    Impact of Vehicular Communication Security on Transportation Safety

    Transportation safety, one of the main driving forces of the development of Vehicular Communication (VC) systems, relies on high-rate safety messaging (beaconing). At the same time, there is consensus among authorities, industry, and academia on the need to secure VC systems. With specific proposals in the literature, a critical question...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jul 2011

    Privacy and Identity Management for Vehicular Communication Systems: A Position Paper

    The emerging technology of Vehicular Communications (VC) raises a number of technical problems that need to be addressed. Among those, security and privacy concerns are paramount for the wide adoption of VC. In this position paper, the authors are concerned with privacy and identity management in the context of these...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // May 2010

    Flip-and-Forward Achieves the Optimal Diversity-Multiplexing Tradeoff for the Two-Hop MIMO Relay Channel, With Two Relay Antennas

    The gain of using multiple antennas for setting up communication over a wireless medium has been widely acknowledged in the literature, starting with the seminal works. For point-to-point channels, the performance of multiple antenna systems is quite well understood by now; in particular, the optimal tradeoff between reliability and rate...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Dec 2008

    Diversity-Multiplexing Tradeoff for the MIMO Static Half-Duplex Relay

    In this paper, the authors investigate the Diversity-Multiplexing Tradeoff (DMT) of the multiple-antenna (MIMO) static half-duplex relay channel. The relay channel is assumed to be symmetric in terms of number of antennas, i.e. the source and the destination have n antennas each, and the relay has m antennas. A general...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jun 2011

    Cache-Aware Lock-Free Concurrent Hash Tries

    This paper describes an implementation of a non-blocking concurrent shared-memory hash trie based on single-word compare-and-swap instructions. Insert, lookup and remove operations modifying different parts of the hash trie can be run independent of each other and do not contend. Remove operations ensure that the unneeded memory is freed and...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Mar 2009

    A Comparative Study of Two State-of-the Art Sequence Processing Techniques for Hand Gesture Recognition

    In this paper, the authors address the problem of the recognition of isolated, complex, dynamic hand gestures. The goal of this paper is to provide an empirical comparison of two state-of-the-art techniques for temporal event modeling combined with specific features on two different databases. The models proposed are the Hidden...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jan 2012

    Model Checking Duration Calculus: A Practical Approach

    Model checking of real-time systems with respect to Duration Calculus (DC) specifications requires the translation of DC formulae into automata-based semantics. This task is difficult to automate. The existing algorithms provide a limited DC coverage and do not support compositional verification. The authors propose a translation algorithm that advances the...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jan 2009

    A Debugger for Flow Graph Based Parallel Applications

    Flow graphs provide an explicit description of the parallelization of an application by mapping vertices onto serial computations and edges onto message transfers. The authors present the design and implementation of a debugger for the flow graph based Dynamic Parallel Schedules (DPS) parallelization framework. They use the flow graph to...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jan 2009

    A Simulator for Adaptive Parallel Applications

    Dynamically allocating computing nodes to parallel applications is a promising technique for improving the utilization of cluster resources. Detailed simulations can help identify allocation strategies and problem decomposition parameters that increase the efficiency of parallel applications. The authors describe a simulation framework supporting dynamic node allocation which, given a simple...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jan 2009

    Visual Debugging of MPI Applications

    The authors present the design and implementation of a debugging tool that displays a message-passing graph of the execution of an MPI application. Parts of the graph can be hidden or highlighted based on the stack trace, calling process or communicator of MPI calls. The tool incorporates several features enabling...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Dec 2008

    Handling Very Large Numbers of Messages in Distributed Hash Tables

    In this paper, the authors have provided an extensive study about congestion control for DHTs. They have demonstrated in analysis that congestion control in DHTs is essential for applications that send very large numbers of small messages, such as P2PIR or P2P-DBMS. They have presented a new congestion control strategy...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Sep 2012

    CoRD: A Collaborative Framework for Distributed Data Race Detection

    Modern concurrent software is riddled with data races and these races constitute the source of many problems. Data races are hard to detect accurately before software is shipped and, once they cause failures in production, developers find it challenging to reproduce and debug them. Ideally, all data races should be...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Sep 2012

    Several Weak Bit-Commitments Using Seal-Once Tamper-Evident Devices

    Following both theoretical and practical arguments, the authors construct UC-secure bit-commitment protocols that place their strength on the sender's side and are built using tamper-evident devices, e.g., a type of distinguishable, sealed envelopes. They show that by using a second formalization of tamper-evident distinguishable envelopes they can attain better security...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jan 2013

    A Prototype Implementation for the IntServ Operation Over DiffServ Networks

    Combining Integrated Services QoS mechanisms for end-to-end signaling at hosts and Differentiated Services QoS mechanisms in the network core is one proposal for overcoming the limitation of either mechanism when applied alone. In this paper, some of the open issues are discussed and a concrete proposal is presented, which maps...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Dec 2011

    Same Queries, Different Data: Can we Predict Runtime Performance?

    The authors consider MapReduce workloads that are produced by analytics applications. In contrast to ad hoc query workloads, analytics applications are comprised of fixed data flows that are run over newly arriving data sets or on different portions of an existing data set. Examples of such workloads include document analysis/indexing,...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Dec 2010

    TPC-E vs. TPC-C: Characterizing the New TPC-E Benchmark via an I/O Comparison Study

    TPC-E is a new OLTP benchmark recently approved by the Transaction Processing Performance Council (TPC). In this paper, the authors compare TPC-E with the familiar TPCC benchmark in order to understand the behavior of the new TPC-E benchmark. In particular, they compare the I/O access patterns of the two benchmarks...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Dec 2010

    Flash in a DBMS: Where and How?

    For the past 40 years, Hard Disk Drives (HDDs) have been the building blocks of storage systems. The mechanics of HDDs rotating platters dictate their performance limitations: latencies dominated by mechanical delays (seeks and rotational latencies), throughputs for random accesses much lower than sequential accesses, interference between multiple concurrent workloads...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Nov 2010

    Improving OLTP concurrency through Early Lock Release

    Since the beginning of the multi-core era, database systems research has restarted focusing on increasing concurrency. Even though database systems have been able to accommodate concurrent requests, the exploding number of available cores per chip has surfaced new difficulties. More and more transactions can be served in parallel (since more...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Dec 2011

    Distributed Rate Allocation in P2P Networks with Inter-Session Network Coding

    In this paper, the authors propose a distributed rate allocation algorithm for delay minimal data delivery in overlay networks where multiple sources compete simultaneously for the available network resources. In order to efficiently utilize the network resources, they propose to use inter-session network coding. They devise a distributed algorithm that...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Feb 2010

    Network Coding Node Placement for Delay Minimization in Streaming Overlays

    Network coding has been proposed recently as an efficient method to increase network throughput by allowing network nodes to combine packets instead of simply forwarding them. However, packet combinations in the network may increase delay, complexity and even generate overly redundant information when they are not designed properly. Typically, the...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Nov 2008

    Artificial Immune System for Collaborative Spam Filtering

    Artificial Immune Systems (AIS) use the concepts and algorithms inspired by the theory of how the human immune system works. This paper presents the design and initial evaluation of a new artificial immune system for collaborative spam filtering. Collaborative spam filtering allows for the detection of not-previously-seen spam content, by...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jan 2009

    Password Interception in a SSL/TLS Channel

    Simple password authentication is often used e.g. from an email software application to a remote IMAP server. This is frequently done in a protected peer-to-peer tunnel, e.g. by SSL/TLS. At Eurocrypt'02, Vaudenay presented vulnerabilities in padding schemes used for block ciphers in CBC mode. He used a side channel, namely...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Oct 2009

    Economic Aspects of Cloud Computing

    The new paradigm of cloud computing is taking over individual and business computation tasks. The cloud is dissociated from super-computers offering computational services in the early information age by the following. Cloud computing provides a solid framework for resource planning, the most crucial problem of the IT industry, as well...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jul 2009

    Pathchecker: An RFID Application for Tracing Products in Supply-Chains

    This paper presents an application of RFIDs for supply-chain management. In the application, it considers two types of readers. On one part, one has readers that will mark tags at given points. After that, these tags can be checked by another type of readers to tell whether a tag has...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Sep 2009

    Malicious Traffic Detection in Local Networks With Snort

    Snort is an open source Network Intrusion Detection System combining the benefits of signature, protocol and anomaly based inspection and is considered to be the most widely deployed IDS/IPS technology worldwide. However, Snort's deployment in a large corporate network poses different problems in terms of performance or rule selection. This...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jan 2011

    Multi-Radio Diversity in Wireless Networks

    This paper describes the Multi-Radio Diversity (MRD) wireless system, which uses path diversity to improve loss resilience in Wireless Local Area Networks (WLANs). MRD coordinates wireless receptions among multiple radios to improve loss resilience in the face of path-dependent frame corruption over the radio. MRD incorporates two techniques to recover...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jan 2011

    Analysis of Supportable Rates in Symmetric Blocking Wavelength Routers

    Constructing an n ? n non-blocking wavelength router using n ? n optical cross-connects may be impractical due to certain constraints such as the cost or space limitations. Moreover, in many cases the traffic requirements can be handled without a non-blocking router. In this paper, the authors study blocking wavelength...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Apr 2009

    The Impact Of Corporate Governance Practices On R&D Efforts: A Look At Shareholders~ Rights, Cross-Listing And Control Pyramid

    The paper considers the impact of multiple shareholder-oriented governance practices on R&D decisions. Based on a sample of 5,713 firms belonging to 110 large French listed business groups, these results substantiate the idea that shareholder-oriented governance practices and a lower position in a control pyramid are better for R&D investment....

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jan 2009

    Algebraic Gossip on Arbitrary Networks

    Consider a network of nodes where each node has a message to communicate to all other nodes. For this communication problem, the authors analyze a gossip based protocol where coded messages are exchanged. This problem was studied in where a bound to the dissemination time based on the spectral properties...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Jan 2009

    Exploiting the Path Propagation Time Differences in Multipath Transmission With FEC

    The authors consider a transmission of a delay-sensitive data stream from a single source to a single destination. The reliability of this transmission may suffer from bursty packet losses - the predominant type of failures in today's Internet. An effective and well studied solution to this problem is to protect...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Oct 2010

    The Improbable Differential Attack: Cryptanalysis of Reduced Round CLEFIA

    In this paper the authors present a new statistical cryptanalytic technique that they call improbable differential cryptanalysis which uses a differential that is less probable when the correct key is used. The authors provide data complexity estimates for this kind of attacks and they also show a method to expand...

    Provided By Ecole Polytechnique Federale de Lausanne

  • White Papers // Sep 2009

    Hierarchical Routing Over Dynamic Wireless Networks

    A major challenge in the design of wireless ad hoc networks is the need for distributed routing algorithms that consume a minimal amount of network resources. This is particularly important in dynamic networks, where the topology can change over time, and therefore routing tables must be updated frequently. Such updates...

    Provided By Ecole Polytechnique Federale de Lausanne