University of Chile

Displaying 1-8 of 8 results

  • White Papers // Dec 2012

    A Simple Provably Secure Key Exchange Scheme Based on the Learning with Errors Problem

    The authors use a variant of Learning With Errors (LWE) problem, a simple and direct extension of the original LWE problem to the case of a small secret, which they call a Small LWE problem (SLWE), to build a new simple and provably secure key exchange scheme. The basic idea...

    Provided By University of Chile

  • White Papers // May 2012

    Lifetime Optimization of Wireless Sensor Networks With Packet Propagation Table

    In this paper, the authors explore two specific wireless sensor network applications of environmental monitoring and motion capturing, where the traditional methods of energy balanced data propagation are not ideally suited. These solutions are either too generic to exploit the specific characteristic of their application or are too complex to...

    Provided By University of Chile

  • White Papers // May 2012

    Murco: An Opportunistic Network Coding Framework in Multi-Radio Networks

    In this paper, the authors introduce a new framework for network coding in a multi-radio multi-channel wireless mesh network. Their proposed protocol called Murco, is the first practical work in this area that embraces a distributed solution of network coding in a multi-radio multi-channel network. Murco has been fully implemented...

    Provided By University of Chile

  • White Papers // Jun 2011

    Inverting HFE Systems is Quasi-polynomial for All Fields

    The security of cryptosystems such as RSA, ECC, and Diffie-Hellman key exchange scheme, depends on assumptions about the hardness of certain number theory problems, such as the integer prime factorization problem or the discrete logarithm problem. However, the researchers showed that quantum computers could break all public key cryptosystems that...

    Provided By University of Chile

  • White Papers // Mar 2011

    AspectMaps: A Scalable Visualization of Join Point Shadows

    When using Aspect-Oriented Programming, it is sometimes difficult to determine at which join point an aspect executes. Similarly, when considering one join point, knowing which aspects will execute there and in what order is non-trivial. This makes it difficult to understand how the application will behave. A number of visualizations...

    Provided By University of Chile

  • White Papers // Mar 2010

    Visualizing Dynamic Metrics with Profiling Blueprints

    Service Oriented Architecture (SOA) practitioners wanting to leverage IHE profiles in implementations can benefit from this paper, which assumes that the reader already has a good understanding of basic principles of the design and service-orientation of SOA. It offers a range of discussions on broader topics for readers looking to...

    Provided By University of Chile

  • White Papers // Dec 2009

    On the Impossibility of Batch Update for Cryptographic Accumulators

    A cryptographic accumulator is a scheme where a set of elements is represented by a single short value. This value, along with another value called witness allows to prove membership into the set. In their survey on accumulators [FN02], Fazzio and Nicolisi noted that the Camenisch and Lysyanskaya's construction[CL02] was...

    Provided By University of Chile

  • White Papers // Oct 2009

    Diffusion Based Distributed Internet Gateway Load Balancing in a Wireless Mesh Network

    In a Wireless Mesh Network (WMN), Mesh Clients (MCs) access the Internet through the wireless backbone formed by the Internet GateWays (IGWs) and Mesh Routers (MRs). An IGW as the traffic center may easily become the congestion center in a WMN. The load balancing between IGWs will reduce the traffic...

    Provided By University of Chile

  • White Papers // Dec 2012

    A Simple Provably Secure Key Exchange Scheme Based on the Learning with Errors Problem

    The authors use a variant of Learning With Errors (LWE) problem, a simple and direct extension of the original LWE problem to the case of a small secret, which they call a Small LWE problem (SLWE), to build a new simple and provably secure key exchange scheme. The basic idea...

    Provided By University of Chile

  • White Papers // Oct 2009

    Diffusion Based Distributed Internet Gateway Load Balancing in a Wireless Mesh Network

    In a Wireless Mesh Network (WMN), Mesh Clients (MCs) access the Internet through the wireless backbone formed by the Internet GateWays (IGWs) and Mesh Routers (MRs). An IGW as the traffic center may easily become the congestion center in a WMN. The load balancing between IGWs will reduce the traffic...

    Provided By University of Chile

  • White Papers // Mar 2010

    Visualizing Dynamic Metrics with Profiling Blueprints

    Service Oriented Architecture (SOA) practitioners wanting to leverage IHE profiles in implementations can benefit from this paper, which assumes that the reader already has a good understanding of basic principles of the design and service-orientation of SOA. It offers a range of discussions on broader topics for readers looking to...

    Provided By University of Chile

  • White Papers // Dec 2009

    On the Impossibility of Batch Update for Cryptographic Accumulators

    A cryptographic accumulator is a scheme where a set of elements is represented by a single short value. This value, along with another value called witness allows to prove membership into the set. In their survey on accumulators [FN02], Fazzio and Nicolisi noted that the Camenisch and Lysyanskaya's construction[CL02] was...

    Provided By University of Chile

  • White Papers // Mar 2011

    AspectMaps: A Scalable Visualization of Join Point Shadows

    When using Aspect-Oriented Programming, it is sometimes difficult to determine at which join point an aspect executes. Similarly, when considering one join point, knowing which aspects will execute there and in what order is non-trivial. This makes it difficult to understand how the application will behave. A number of visualizations...

    Provided By University of Chile

  • White Papers // May 2012

    Lifetime Optimization of Wireless Sensor Networks With Packet Propagation Table

    In this paper, the authors explore two specific wireless sensor network applications of environmental monitoring and motion capturing, where the traditional methods of energy balanced data propagation are not ideally suited. These solutions are either too generic to exploit the specific characteristic of their application or are too complex to...

    Provided By University of Chile

  • White Papers // May 2012

    Murco: An Opportunistic Network Coding Framework in Multi-Radio Networks

    In this paper, the authors introduce a new framework for network coding in a multi-radio multi-channel wireless mesh network. Their proposed protocol called Murco, is the first practical work in this area that embraces a distributed solution of network coding in a multi-radio multi-channel network. Murco has been fully implemented...

    Provided By University of Chile

  • White Papers // Jun 2011

    Inverting HFE Systems is Quasi-polynomial for All Fields

    The security of cryptosystems such as RSA, ECC, and Diffie-Hellman key exchange scheme, depends on assumptions about the hardness of certain number theory problems, such as the integer prime factorization problem or the discrete logarithm problem. However, the researchers showed that quantum computers could break all public key cryptosystems that...

    Provided By University of Chile