| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Algorithms for Outsourcing Pairing Computation
Algorithms for Outsourcing Pairing Computation
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.
Cited literature [17 references]
https://hal.inria.fr/hal-01084550
Contributor : Aurore Guillevic <>
Submitted on : Wednesday, May 13, 2020 - 1:48:04 PM
Last modification on : Saturday, October 10, 2020 - 3:25:17 AM
Contributor : Aurore Guillevic <>
Submitted on : Wednesday, May 13, 2020 - 1:48:04 PM
Last modification on : Saturday, October 10, 2020 - 3:25:17 AM
File
OutsourcingPairingComputation....
Files produced by the author(s)