Skip to main content
Conference ProceedingsOPEN ACCESS

Secure delegation of elliptic-curve pairing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 6035 LNCS 24-35
DOI: 10.1007/978-3-642-12510-2_3
89Citations
Citations of this article
40Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper we describe a simple protocol for secure delegation of the elliptic-curve pairing. 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 A and B, and 2) the limited device is able to detect when the powerful device is cheating. © IFIP International Federation for Information Processing 2010.

Author supplied keywords

Cite

CITATION STYLE

APA

Chevallier-Mames, B., Coron, J. S., McCullagh, N., Naccache, D., & Scott, M. (2010). Secure delegation of elliptic-curve pairing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6035 LNCS, pp. 24–35). https://doi.org/10.1007/978-3-642-12510-2_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free