[Resource Topic] 2005/150: Secure Delegation of Elliptic-Curve Pairing

Resource Cryptographic protocols
#1

Welcome to the resource topic for 2005/150

Title:
Secure Delegation of Elliptic-Curve Pairing

Authors: Benoit Chevallier-Mames, Jean-Sebastien Coron, Noel McCullagh, David Naccache, Michael Scott

Abstract:

In this paper we describe a simple protocol for securely delegating
elliptic-curve pairings. A computationally limited device (typically
a smart-card) will delegate the computation of the pairing e(A,B) to a
more powerful device (for example a PC), in such a way that:

  1. the powerful device learns nothing about the points being paired (A
    and B), nor about the pairing’s result e(A,B),
  2. and the limited device is able to detect when the powerful device is cheating.

We also describe more efficient variants of our protocol when one of
the points or both are already known, and further efficiency gains when constant points are used.

ePrint: https://eprint.iacr.org/2005/150

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .