KTH

Displaying 1-8 of 8 results

  • White Papers // Apr 2011

    A Commitment-Consistent Proof of a Shuffle

    The authors introduce a pre-computation technique that drastically reduces the online computational complexity of mix-nets based on homomorphic cryptosystems. More precisely, the authors show that there is a permutation commitment scheme that allows a mix-server to: commit to a permutation and efficiently prove knowledge of doing so correctly in the...

    Provided By KTH

  • White Papers // Jan 2011

    Cooperative Diversity With Disconnection Constraints and Sleep Discipline for Power Control in Wireless Sensor Networks

    The authors derive a power control policy for a group of sensor nodes that are monitoring a real-time application sensitive to disconnections (outages) of the communication. Specially, they suggest that the sensor nodes perform cooperative diversity while running a sleep discipline. After the description of a detailed model of the...

    Provided By KTH

  • White Papers // Jan 2011

    Performance Analysis of Collaborative Spatio-Temporal Processing for Wireless Sensor Networks

    Spatio-Temporal Processing (STP) is a control technique to increase the quality of the received signals in wireless networks. Outage events have a strong influence not only on the performance of the physical layer, but also on routing, MAC, and application layers. In this paper, the authors propose an outage based...

    Provided By KTH

  • White Papers // Dec 2010

    A Proof Carrying Code Framework for Inlined Reference Monitors in Java Bytecode

    The authors propose a light-weight approach for certification of monitor inlining for sequential Java bytecode using proof-carrying code. The goal is to enable the use of monitoring for quality assurance at development time, while minimizing the need for post-shipping code rewrites as well as changes to the end-host TCB. Standard...

    Provided By KTH

  • White Papers // Nov 2010

    FPGA-Based Particle Recognition in the HADES Experiment

    Modern FPGA technologies are often employed in nuclear and particle physics experimental facilities to accelerate application-specific computation. The authors present the particle recognition computation for the HADES experiment in this paper. The algorithms of particle track reconstruction and Cherenkov ring recognition are introduced in the context of concrete particle detectors....

    Provided By KTH

  • White Papers // Sep 2010

    Adaptive Relaying Strategies for Collaborative Spectrum Sensing

    The authors analyze and compare the performance of two adaptive relaying schemes based on the amplify-and-forward and the decode-and-forward protocols which are employed to improve the performance of collaborative spectrum sensing. As their results show, the proposed schemes allow one to improve the reliability of the communication part of the...

    Provided By KTH

  • White Papers // Sep 2009

    Mobile Payments Through Near Field Communication

    This paper has been assigned to Stockholm School of Economics. The purpose of this paper has been to give a second opinion regarding the possibilities of m-payments through NFC and the barriers to overcome to make this a reality. Today there is an enormous amount of research done on the...

    Provided By KTH

  • White Papers // Aug 2008

    A Low-Signalling Scheme for Distributed Resource Allocation in Multi-Cellular OFDMA Systems

    In this paper, the authors consider distributed protocol design for joint sub-carrier, transmission scheduling and power management in uplink/downlink multi-cellular OFDMA wireless networks. The optimal solution to this problem is hard to achieve, both in theory and in practice. They propose a fully decentralized resource allocation scheme combining decomposition methods...

    Provided By KTH

  • White Papers // Nov 2010

    FPGA-Based Particle Recognition in the HADES Experiment

    Modern FPGA technologies are often employed in nuclear and particle physics experimental facilities to accelerate application-specific computation. The authors present the particle recognition computation for the HADES experiment in this paper. The algorithms of particle track reconstruction and Cherenkov ring recognition are introduced in the context of concrete particle detectors....

    Provided By KTH

  • White Papers // Sep 2010

    Adaptive Relaying Strategies for Collaborative Spectrum Sensing

    The authors analyze and compare the performance of two adaptive relaying schemes based on the amplify-and-forward and the decode-and-forward protocols which are employed to improve the performance of collaborative spectrum sensing. As their results show, the proposed schemes allow one to improve the reliability of the communication part of the...

    Provided By KTH

  • White Papers // Aug 2008

    A Low-Signalling Scheme for Distributed Resource Allocation in Multi-Cellular OFDMA Systems

    In this paper, the authors consider distributed protocol design for joint sub-carrier, transmission scheduling and power management in uplink/downlink multi-cellular OFDMA wireless networks. The optimal solution to this problem is hard to achieve, both in theory and in practice. They propose a fully decentralized resource allocation scheme combining decomposition methods...

    Provided By KTH

  • White Papers // Sep 2009

    Mobile Payments Through Near Field Communication

    This paper has been assigned to Stockholm School of Economics. The purpose of this paper has been to give a second opinion regarding the possibilities of m-payments through NFC and the barriers to overcome to make this a reality. Today there is an enormous amount of research done on the...

    Provided By KTH

  • White Papers // Dec 2010

    A Proof Carrying Code Framework for Inlined Reference Monitors in Java Bytecode

    The authors propose a light-weight approach for certification of monitor inlining for sequential Java bytecode using proof-carrying code. The goal is to enable the use of monitoring for quality assurance at development time, while minimizing the need for post-shipping code rewrites as well as changes to the end-host TCB. Standard...

    Provided By KTH

  • White Papers // Apr 2011

    A Commitment-Consistent Proof of a Shuffle

    The authors introduce a pre-computation technique that drastically reduces the online computational complexity of mix-nets based on homomorphic cryptosystems. More precisely, the authors show that there is a permutation commitment scheme that allows a mix-server to: commit to a permutation and efficiently prove knowledge of doing so correctly in the...

    Provided By KTH

  • White Papers // Jan 2011

    Cooperative Diversity With Disconnection Constraints and Sleep Discipline for Power Control in Wireless Sensor Networks

    The authors derive a power control policy for a group of sensor nodes that are monitoring a real-time application sensitive to disconnections (outages) of the communication. Specially, they suggest that the sensor nodes perform cooperative diversity while running a sleep discipline. After the description of a detailed model of the...

    Provided By KTH

  • White Papers // Jan 2011

    Performance Analysis of Collaborative Spatio-Temporal Processing for Wireless Sensor Networks

    Spatio-Temporal Processing (STP) is a control technique to increase the quality of the received signals in wireless networks. Outage events have a strong influence not only on the performance of the physical layer, but also on routing, MAC, and application layers. In this paper, the authors propose an outage based...

    Provided By KTH