Universite de Moncton

Displaying 1-5 of 5 results

  • White Papers // Sep 2013

    Constant-Round Secure Two-Party Computation from a Linear Number of Oblivious Transfer

    The authors construct a protocol for constant round two-party secure function evaluation in the standard model which improves previous protocols in several ways. They are able to reduce the number of calls to oblivious transfer by a factor proportional to the security parameter. In addition to being more efficient than...

    Provided By Universite de Moncton

  • White Papers // Apr 2010

    A Graphical User Interface Simulator for Wireless Sensor Networks Lifetime Estimation

    The deployment of wireless sensor networks is highly dependent on the given application. In fact it depends on the environment characteristics, the available budget and the type and desired quality of service. Since making real tests is most of the times costly and time consuming, researchers and developers usually use...

    Provided By Universite de Moncton

  • White Papers // Aug 2009

    Network Coding: Literature Review

    Communication networks are a prevalent component of the modern connected times. Everywhere around the people and machines exchange information at various scales and throughputs. The network is everywhere: from the analog voice communication that the phone company offers to the vast expanse of connectedness built upon TCP/IP passing by all...

    Provided By Universite de Moncton

  • White Papers // Aug 2009

    Online Collaborative Learning System Using Speech Technology

    A Web-based learning tool, the Learn IN Context (LINC) system, designed and being used in some institution's courses in mixed-mode learning, is presented in this paper. This mode combines face-to-face and distance approaches to education. LINC can achieve both collaborative and competitive learning. In order to provide both learners and...

    Provided By Universite de Moncton

  • White Papers // Jun 2009

    Security of the Bennett-Brassard Quantum Key Distribution Protocol against Collective Attacks

    The theoretical quantum key-distribution scheme of Bennett and Brassard (BB84) has been proven secure against very strong attacks including the collective attacks and the joint attacks. Though the latter are the most general attacks, collective attacks are much easier to analyze, yet, they are conjectured to be as informative to...

    Provided By Universite de Moncton

  • White Papers // Aug 2009

    Online Collaborative Learning System Using Speech Technology

    A Web-based learning tool, the Learn IN Context (LINC) system, designed and being used in some institution's courses in mixed-mode learning, is presented in this paper. This mode combines face-to-face and distance approaches to education. LINC can achieve both collaborative and competitive learning. In order to provide both learners and...

    Provided By Universite de Moncton

  • White Papers // Apr 2010

    A Graphical User Interface Simulator for Wireless Sensor Networks Lifetime Estimation

    The deployment of wireless sensor networks is highly dependent on the given application. In fact it depends on the environment characteristics, the available budget and the type and desired quality of service. Since making real tests is most of the times costly and time consuming, researchers and developers usually use...

    Provided By Universite de Moncton

  • White Papers // Aug 2009

    Network Coding: Literature Review

    Communication networks are a prevalent component of the modern connected times. Everywhere around the people and machines exchange information at various scales and throughputs. The network is everywhere: from the analog voice communication that the phone company offers to the vast expanse of connectedness built upon TCP/IP passing by all...

    Provided By Universite de Moncton

  • White Papers // Jun 2009

    Security of the Bennett-Brassard Quantum Key Distribution Protocol against Collective Attacks

    The theoretical quantum key-distribution scheme of Bennett and Brassard (BB84) has been proven secure against very strong attacks including the collective attacks and the joint attacks. Though the latter are the most general attacks, collective attacks are much easier to analyze, yet, they are conjectured to be as informative to...

    Provided By Universite de Moncton

  • White Papers // Sep 2013

    Constant-Round Secure Two-Party Computation from a Linear Number of Oblivious Transfer

    The authors construct a protocol for constant round two-party secure function evaluation in the standard model which improves previous protocols in several ways. They are able to reduce the number of calls to oblivious transfer by a factor proportional to the security parameter. In addition to being more efficient than...

    Provided By Universite de Moncton