Aarhus University

Displaying 1-40 of 54 results

  • White Papers // Nov 2013

    Fast and Maliciously Secure Two-Party Computation Using the GPU

    The authors describe, and implement, a maliciously secure protocol for two-party computation in a parallel computational model. The protocol is based on cut-and-choose of Yao's garbled circuit and an efficient oblivious transfer extension. The implementation is done using CUDA and yields fast results in a financially feasible and practical setting...

    Provided By Aarhus University

  • White Papers // Nov 2013

    Discriminative Features for Identifying and Interpreting Outliers

    The authors consider the problem of outlier detection and interpretation. While most existing studies focus on the first problem, they simultaneously address the equally important challenge of outlier interpretation. They propose an algorithm that uncovers outliers in subspaces of reduced dimensionality in which they are well discriminated from regular objects...

    Provided By Aarhus University

  • White Papers // Oct 2013

    Bounded Tamper Resilience: How to Go Beyond the Algebraic Barrier

    Related Key Attacks (RKAs) are powerful cryptanalytic attacks where an adversary can change the secret key and observe the effect of such changes at the output. The state of the art in RKA security protects against an a-priori unbounded number of certain algebraic induced key relations, e.g., affine functions or...

    Provided By Aarhus University

  • White Papers // Sep 2013

    Secure Key Management in the Cloud

    The authors consider applications involving a number of servers in the cloud that go through a sequence of online periods where the servers communicate, separated by offline periods where the servers are idle. During the offline periods, they assume that the servers need to securely store sensitive information such as...

    Provided By Aarhus University

  • White Papers // May 2013

    Unconditionally Secure and Universally Composable Commitments from Physical Assumptions

    The authors present a constant-round unconditional black-box compiler that transforms any ideal (i.e., statistically-hiding and statistically-binding) straight-line extractable commitment scheme, into an extractable and equivocal commitment scheme, therefore yielding to UC-security. They exemplify the usefulness of their compiler by providing two (constant-round) instantiations of ideal straight-line extractable commitment based on...

    Provided By Aarhus University

  • White Papers // May 2013

    Universally Composable Symbolic Analysis for Two-Party Protocols based on Homomorphic Encryption

    The authors consider a class of two-party function evaluation protocols in which the parties are allowed to use ideal functionalities as well as a set of powerful primitives, namely commitments, homomorphic encryption, and certain zero-knowledge proofs. They illustrate that with these it is possible to capture protocols for oblivious transfer,...

    Provided By Aarhus University

  • White Papers // Jan 2013

    Theory and Practice of a Leakage Resilient Masking Scheme

    A recent trend in cryptography is to formally prove the leakage resilience of cryptographic implementations - that is, one formally shows that a scheme remains provably secure even in the presence of side channel leakage. Although many of the proposed schemes are secure in a surprisingly strong model, most of...

    Provided By Aarhus University

  • White Papers // Dec 2012

    Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing

    The authors present a protocol for securely computing a Boolean circuit C in presence of a dishonest and malicious majority. The protocol is unconditionally secure, assuming a preprocessing functionality that is not given the inputs. For a large number of players the work for each player is the same as...

    Provided By Aarhus University

  • White Papers // Dec 2012

    Is Public-Key Encryption Based on LPN Practical?

    LPN samples are computationally very simple to generate, but the problem nevertheless seems to be very hard. The two main types of non-trivial attack on LPN are exhaustive search over possible error vectors, and the Blum-Kalai-Wasserman (BKW) algorithm. The authors conduct a practically oriented study of the cryptosystem suggested by...

    Provided By Aarhus University

  • White Papers // Nov 2012

    Practical Covertly Secure MPC for Dishonest Majority - or: Breaking the SPDZ Limits

    SPDZ (pronounced "Speedz") is the nickname of the MPC protocol of Damgard et al. from Crypto 2012. SPDZ provided various efficiency innovations on both the theoretical and practical sides compared to previous work in the preprocessing model. In this paper, the authors resolve a number of open problems with SPDZ;...

    Provided By Aarhus University

  • White Papers // Sep 2012

    Secret Sharing and Secure Computing from Monotone Formulae

    The authors present a construction of log-depth formulae for various threshold functions based on atomic threshold gates of constant size. From this, they build a new family of linear secret sharing schemes that are multiplicative, scale well as the number of players increases and allows to raise a shared value...

    Provided By Aarhus University

  • White Papers // Aug 2012

    Organizational Dynamics and Ambiguity of Business Intelligence in Context of Enterprise Information Systems - A Case Study

    Business Intelligence (BI) is playing a major role in most Enterprise Information Systems (EIS) architectures providing strategic and tactical management information on selected issues. BI is typically detached from mainstream transaction systems and provides a translated view of the business with high ranking executives as key audience. BI has as...

    Provided By Aarhus University

  • White Papers // Jul 2012

    Bio-Inspired Low-Complexity Clustering in Large-Scale Dense Wireless Sensor Networks

    To enhance network scalability and increase network lifetime in large-scale Wireless Sensor Networks (WSNs), clustering has been recognized as an effective solution for hierarchical routing, topology control and data aggregation. Inspired by the collective behavior of flocks and schools, the authors propose a Bio-inspired self-organizing Low-Complexity Clustering (B-LCC) algorithm for...

    Provided By Aarhus University

  • White Papers // Jun 2012

    Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions

    The authors construct zero-knowledge Proofs of Plaintext Knowledge (PoPK) and correct multiplication (PoPC) for the Regev encryption scheme with low amortized communication complexity. Previous constructions of both PoPK and PoPC had communication cost linear in the size of the public key (roughly quadratic in the lattice dimension, ignoring logarithmic factors)....

    Provided By Aarhus University

  • White Papers // Jun 2012

    Reactive Virtual Coordinate Routing Protocol for Body Sensor Networks

    To support reliable real-time applications in Body Sensor Networks (BSNs), it is necessary to develop an efficient and robust routing protocol. However, it is challenging due to the specific radio propagation characteristics, dynamic network topology, variable link quality caused by body movements or environments, extremely low transmission power and limited...

    Provided By Aarhus University

  • White Papers // May 2012

    The Impact of Packet Loss Behavior in 802.11g on the Cooperation Gain in Reliable Multicast

    In group-oriented applications for wireless networks, reliable multicast strategies are important in order to efficiently distribute data, e.g. in Wireless Mesh Networks (WMNs) and Mobile Ad-hoc NETworks (MANETs). To ensure that developed protocols and systems will operate as expected when deployed in the wild, a good understanding of several factors...

    Provided By Aarhus University

  • White Papers // Mar 2012

    On Secure Two-Party Integer Division

    Secure Multi-Party Computation (MPC) allows two or more mutually mistrusting parties to evaluate a function on private data without revealing additional information. Many potential applications are motivated by business needs, e.g., running auctions where no-one gains any information on non-winning bids, or basing decisions on aggregate data from multiple sources....

    Provided By Aarhus University

  • White Papers // Jan 2012

    Signature Schemes Secure Against Hard-to-Invert Leakage

    In the auxiliary input model an adversary is allowed to see a computationally hard-to-invert function of the secret key. The auxiliary input model weakens the bounded leakage assumption commonly made in leakage resilient cryptography as the hard-to-invert function may information-theoretically reveal the entire secret key. In this paper, the authors...

    Provided By Aarhus University

  • White Papers // Oct 2011

    TinyDebug: Multi-Purpose Passive Debugging Framework for Embedded Wireless Systems

    Debugging embedded wireless systems can be cumbersome due to low visibility. To ease the task of debugging this paper present TinyDebug which is a multi-purpose passive debugging framework for developing embedded wireless systems. TinyDebug is designed to be used throughout the entire system development process, ranging from simulation to actual...

    Provided By Aarhus University

  • White Papers // Jul 2011

    MBMS With User Cooperation and Network Coding

    In this paper user cooperation with network coding is applied to MBMS (Multimedia Broadcast/Multicast Service) where Raptor codes are currently used. User cooperation together with network coding is used to save bandwidth and improve user perceived QoS for broadcast/multicast services in the future mobile communication networks. The proposed approach is...

    Provided By Aarhus University

  • White Papers // Jun 2011

    Load Balancing Metric With Diversity for Energy Efficient Routing in Wireless Sensor Networks

    The Expected number of Transmission (ETX) represents a routing metric that considers the highly variable link qualities for a specific radio in Wireless Sensor Networks (WSNs). To adapt to these differences, radio diversity is a recently explored solution for WSNs. In this paper, the authors propose an energy balancing metric...

    Provided By Aarhus University

  • White Papers // Jun 2011

    On the Communication Complexity of Reliable and Secure Message Transmission in Asynchronous Networks

    In this paper, the authors study the communication complexity of Reliable Message Transmission (RMT) and Secure Message Transmission (SMT) protocols in asynchronous settings. They consider two variants of the problem, namely perfect (where no error is allowed in the protocol outcome) and statistical (where the protocol may output a wrong...

    Provided By Aarhus University

  • White Papers // May 2011

    Leakage Resilient Secure Two-Party Computation

    In the traditional secure function evaluation setting, some set of distrusting parties jointly compute a function of their respective inputs securely which means that the real-life computation should be "Equivalent" to an ideal setting where the parties send inputs to a trusted party that performs the computation and returns its...

    Provided By Aarhus University

  • White Papers // Feb 2011

    Secure Datastructures Based on Multiparty Computation

    The problem of secure multiparty computation - performing some computation based on distributed, private inputs - has been studied intensively for more than twenty years. This paper includes both "One shot" applications as well as reactive tasks, where the exact computation is not known in advance. The authors extend this...

    Provided By Aarhus University

  • White Papers // Feb 2011

    Fully Simulatable Quantum-Secure Coin-Flipping and Applications

    The authors propose a coin-flip protocol which yields a string of strong, random coins and is fully simulatable against poly-sized quantum adversaries on both sides. It can be implemented with quantum-computational security without any set-up assumptions, since the construction only assumes mixed commitment schemes which they show how to construct...

    Provided By Aarhus University

  • White Papers // Jan 2011

    Receiver-Deniable Public-Key Encryption Is Impossible

    A receiver-deniable public-key cryptosystem is a public-key cryptosystem where the receiver can change her secret key as to make it look like a given ciphertext decrypts to some message different from what it really decrypts to. This is a notion introduced to allow to deny a message exchange and hence...

    Provided By Aarhus University

  • White Papers // Nov 2010

    Are Debt Repayment Incentives Undermined By Foreign Aid?

    This paper investigates the effects of inflows of foreign aid on the debt repayment behavior of developing countries. The paper first delineates the overall incentives to committing to timely repayment in a war of attrition-type model. A set of panel estimates including 93 developing countries shows that foreign aid is...

    Provided By Aarhus University

  • White Papers // Oct 2010

    A Note on Zero-Knowledge Proofs of Knowledge and the ZKPOK Ideal Functionality

    In this note, the authors provide a formal proof of the fact that any protocol that is a zero-knowledge proof of knowledge for a relation R is also a secure protocol for the zero-knowledge proof of knowledge functionality, where the latter is defined according to the standard framework of stand-alone...

    Provided By Aarhus University

  • White Papers // Sep 2010

    Testing Selective Transmission With Low Power Listening

    Selective transmission policies allow nodes in a sensor network to autonomously decide between transmitting or discarding packets depending on the importance of the information content and the energetic cost of communications. The potential benefits of these policies depend on the capability of nodes to estimate its current energy consumption patterns....

    Provided By Aarhus University

  • White Papers // Sep 2010

    On Invertible Sampling and Adaptive Security

    Secure Multiparty Computation (MPC) is one of the most general and well studied problems in cryptography. The authors focus on MPC protocols that are required to be secure even when the adversary can adaptively corrupt parties during the protocol, and under the assumption that honest parties cannot reliably erase their...

    Provided By Aarhus University

  • White Papers // Aug 2010

    Start Making Sense Again - Business Relationship Restoration After Severe Norm Violation Episodes

    Relational norms provide behavioural guidelines for individual actors interacting in business relationships. Frequently, norms are violated and the involved actors initiate a normalisation process to restore exchange order. However, in rare instances violations occur with a severity where the exchange cannot be normalised by the means available in the interpersonal...

    Provided By Aarhus University

  • White Papers // Aug 2010

    Enacting Representations Of Markets In Exchange Practices In The Danish Potato Industry

    The paper explores the potential of John Shotter's (2008) relationally-responsive version of social constructionism for studying and analysing representations of markets and how these are enacted in actual exchanges practices. The paper uses the extended case study method to integrate existing concepts and theories using empirical data from the Danish...

    Provided By Aarhus University

  • White Papers // Aug 2010

    The Internal Competitor: Buyer Motives And External Supplier Marketing Strategies

    The purpose of this paper is to identify buyer motives for supporting internal competitors and to suggest relevant marketing strategy elements for external suppliers confronting these internal competitors. With basis in a literature review the authors identify different buyer motives for choosing to combine external suppliers with internal production, i.e.,...

    Provided By Aarhus University

  • White Papers // Aug 2010

    Relationships Between Food Producers And Retailers

    In this paper many of the ideas from the original IMP project are pursued, among these are the idea that the focus is on relationships between buying and selling organizations rather than on isolated events; the idea that both organizations in an interaction are active; and the point of view...

    Provided By Aarhus University

  • White Papers // Jul 2010

    BTP: A Block Transfer Protocol for Delay Tolerant Wireless Sensor Networks

    Wireless sensor networks that are energy-constrained must transmit and receive data as efficiently as possible. If the transmission is delay tolerant, transferring blocks of accumulated data can be more efficient than transferring each sensed measurement as soon as it is available. This paper proposes a Block Transfer Protocol (BTP) designed...

    Provided By Aarhus University

  • White Papers // Jun 2010

    Strategic Planning and Corporate Performance. What Is the Relationship?

    The majority of management literature describes Strategic Planning (SP) as being effective in relation to improving Corporate Performance (CP), but is that assumption correct? Several studies have shown that the relationship is dubious if not non-existent. To clarify the relationship a comprehensive meta-analysis was conducted on 88 individual studies representing...

    Provided By Aarhus University

  • White Papers // May 2010

    Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost

    Multiparty computation protocols have been known for more than twenty years now, but due to their lack of efficiency their use is still limited in real-world applications: the goal of this paper is the design of efficient two and multi party computation protocols aimed to fill the gap between theory...

    Provided By Aarhus University

  • White Papers // May 2010

    Secure Two-Party Quantum Evaluation of Unitaries Against Specious Adversaries

    The authors describe how any two-party quantum computation, specified by a unitary which simultaneously acts on the registers of both parties, can be privately implemented against a quantum version of classical semi-honest adversaries that they call specious. Their construction requires two ideal functionalities to guarantee privacy: a private SWAP between...

    Provided By Aarhus University

  • White Papers // Dec 2009

    Secure Multiparty AES (full Paper)

    In secure Multi Party Computation (MPC), a number of players each supply a private input and then compute an agreed function on these inputs securely, i.e., even if an adversary corrupts some of the players, honest players obtain correct results, and the intended outputs is the only new information released...

    Provided By Aarhus University

  • White Papers // Dec 2009

    Efficient, Robust and Constant-Round Distributed RSA Key Generation

    The idea of distributed key generation is to generate a key in secret shared form among a number players such that it is never available in a single location. Together with a protocol for distributed signatures, for instance, one gets a distributed signature scheme that has no single point of...

    Provided By Aarhus University

  • White Papers // Sep 2010

    Testing Selective Transmission With Low Power Listening

    Selective transmission policies allow nodes in a sensor network to autonomously decide between transmitting or discarding packets depending on the importance of the information content and the energetic cost of communications. The potential benefits of these policies depend on the capability of nodes to estimate its current energy consumption patterns....

    Provided By Aarhus University

  • White Papers // Jul 2010

    BTP: A Block Transfer Protocol for Delay Tolerant Wireless Sensor Networks

    Wireless sensor networks that are energy-constrained must transmit and receive data as efficiently as possible. If the transmission is delay tolerant, transferring blocks of accumulated data can be more efficient than transferring each sensed measurement as soon as it is available. This paper proposes a Block Transfer Protocol (BTP) designed...

    Provided By Aarhus University

  • White Papers // Mar 2009

    Energy Bucket: A Tool for Power Profiling and Debugging of Sensor Nodes

    The ability to precisely measure and compare energy consumption and relate this to particular parts of programs is a recurring theme in sensor network research. This paper presents the Energy Bucket, a low-cost tool designed for quick empirical measurements of energy consumptions across 5 decades of current draw. The Energy...

    Provided By Aarhus University

  • White Papers // Oct 2011

    TinyDebug: Multi-Purpose Passive Debugging Framework for Embedded Wireless Systems

    Debugging embedded wireless systems can be cumbersome due to low visibility. To ease the task of debugging this paper present TinyDebug which is a multi-purpose passive debugging framework for developing embedded wireless systems. TinyDebug is designed to be used throughout the entire system development process, ranging from simulation to actual...

    Provided By Aarhus University

  • White Papers // Aug 2012

    Organizational Dynamics and Ambiguity of Business Intelligence in Context of Enterprise Information Systems - A Case Study

    Business Intelligence (BI) is playing a major role in most Enterprise Information Systems (EIS) architectures providing strategic and tactical management information on selected issues. BI is typically detached from mainstream transaction systems and provides a translated view of the business with high ranking executives as key audience. BI has as...

    Provided By Aarhus University

  • White Papers // Feb 2011

    Secure Datastructures Based on Multiparty Computation

    The problem of secure multiparty computation - performing some computation based on distributed, private inputs - has been studied intensively for more than twenty years. This paper includes both "One shot" applications as well as reactive tasks, where the exact computation is not known in advance. The authors extend this...

    Provided By Aarhus University

  • White Papers // Feb 2011

    Fully Simulatable Quantum-Secure Coin-Flipping and Applications

    The authors propose a coin-flip protocol which yields a string of strong, random coins and is fully simulatable against poly-sized quantum adversaries on both sides. It can be implemented with quantum-computational security without any set-up assumptions, since the construction only assumes mixed commitment schemes which they show how to construct...

    Provided By Aarhus University

  • White Papers // Jan 2011

    Receiver-Deniable Public-Key Encryption Is Impossible

    A receiver-deniable public-key cryptosystem is a public-key cryptosystem where the receiver can change her secret key as to make it look like a given ciphertext decrypts to some message different from what it really decrypts to. This is a notion introduced to allow to deny a message exchange and hence...

    Provided By Aarhus University

  • White Papers // Oct 2010

    A Note on Zero-Knowledge Proofs of Knowledge and the ZKPOK Ideal Functionality

    In this note, the authors provide a formal proof of the fact that any protocol that is a zero-knowledge proof of knowledge for a relation R is also a secure protocol for the zero-knowledge proof of knowledge functionality, where the latter is defined according to the standard framework of stand-alone...

    Provided By Aarhus University

  • White Papers // Dec 2009

    Secure Multiparty AES (full Paper)

    In secure Multi Party Computation (MPC), a number of players each supply a private input and then compute an agreed function on these inputs securely, i.e., even if an adversary corrupts some of the players, honest players obtain correct results, and the intended outputs is the only new information released...

    Provided By Aarhus University

  • White Papers // Aug 2010

    Enacting Representations Of Markets In Exchange Practices In The Danish Potato Industry

    The paper explores the potential of John Shotter's (2008) relationally-responsive version of social constructionism for studying and analysing representations of markets and how these are enacted in actual exchanges practices. The paper uses the extended case study method to integrate existing concepts and theories using empirical data from the Danish...

    Provided By Aarhus University

  • White Papers // Aug 2010

    Start Making Sense Again - Business Relationship Restoration After Severe Norm Violation Episodes

    Relational norms provide behavioural guidelines for individual actors interacting in business relationships. Frequently, norms are violated and the involved actors initiate a normalisation process to restore exchange order. However, in rare instances violations occur with a severity where the exchange cannot be normalised by the means available in the interpersonal...

    Provided By Aarhus University

  • White Papers // Aug 2010

    The Internal Competitor: Buyer Motives And External Supplier Marketing Strategies

    The purpose of this paper is to identify buyer motives for supporting internal competitors and to suggest relevant marketing strategy elements for external suppliers confronting these internal competitors. With basis in a literature review the authors identify different buyer motives for choosing to combine external suppliers with internal production, i.e.,...

    Provided By Aarhus University

  • White Papers // Aug 2010

    Relationships Between Food Producers And Retailers

    In this paper many of the ideas from the original IMP project are pursued, among these are the idea that the focus is on relationships between buying and selling organizations rather than on isolated events; the idea that both organizations in an interaction are active; and the point of view...

    Provided By Aarhus University

  • White Papers // Jun 2011

    On the Communication Complexity of Reliable and Secure Message Transmission in Asynchronous Networks

    In this paper, the authors study the communication complexity of Reliable Message Transmission (RMT) and Secure Message Transmission (SMT) protocols in asynchronous settings. They consider two variants of the problem, namely perfect (where no error is allowed in the protocol outcome) and statistical (where the protocol may output a wrong...

    Provided By Aarhus University

  • White Papers // May 2011

    Leakage Resilient Secure Two-Party Computation

    In the traditional secure function evaluation setting, some set of distrusting parties jointly compute a function of their respective inputs securely which means that the real-life computation should be "Equivalent" to an ideal setting where the parties send inputs to a trusted party that performs the computation and returns its...

    Provided By Aarhus University

  • White Papers // Mar 2009

    Investment, Income, And Incompleteness

    The utility-maximizing consumption and investment strategy of an individual investor receiving an unspanned labor income stream seems impossible to find in closed form and very difficult to find using numerical solution techniques. The authors suggest an easy procedure for finding a specific, simple, and admissible consumption and investment strategy, which...

    Provided By Aarhus University

  • White Papers // Aug 2009

    The Non-Monotonic Effect Of Financing Constraints On Investment

    The authors analyze investment timing in a discrete-time framework with two possible investment dates, which is an extension of the model by Lyandres (2007). They derive an investment threshold that is U-shaped in the firm's liquid funds, a result similar to the in finite-horizon models by Boyle and Guthrie (2003)...

    Provided By Aarhus University

  • White Papers // Nov 2010

    Are Debt Repayment Incentives Undermined By Foreign Aid?

    This paper investigates the effects of inflows of foreign aid on the debt repayment behavior of developing countries. The paper first delineates the overall incentives to committing to timely repayment in a war of attrition-type model. A set of panel estimates including 93 developing countries shows that foreign aid is...

    Provided By Aarhus University

  • White Papers // May 2009

    Type Analysis for JavaScript

    JavaScript is the main scripting language for Web browsers, and it is essential to modern Web applications. Programmers have started using it for writing complex applications, but there is still little tool support available during development. The authors present a static program analysis infrastructure that can infer detailed and sound...

    Provided By Aarhus University

  • White Papers // Mar 2009

    JWIG: Yet Another Framework for Maintainable and Secure Web Applications

    Although numerous frameworks for web application programming have been developed in recent years, writing web applications remains a challenging task. Guided by a collection of classical design principles, the authors propose yet another framework. It is based on a simple but flexible server-oriented architecture that coherently supports general aspects of...

    Provided By Aarhus University

  • White Papers // Jun 2011

    Load Balancing Metric With Diversity for Energy Efficient Routing in Wireless Sensor Networks

    The Expected number of Transmission (ETX) represents a routing metric that considers the highly variable link qualities for a specific radio in Wireless Sensor Networks (WSNs). To adapt to these differences, radio diversity is a recently explored solution for WSNs. In this paper, the authors propose an energy balancing metric...

    Provided By Aarhus University

  • White Papers // Oct 2009

    Simulation of Channel Characteristics for Complex Networks

    In this paper a novel approach to simulate a complex network is presented. In powerline communication the communication channel often comprises of complex networks of conductors, which primary purpose is to supply power. Each of the branches in the network can be modeled by a 2 by 2 transmission matrix....

    Provided By Aarhus University

  • White Papers // Mar 2012

    On Secure Two-Party Integer Division

    Secure Multi-Party Computation (MPC) allows two or more mutually mistrusting parties to evaluate a function on private data without revealing additional information. Many potential applications are motivated by business needs, e.g., running auctions where no-one gains any information on non-winning bids, or basing decisions on aggregate data from multiple sources....

    Provided By Aarhus University

  • White Papers // Jan 2012

    Signature Schemes Secure Against Hard-to-Invert Leakage

    In the auxiliary input model an adversary is allowed to see a computationally hard-to-invert function of the secret key. The auxiliary input model weakens the bounded leakage assumption commonly made in leakage resilient cryptography as the hard-to-invert function may information-theoretically reveal the entire secret key. In this paper, the authors...

    Provided By Aarhus University

  • White Papers // Mar 2009

    J Is for JavaScript: A Direct-Style Correspondence Between Algol-Like Languages and JavaScript Using Rst-Class Continuations

    It is a time-honored fashion to implement a Domain-Specific Language (DSL) by translation to a general-purpose language. Such an implementation is more portable, but an unidiomatic translation jeopardizes performance because, in practice, language implementations favor the common cases. This tension arises especially when the domain calls for complex control structures....

    Provided By Aarhus University

  • White Papers // Jul 2012

    Bio-Inspired Low-Complexity Clustering in Large-Scale Dense Wireless Sensor Networks

    To enhance network scalability and increase network lifetime in large-scale Wireless Sensor Networks (WSNs), clustering has been recognized as an effective solution for hierarchical routing, topology control and data aggregation. Inspired by the collective behavior of flocks and schools, the authors propose a Bio-inspired self-organizing Low-Complexity Clustering (B-LCC) algorithm for...

    Provided By Aarhus University

  • White Papers // May 2012

    The Impact of Packet Loss Behavior in 802.11g on the Cooperation Gain in Reliable Multicast

    In group-oriented applications for wireless networks, reliable multicast strategies are important in order to efficiently distribute data, e.g. in Wireless Mesh Networks (WMNs) and Mobile Ad-hoc NETworks (MANETs). To ensure that developed protocols and systems will operate as expected when deployed in the wild, a good understanding of several factors...

    Provided By Aarhus University

  • White Papers // Jun 2012

    Reactive Virtual Coordinate Routing Protocol for Body Sensor Networks

    To support reliable real-time applications in Body Sensor Networks (BSNs), it is necessary to develop an efficient and robust routing protocol. However, it is challenging due to the specific radio propagation characteristics, dynamic network topology, variable link quality caused by body movements or environments, extremely low transmission power and limited...

    Provided By Aarhus University

  • White Papers // Jul 2011

    MBMS With User Cooperation and Network Coding

    In this paper user cooperation with network coding is applied to MBMS (Multimedia Broadcast/Multicast Service) where Raptor codes are currently used. User cooperation together with network coding is used to save bandwidth and improve user perceived QoS for broadcast/multicast services in the future mobile communication networks. The proposed approach is...

    Provided By Aarhus University

  • White Papers // Dec 2012

    Is Public-Key Encryption Based on LPN Practical?

    LPN samples are computationally very simple to generate, but the problem nevertheless seems to be very hard. The two main types of non-trivial attack on LPN are exhaustive search over possible error vectors, and the Blum-Kalai-Wasserman (BKW) algorithm. The authors conduct a practically oriented study of the cryptosystem suggested by...

    Provided By Aarhus University

  • White Papers // Nov 2012

    Practical Covertly Secure MPC for Dishonest Majority - or: Breaking the SPDZ Limits

    SPDZ (pronounced "Speedz") is the nickname of the MPC protocol of Damgard et al. from Crypto 2012. SPDZ provided various efficiency innovations on both the theoretical and practical sides compared to previous work in the preprocessing model. In this paper, the authors resolve a number of open problems with SPDZ;...

    Provided By Aarhus University

  • White Papers // Sep 2012

    Secret Sharing and Secure Computing from Monotone Formulae

    The authors present a construction of log-depth formulae for various threshold functions based on atomic threshold gates of constant size. From this, they build a new family of linear secret sharing schemes that are multiplicative, scale well as the number of players increases and allows to raise a shared value...

    Provided By Aarhus University

  • White Papers // Dec 2012

    Constant-Overhead Secure Computation of Boolean Circuits using Preprocessing

    The authors present a protocol for securely computing a Boolean circuit C in presence of a dishonest and malicious majority. The protocol is unconditionally secure, assuming a preprocessing functionality that is not given the inputs. For a large number of players the work for each player is the same as...

    Provided By Aarhus University

  • White Papers // Jun 2012

    Zero-Knowledge Proofs with Low Amortized Communication from Lattice Assumptions

    The authors construct zero-knowledge Proofs of Plaintext Knowledge (PoPK) and correct multiplication (PoPC) for the Regev encryption scheme with low amortized communication complexity. Previous constructions of both PoPK and PoPC had communication cost linear in the size of the public key (roughly quadratic in the lattice dimension, ignoring logarithmic factors)....

    Provided By Aarhus University

  • White Papers // May 2013

    Universally Composable Symbolic Analysis for Two-Party Protocols based on Homomorphic Encryption

    The authors consider a class of two-party function evaluation protocols in which the parties are allowed to use ideal functionalities as well as a set of powerful primitives, namely commitments, homomorphic encryption, and certain zero-knowledge proofs. They illustrate that with these it is possible to capture protocols for oblivious transfer,...

    Provided By Aarhus University

  • White Papers // Nov 2013

    Fast and Maliciously Secure Two-Party Computation Using the GPU

    The authors describe, and implement, a maliciously secure protocol for two-party computation in a parallel computational model. The protocol is based on cut-and-choose of Yao's garbled circuit and an efficient oblivious transfer extension. The implementation is done using CUDA and yields fast results in a financially feasible and practical setting...

    Provided By Aarhus University

  • White Papers // May 2013

    Unconditionally Secure and Universally Composable Commitments from Physical Assumptions

    The authors present a constant-round unconditional black-box compiler that transforms any ideal (i.e., statistically-hiding and statistically-binding) straight-line extractable commitment scheme, into an extractable and equivocal commitment scheme, therefore yielding to UC-security. They exemplify the usefulness of their compiler by providing two (constant-round) instantiations of ideal straight-line extractable commitment based on...

    Provided By Aarhus University

  • White Papers // Jan 2013

    Theory and Practice of a Leakage Resilient Masking Scheme

    A recent trend in cryptography is to formally prove the leakage resilience of cryptographic implementations - that is, one formally shows that a scheme remains provably secure even in the presence of side channel leakage. Although many of the proposed schemes are secure in a surprisingly strong model, most of...

    Provided By Aarhus University

  • White Papers // May 2010

    Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost

    Multiparty computation protocols have been known for more than twenty years now, but due to their lack of efficiency their use is still limited in real-world applications: the goal of this paper is the design of efficient two and multi party computation protocols aimed to fill the gap between theory...

    Provided By Aarhus University