ETH Zurich

Displaying 1-40 of 325 results

  • White Papers // Sep 2013

    Multi-Core, Main-Memory Joins: Sort vs. Hash Revisited

    In this paper, the authors experimentally study the performance of main-memory, parallel, multi-core join algorithms, focusing on sort-merge and (radix-)hash join. The relative performance of these two join approaches have been a topic of discussion for a long time. With the advent of modern multi-core architectures, it has been argued...

    Provided By ETH Zurich

  • White Papers // Sep 2013

    A Constructive Approach to Functional Encryption

    Functional encryption is an important generalization of several types of encryption such as public-key, identity-based, and attribute-based encryption. Numerous different security definitions for functional encryption have been proposed, most of them being rather complex and involving several algorithms. Many of these definitions differ in details such as which algorithm has...

    Provided By ETH Zurich

  • White Papers // Sep 2013

    Key Exchange with Unilateral Authentication: Composable Security Definition and Modular Protocol Design

    Key exchange with unilateral authentication (short: unilateral key exchange) is an important primitive in practical security protocols; a prime example is the widely deployed TLS protocol, which is usually run in this mode. Unilateral key-exchange protocols are employed in a client-server setting where only the server has a certified public...

    Provided By ETH Zurich

  • White Papers // Aug 2013

    A Dynamic Trade-off Between Active and Passive Corruptions in Secure Multi-Party Computation

    Multi-Party Computation (MPC) allows a set of n parties to securely compute a (probabilistic) function f in a distributed manner, where security means that secrecy of the inputs and correctness of the output are maintained even when some of the parties are dishonest. The dishonesty of parties is modeled with...

    Provided By ETH Zurich

  • White Papers // Jul 2013

    Optimising Conceptual Data Models through Profiling in Object Databases

    Agile methods promote iterative development with short cycles, where user feedback from the previous iteration is used to refactor and improve the current version. For information systems development, the authors propose to extend this feedback loop by using database pro ling information to propose adaptations to the conceptual model to...

    Provided By ETH Zurich

  • White Papers // May 2013

    Tailing RFID Tags for Clone Detection

    RFID (Radio-Frequency IDentification) is a key emerging technology for supply-chain monitoring and detection of counterfeit and grey-market goods. The most prevalent RFID tags are, however, simply \"Wireless barcodes,\" themselves vulnerable to cloning and counterfeiting. While continuous monitoring can, in principle, detect cloning attacks, real-world supply chains often contain significant blind...

    Provided By ETH Zurich

  • White Papers // Mar 2013

    VM-MAD: A Cloud/cluster Software for Service-Oriented Academic Environments

    The availability of powerful computing hardware in IaaS clouds makes cloud computing attractive also for computational workloads that were up to now almost exclusively run on HPC clusters. In this paper, the authors present the VM-MAD Orchestrator software: an open source framework for cloudbursting Linux-based HPC clusters into IaaS clouds...

    Provided By ETH Zurich

  • White Papers // Mar 2013

    On Limitations of Friendly Jamming for Confidentiality

    Wireless communication provides unique security challenges, but also enables novel ways to defend against attacks. In the past few years, a number of works discussed the use of friendly jamming to protect the confidentiality of the communicated data as well as to enable message authentication and access control. In this...

    Provided By ETH Zurich

  • White Papers // Mar 2013

    SoK: Secure Data Deletion

    Secure data deletion is the task of deleting data irrecoverably from a physical medium. In the digital world, data is not securely deleted by default; instead, many approaches add secure deletion to existing physical medium interfaces. Interfaces to the physical medium exist at different layers, such as user-level applications, the...

    Provided By ETH Zurich

  • White Papers // Jan 2013

    Pricing in Information-Centric Network Interconnection

    The authors propose a pricing model to study the economic incentives for caching and sharing content in the interconnection of Information-Centric Networks (ICNs). While collaborative caching in ICNs is a key feature to success in improving network performance and reducing delivery costs in content distribution, the current pricing strategies in...

    Provided By ETH Zurich

  • White Papers // Dec 2012

    Main-Memory Hash Joins on Multi-Core CPUs: Tuning to the Underlying Hardware

    The architectural changes introduced with multi-core CPUs have triggered a redesign of main-memory join algorithms. In the last few years, two diverging views have appeared. One approach advocates careful tailoring of the algorithm to the architectural parameters (cache sizes, TLB, and memory bandwidth). The other approach argues that modern hardware...

    Provided By ETH Zurich

  • White Papers // Nov 2012

    Relaying and Base Station Cooperation: A Comparative Survey for Future Cellular Networks

    The authors develop a unified framework to investigate the performance of future cellular networks with relays and/or Coordinated MultiPoint (CoMP) transmission. Based on this framework, they study the benefits of CoMP and relaying in a realistic setup. They consider imperfect channel knowledge, different power levels, and simple (thus practically relevant)...

    Provided By ETH Zurich

  • White Papers // Nov 2012

    Universal Computation With Low-Complexity Wireless Relay Networks

    The authors propose a method for enabling complex computations in a network of low-complexity wireless devices. By utilizing multi-hop relaying, such devices can form the wireless equivalent of an Artificial Neural Network (ANN). They provide a method for programming the network functionality in a decentralized fashion and demonstrate the robustness...

    Provided By ETH Zurich

  • White Papers // Nov 2012

    Discovering Structure in Unstructured I/O

    Checkpointing is the predominant storage driver in today's petascale supercomputers and is expected to remain as such in tomorrow's exascale supercomputers. Users typically prefer to checkpoint into a shared file yet parallel file systems often perform poorly for shared file writing. A powerful technique to address this problem is to...

    Provided By ETH Zurich

  • White Papers // Nov 2012

    DTN-Meteo: Forecasting the Performance of DTN Protocols Under Heterogeneous Mobility

    Opportunistic or Delay Tolerant Networks (DTNs) may be used to enable communication in case of failure or lack of infrastructure (disaster, censorship, remote areas) and to complement existing wireless technologies (cellular, WiFi). Wireless peers communicate when in contact, forming an impromptu network, whose connectivity graph is highly dynamic and only...

    Provided By ETH Zurich

  • White Papers // Oct 2012

    Evaluating User Privacy in Bitcoin

    Bitcoin is quickly emerging as a popular digital payment system. However, in spite of its reliance on pseudonyms, Bitcoin raises a number of privacy concerns due to the fact that all of the transactions that take place are publicly announced in the system. In this paper, the authors investigate the...

    Provided By ETH Zurich

  • White Papers // Sep 2012

    Distributed Medium Access Control With Dynamic Altruism

    In this paper, the authors consider medium access control of Local Area Networks (LANs) under limited-information conditions as benefits a distributed system. Rather than assuming "By rule" conformance to a protocol designed to regulate packet-flow rates (as in, e.g., CSMA windowing), they begin with a non-cooperative game framework and build...

    Provided By ETH Zurich

  • White Papers // Sep 2012

    ADMM for Consensus on Colored Networks

    The authors propose a novel distributed algorithm for one of the most fundamental problems in networks: the average consensus. They view the average consensus as an optimization problem, which allows one to use recent techniques and results from the optimization area. Based on the assumption that a coloring scheme of...

    Provided By ETH Zurich

  • White Papers // Aug 2012

    A Cognitive-Inspired Model for Self-Organizing Networks

    In this paper, the authors propose a computational scheme inspired by the workings of human cognition. They embed some fundamental aspects of the human cognitive system into this scheme in order to obtain a minimization of computational resources and the evolution of a dynamic knowledge network over time, and apply...

    Provided By ETH Zurich

  • White Papers // Aug 2012

    Evaluating the Trade-Off Between Energy Efficiency and QoE in Wireless Mesh Networks

    The increasing usage of wireless networks creates new challenges for wireless access providers. On the one hand, providers want to satisfy the user demands but on the other hand, they try to reduce the operational costs by decreasing the energy consumption. In this paper, the authors evaluate the tradeoff between...

    Provided By ETH Zurich

  • White Papers // Jul 2012

    VF2x: Fast, Efficient Virtual Network Mapping for Real Testbed Workloads

    Distributed network testbeds like GENI aim to support a potentially large number of experiments simultaneously on a complex, widely distributed physical network by mapping each requested network onto a share or "Slice" of physical hosts, switches and links. A significant challenge is network mapping: how to allocate virtual nodes, switches...

    Provided By ETH Zurich

  • White Papers // Jul 2012

    Boosting Market Liquidity of Peer-to-Peer Systems Through Cyclic Trading

    Tit-for-tat trading lies at the heart of many incentive mechanisms for distributed systems where participants are anonymous. However, since the standard tit-for-tat approach is restricted to bilateral exchanges, data is transferred only between peers with direct and mutual interests. Generalizing tit-for-tat to multi-lateral trades where contributions can occur along cycles...

    Provided By ETH Zurich

  • White Papers // Jul 2012

    Scheduling Wireless Links With Successive Interference Cancellation

    In this paper, the authors study the problem of scheduling wireless links in a model where successive interference cancellation is combined with the physical interference model and uniform power assignment. Successive interference cancellation is based on the observation that interfering signals should not be treated as random noise, but as...

    Provided By ETH Zurich

  • White Papers // Jun 2012

    Data Node Encrypted File System: Efficient Secure Deletion for Flash Memory

    The authors propose the Data Node Encrypted File System (DNEFS), which uses on-the-y encryption and decryption of le system data nodes to efficiently and securely delete data on ash memory systems. DNEFS is a generic modification of existing ash le systems or controllers that enables secure data deletion while preserving...

    Provided By ETH Zurich

  • White Papers // Jun 2012

    Performance Analysis of SCOOP Programs

    To support developers in writing reliable and efficient concurrent programs, novel concurrent programming abstractions have been proposed in recent years. Programming with such abstractions requires new analysis tools because the execution semantics often differs considerably from established models. The authors present a performance analyzer that is based on new metrics...

    Provided By ETH Zurich

  • White Papers // Jun 2012

    Can Asynchronous Exceptions Expire?

    A multitude of asynchronous exception mechanisms have been proposed. They specify where and when an asynchronous exception propagates. The authors highlight another aspect that has largely been overlooked: can an asynchronous exception expire? They discuss scenarios where it is meaningful for an asynchronous exception to expire. They further elaborate on...

    Provided By ETH Zurich

  • White Papers // Jun 2012

    Exploring the Physical-Layer Identification of GSM Devices

    In this paper, the authors study the physical-layer identification of GSM devices. For their exploration, they build an ad-hoc acquisition setup that collects GSM signals during voice calls. They collect signals from a population of 18 mobile devices and build fingerprints by considering both the transient and the data parts...

    Provided By ETH Zurich

  • White Papers // Jun 2012

    Counting Stream Registers: An Efficient and Effective Snoop Filter Architecture

    The authors introduce a counting stream register snoop filter, which improves the performance of existing snoop filters based on stream registers. Over time, this class of snoop filters loses the ability to filter memory addresses that have been loaded, and then evicted, from the caches that are filtered; they include...

    Provided By ETH Zurich

  • White Papers // May 2012

    Classifying Internet One-Way Traffic

    Internet Background Radiation (IBR) is a very interesting piece of Internet traffic as it is the result of attacks and mis-configurations. Previous work has primarily analyzed IBR traffic to large unused IP address blocks called network telescopes. In this paper, the authors build new techniques for monitoring one-way traffic in...

    Provided By ETH Zurich

  • White Papers // May 2012

    On the Efficiency of Classical and Quantum Secure Function Evaluation

    The authors provide bounds on the efficiency of secure one sided output two-party computation of arbitrary finite functions from trusted distributed randomness in the statistical case. From these results they derive bounds on the efficiency of protocols that use different variants of OT as a black-box. When applied to implementations...

    Provided By ETH Zurich

  • White Papers // May 2012

    Passive Corruption in Statistical Multi-Party Computation

    The goal of Multi-Party Computation (MPC) is to perform an arbitrary computation in a distributed, private, and fault-tolerant way. For this purpose, a fixed set of n parties runs a protocol that tolerates an adversary corrupting a subset of the parties, preserving certain security guarantees like correctness, secrecy, robustness, and...

    Provided By ETH Zurich

  • White Papers // May 2012

    Collection and Analysis of Multi-Dimensional Network Data for Opportunistic Networking Research

    Opportunistic networks use human mobility and consequent wireless contacts between mobile devices to disseminate data in a peer-to-peer manner. Designing appropriate algorithms and protocols for such networks is challenging as it requires understanding patterns of mobility (who meets whom), social relations (who knows whom) and communication (who communicates with whom)....

    Provided By ETH Zurich

  • White Papers // Apr 2012

    Shedding Light on Log Correlation in Network Forensics Analysis

    Presently, forensics analyses of security incidents rely largely on manual, ad-hoc, and very time-consuming processes. A security analyst needs to manually correlate evidence from diverse security logs with expertise on suspected malware and background on the configuration of an infrastructure to diagnose if, when, and how an incident happened. To...

    Provided By ETH Zurich

  • White Papers // Apr 2012

    Forecasting DTN Performance Under Heterogeneous Mobility: The Case of Limited Replication

    Opportunistic or Delay Tolerant Networks (DTNs) may be used to enable communication in case of failure or lack of infrastructure (disaster, censorship, remote areas) and to complement existing wireless technologies (cellular, WiFi).Wireless peers communicate when in contact, forming an impromptu network, whose connectivity graph is highly dynamic and only partly...

    Provided By ETH Zurich

  • White Papers // Apr 2012

    Automated Analysis of Diffie-Hellman Protocols and Advanced Security Properties

    The authors present a general approach for the symbolic analysis of security protocols that use Diffie-Hellman exponentiation to achieve advanced security properties. They model protocols as multi-set rewriting systems and security properties as first-order formulas. They analyze them using a novel constraint-solving algorithm that supports both falsification and verification, even...

    Provided By ETH Zurich

  • White Papers // Apr 2012

    An Algorithm for Online Reconfiguration of Resource Reservations for Hard Real-Time Systems

    Now-a-days, real-time applications expect the supporting computing system to be reconfigured at run-time. Even during such reconfiguration, timing requirements of the applications must be met. By extension, such requirements are relevant in the design of resource reservations techniques. In this paper, the authors consider such a reconfiguration of the reservation...

    Provided By ETH Zurich

  • White Papers // Apr 2012

    A Comprehensive Operational Semantics of the SCOOP Programming Model

    Operational semantics is a flexible, but rigorous means to describe the meaning of programming languages. Small semantics are often preferred, for example to facilitate model checking. However, omitting too many details in a semantics limits results to a core language only, leaving a wide gap towards real implementations. In this...

    Provided By ETH Zurich

  • White Papers // Mar 2012

    Moving Application Logic From the Firmware to the Cloud: Towards the Thin Server Architecture for the Internet of Things

    Unlike traditional networked embedded systems, the Internet of Things interconnects heterogeneous devices from various manufacturers with diverse functionalities. To foster the emergence of novel applications, this vast infrastructure requires a common application layer. As a single global standard for all device types and application domains is impracticable, the authors propose...

    Provided By ETH Zurich

  • White Papers // Feb 2012

    Business Model of the Prefab Concrete Industry - A Two-Dimensional Cooperation Network

    Building construction in Switzerland is characterized by small scaled construction and prefabrication enterprises and still dominated by manual production techniques. New strategies and concepts are necessary to empower the small scaled prefabrication and construction enterprises as well as local architects or engineers to benefit both from industrialization concepts and tools,...

    Provided By ETH Zurich

  • White Papers // Feb 2012

    Attack-Preserving Security Protocol Transformations

    The rigorous incremental development of security protocols has so far received much less attention than protocol verification techniques. In this paper, the authors study security protocol transformations. These can serve both for simplifying protocols before verification and, in the other direction, for developing protocols by stepwise refinement of simple abstract...

    Provided By ETH Zurich

  • White Papers // Jan 2011

    Symbolic and Cryptographic Analysis of the Secure WS-ReliableMessaging Scenario

    Web services are an important series of industry standards for adding semantics to web-based and XML-based communication, in particular among enterprises. Like the entire series, the security standards and proposals are highly modular. Combinations of several standards are put together for testing as interoperability scenarios, and these scenarios are likely...

    Provided By ETH Zurich

  • White Papers // Jan 2011

    A Fast and Key-Efficient Reduction of Chosen- Ciphertext to Known-Plaintext Security

    Motivated by the quest for reducing assumptions in security proofs in cryptography, this paper is concerned with designing efficient symmetric encryption and authentication schemes based on any weak PseudoRandom Function (PRF) which can be much more efficiently implemented than PRFs. Damgard and Nielsen (CRYPTO '02) have shown how to construct...

    Provided By ETH Zurich

  • White Papers // Jan 2011

    Luby-Rackoff Ciphers from Weak Round Functions?

    The Feistel-network is a popular structure underlying many block-ciphers where the cipher is constructed from many simpler rounds, each defined by some function which is derived from the secret key. Luby and Racko showed that the three-round Feistel-network - each round instantiated with a pseudorandom function secure against adaptive Chosen...

    Provided By ETH Zurich

  • White Papers // Apr 2011

    Multicore OS Benchmarks: We Can Do Better

    Current multicore OS benchmarks do not provide workloads that sufficiently reflect real-world use: they typically run a single application, whereas real workloads consist of multiple concurrent programs. In this paper the authors show that this lack of mixed workloads leads to benchmarks that do not fully exercise the OS and...

    Provided By ETH Zurich

  • White Papers // Jan 2011

    SwissBox: An Architecture for Data Processing Appliances

    Database appliances offer fully integrated hardware, storage, operating system, database, and related software in a single package. Database appliances have a relatively long history but the advent of multicore architectures and cloud computing have facilitated and accelerated the demand for such integrated solutions. Database appliances represent a significant departure from...

    Provided By ETH Zurich

  • White Papers // Jun 2011

    Equilibrium With Exponential Utility And Non-negative Consumption

    The authors study a multi-period Arrow-Debreu equilibrium in a heterogeneous economy populated by agents trading in a complete market. Each agent is represented by an exponential utility function, where additionally no negative level of consumption is permitted. They derive an explicit formula for the optimal consumption policies involving a put...

    Provided By ETH Zurich

  • White Papers // Jun 2011

    Additive Habit Formation: Consumption In Incomplete Markets With Random Endowments

    The authors provide a detailed characterization of the optimal consumption stream for the additive habit-forming utility maximization problem, in a framework of general discrete-time incomplete markets and random endowments. This characterization allows them to derive the monotonicity and concavity of the optimal consumption as a function of wealth, for several...

    Provided By ETH Zurich

  • White Papers // Mar 2011

    Conservative Delta Hedging Under Transaction Costs

    Explicit robust hedging strategies for convex or concave payoffs under a continuous semimartingale model with uncertainty and small transaction costs are constructed. In an asymptotic sense, the upper and lower bounds of the cumulative volatility enable us to super-hedge convex and concave payoffs respectively. The idea is a combination of...

    Provided By ETH Zurich

  • White Papers // Mar 2011

    Hedging Of Game Options With The Presence Of Transaction Costs

    The authors study the problem of super - replication for game options under proportional transaction costs. They consider a multidimensional model which is an extension of the usual Black - Scholes (BS) model, in the sense that the volatility is a progressively measurable function of the stock. For this case...

    Provided By ETH Zurich

  • White Papers // Nov 2010

    Inferring Fundamental Value And Crash Nonlinearity From Bubble Calibration

    Identifying unambiguously the presence of a bubble in an asset price remains an unsolved problem in standard econometric and financial economic approaches. A large part of the problem is that the fundamental value of an asset is, in general, not directly observable and it is poorly constrained to calculate. Further,...

    Provided By ETH Zurich

  • White Papers // Nov 2010

    Superhedging And Dynamic Risk Measures Under Volatility Uncertainty

    The authors consider dynamic sublinear expectations (i.e., time-consistent coherent risk measures) whose scenario sets consist of singular measures corresponding to a general form of volatility uncertainty. They derive a c?dl?g nonlinear martingale which is also the value process of a superhedging problem. The superhedging strategy is obtained from a representation...

    Provided By ETH Zurich

  • White Papers // Nov 2010

    Censored Gamma Regression Models For Limited Dependent Variables With An Application To Loss Given Default

    Regression models for limited continuous dependent variables having a non-negligible probability of attaining exactly their limits are presented. The models differ in the number of parameters and in their flexibility. It is shown how to fit these models and they are applied to a Loss Given Default dataset from insurance...

    Provided By ETH Zurich

  • White Papers // Nov 2009

    Simulation and Emulation of MIMO Wireless Baseband Transceivers

    The development of state-of-the-art wireless communication transceivers in semiconductor technology is a challenging process due to complexity and stringent requirements of modern communication standards such as IEEE 802.11n. This paper describes a complete design, verification, and performance characterization methodology that is tailored to the needs of the development of state-of-the-art...

    Provided By ETH Zurich

  • White Papers // May 2011

    DISSense: An Adaptive Ultralow-Power Communication Protocol for Wireless Sensor Networks

    This paper presents DISSense, an adaptive, ultralow-power communication protocol for wireless sensor networks. DISSense is specifically designed for long-term environmental monitoring applications and it provides for both data collection and data dissemination services. By automatically adapting the length of its active phases, DISSense can guarantee for both a very low...

    Provided By ETH Zurich

  • White Papers // Apr 2011

    Compiling Business Process Models for Sensor Networks

    Wireless sensor networks are increasingly being used to improve business processes. The behavior of such a process is usually captured in models while its implementation is typically created manually. Besides being expensive, this paper entails deviations between the model and the implementation of a business process, thus rendering it less...

    Provided By ETH Zurich

  • White Papers // Jun 2011

    Demo Abstract: Human-CoAP Interaction With Copper

    The authors introduce 'Copper,' a generic browser for the Internet of Things based on the Constrained Application Protocol (CoAP). Current estimates foresee that the number of networked embedded devices encompassed by the Internet of Things will be vast. Additionally, most systems will be optimized for the constrained environment with its...

    Provided By ETH Zurich

  • White Papers // Mar 2011

    Opportunistic Sensing for Smart Heating Control in Private Households

    This position paper provides qualitative considerations on the design and implementation of a smart heating control system for private households. The authors envision the system to rely on the opportunistic exploitation of information made available by existing smart devices. Since heating represents the major source of energy consumption in domestic...

    Provided By ETH Zurich

  • White Papers // Jan 2011

    Balancing Load in Stream Processing With the Cloud

    Stream processing systems must handle stream data coming from real-time, high-throughput applications, for example in financial trading. Timely processing of streams is important and requires sufficient available resources to achieve high throughput and deliver accurate results. However, static allocation of stream processing resources in terms of machines is inefficient when...

    Provided By ETH Zurich

  • White Papers // Dec 2010

    The Impact of Network Topology on Collection Performance

    The network topology has a significant impact on the performance of collection protocols in wireless sensor networks. In this paper, the authors introduce an unobtrusive methodology to quantify the impact of the topology on the performance of collection protocols. Specifically, they propose a protocol-independent metric, the Expected Network Delivery, that...

    Provided By ETH Zurich

  • White Papers // Oct 2010

    Using Adaptive Sensor Ranking to Reduce the Overhead of the Coverage Configuration Protocol

    Several application scenarios of wireless sensor networks require coverage of a given region of interest to be guaranteed. In order to establish a coverage preserving configuration, sensor nodes must coordinate and thus invest precious energy resources for both computation and communication. Reducing this overhead is particularly important in applications requiring...

    Provided By ETH Zurich

  • White Papers // Dec 2008

    Realistic Failures in Secure Multi-Party Computation

    In secure multi-party computation, the different ways in which the adversary can control the corrupted players are described by different corruption types. The three most common corruption types are active corruption (the adversary has full control over the corrupted player), passive corruption (the adversary sees what the corrupted player sees)...

    Provided By ETH Zurich

  • White Papers // Nov 2007

    Perfectly-Secure MPC with Linear Communication Complexity

    Secure Multi-Party Computation (MPC) enables a set of n players to securely evaluate an agreed function even when t of the players is corrupted by a central adversary. A passive adversary can read the internal state of the corrupted players, trying to obtain some information he is not entitled to....

    Provided By ETH Zurich

  • White Papers // Dec 2007

    MPC vs. SFE: Perfect Security in a Unified Corruption Model

    Secure Function Evaluation (SFE) allows a set of players to compute an arbitrary agreed function of their private inputs, even if an adversary may corrupt some of the players. Secure Multi-Party Computation (MPC) is a generalization allowing to perform an arbitrary on-going (also called reactive or stateful) computation during which...

    Provided By ETH Zurich

  • White Papers // Feb 2012

    Attack-Preserving Security Protocol Transformations

    The rigorous incremental development of security protocols has so far received much less attention than protocol verification techniques. In this paper, the authors study security protocol transformations. These can serve both for simplifying protocols before verification and, in the other direction, for developing protocols by stepwise refinement of simple abstract...

    Provided By ETH Zurich

  • White Papers // Mar 2006

    A Proof of Concept Implementation of SSL/TLS Session-Aware User Authentication

    Man-In-The-Middle (MITM) attacks pose a serious threat to SSL/TLS-based e-commerce applications, such as Internet banking. SSL/TLS session-aware user authentication can be used to mitigate the risks and to protect users against MITM attacks in an SSL/TLS setting. In this paper, the authors further delve into SSL/TLS session-aware user authentication and...

    Provided By ETH Zurich

  • White Papers // Feb 2006

    SSL/TLS Session-Aware User Authentication-Or How to Effectively Thwart the Man-in-the-Middle

    Man-in-the-middle attacks pose a serious threat to SSL/TLS based electronic commerce applications, such as Internet banking. In this paper, the authors argue that most deployed user authentication mechanisms fail to provide protection against this type of attack, even when they run on top of SSL/TLS. As a possible countermeasure, they...

    Provided By ETH Zurich

  • White Papers // Jan 2010

    A Novel Parallel QR Algorithm for Hybrid Distributed Memory HPC Systems

    A novel variant of the parallel QR algorithm for solving dense nonsymmetric eigenvalue problems on hybrid distributed High Performance Computing (HPC) systems is presented. For this purpose, the authors introduce the concept of multi-window bulge chain chasing and parallelize aggressive early deflation. The multi-window approach ensures that most computations when...

    Provided By ETH Zurich

  • White Papers // Aug 2007

    Mapping Applications to Tiled Multiprocessor Embedded Systems

    Modern multiprocessor embedded systems execute a large number of tasks on shared processors and handle their complex communications on shared communication networks. Traditional methods from the HW/SW co-design or general purpose computing domain cannot be applied any more to cope with this new class of complex systems. To overcome this...

    Provided By ETH Zurich

  • White Papers // Sep 2003

    STARS - A Ubiquitous Computing Platform for Computer Augmented Tabletop Games

    This presentation paper demonstrates the STARS platform for realizing computer augmented tabletop games within a smart Room ware environment. STARS dynamically couples multiple types of interaction devices such as personal digital assistants or headsets with an interactive game table. STARS augmented tabletop games provide a number of features like dynamic...

    Provided By ETH Zurich

  • White Papers // Jan 2009

    Time Synchronization in Ad Hoc Networks

    Ubiquitous computing environments are typically based upon ad hoc networks of mobile computing devices. These devices may be equipped with sensor hardware to sense the physical environment and may be attached to real world artifacts to form so-called smart things. The data sensed by various smart things can then be...

    Provided By ETH Zurich

  • White Papers // Jun 2008

    Ad-Hoc Wireless Sensor Positioning in Hazardous Areas

    This paper investigates the capability of GNSS aided smart sensor network positioning based on Wireless Local Area Network (WLAN) signals incorporating access points, to monitor 3D deformation associated with volcanic activity and other comparable hazardous events. While a small number of GNSS receivers provide the coordinate and time references, low-cost...

    Provided By ETH Zurich

  • White Papers // Aug 2008

    Flow-Level Characteristics of Spam and Ham

    Despite a large amount of effort devoted in the past years trying to limit unsolicited mail, spam is still a major global concern. Content-analysis techniques and blacklists, the most popular methods used to identify and block spam, are beginning to lose their edge in the battle. They argue here that...

    Provided By ETH Zurich

  • White Papers // Jul 2009

    Federated Stream Processing Support for Real-Time Business Intelligence Applications

    This paper describes the MaxStream federated stream processing architecture to support real-time business intelligence applications. MaxStream builds on and extends the SAP MaxDB relational database system in order to provide a federator over multiple underlying stream processing engines and databases. The paper shows preliminary results on usefulness and performance of...

    Provided By ETH Zurich

  • White Papers // Feb 2009

    Engineering the Cloud From Software Modules

    Cloud computing faces many of the challenges and difficulties of distributed and parallel software. While the service interface hides the actual application from the remote user, the application developer still needs to come to terms with distributed software that needs to run on dynamic clusters and operate under a wide...

    Provided By ETH Zurich

  • White Papers // Jun 2008

    Network Architecture Testbeds as Platforms for Ubiquitous Computing

    Distributed Systems research, and in particular Ubiquitous Computing, has traditionally assumed the Internet as a basic underlying communications substrate. Recently, however, the Networking research community have come to question the fundamental design or "Architecture" of the Internet. This has been led by two observations: firstly, that the Internet as it...

    Provided By ETH Zurich

  • White Papers // May 2010

    Meta-Debugging Pervasive Computers

    As computers get more complex, the task of programming them gets more complex as well. This is especially true for the "Pervasive Computer", which is a massively distributed system consisting of unreliable embedded devices that communicate with each other over lousy wireless links. A common approach to address the programming...

    Provided By ETH Zurich

  • White Papers // Jan 2010

    A Java-Based Framework for Real-Time Control Systems

    This paper presents the Java version of the AOCS Framework. The AOCS Framework is an object-oriented software framework for real-time satellite control systems. It provides a set of design patterns, an adaptable architecture, and a set of configurable components that support the instantiation of satellite control applications. It was originally...

    Provided By ETH Zurich

  • White Papers // Nov 2009

    secuBT: Hacking the Hackers With User-Space Virtualization

    In the age of coordinated malware distribution and zero-day exploits security becomes ever more important. This paper presents secuBT, a safe execution framework for the execution of untrusted binary code based on the fastBT dynamic binary translator. secuBT implements user-space virtualization using dynamic binary translation and adds a system call...

    Provided By ETH Zurich

  • White Papers // Jan 2011

    Virtualizing Hardware With Multi-Context Recon Gurable Arrays

    In contrast to processors, current reconfigurable devices totally lack programming models that would allow for device independent compilation and forward compatibility. The key to overcome this limitation is hardware virtualization. In this paper, the authors resort to a macro-pipelined execution model to achieve hardware virtualization for data streaming applications. As...

    Provided By ETH Zurich

  • White Papers // Aug 2010

    Performance Evaluation of the Collection Tree Protocol Based on Its Implementation for the Castalia Wireless Sensor Networks Simulator

    Many wireless sensor network applications rely on the availability of a collection service to route data packets towards a sink node. The service is typically accessed through well defined interfaces so as to hide the details of its implementation. Providing for efficient network operation, however, often requires investigating the interplay...

    Provided By ETH Zurich