DI-ENS - Département d'informatique de l'École normale supérieure, Inria Paris-Rocquencourt, CNRS - Centre National de la Recherche Scientifique : UMR 8548
Abstract : We address the question of how a computationally limited device may outsource pairing computation in cryptography to another, potentially malicious, but much more computationally powerful device. We introduce two new efficient protocols for securely outsourcing pairing computations to an untrusted helper. The first generic scheme is proven computationally secure (and can be proven statistically secure at the expense of worse performance). It allows various communication-efficiency trade-offs. The second specific scheme -- for optimal Ate pairing on a Barreto-Naehrig curve -- is unconditionally secure, and do not rely on any hardness assumptions. Both protocols are more efficient than the actual computation of the pairing by the restricted device and in particular they are more efficient than all previous proposals.
Marc Joye and Amir Moradi. CARDIS 2014, 13th Smart Card Research and Advanced Application Conference, Nov 2014, Paris, France. Springer, Lecture Notes in Computer Science (LNCS), 2015, 〈http://cedric.cnam.fr/events/cardis/index.html〉
https://hal.inria.fr/hal-01084550
Contributeur : Aurore Guillevic
<>
Soumis le : mercredi 19 novembre 2014 - 14:57:18
Dernière modification le : vendredi 25 mai 2018 - 12:02:05
Aurore Guillevic, Damien Vergnaud. Algorithms for Outsourcing Pairing Computation. Marc Joye and Amir Moradi. CARDIS 2014, 13th Smart Card Research and Advanced Application Conference, Nov 2014, Paris, France. Springer, Lecture Notes in Computer Science (LNCS), 2015, 〈http://cedric.cnam.fr/events/cardis/index.html〉. 〈hal-01084550〉
