Paper 2025/542

That’s AmorE: Amortized Efficiency for Pairing Delegation

Adrian Perez Keilty, Chalmers University of Technology, University of Gothenburg
Diego F. Aranha, Aarhus University
Elena Pagnin, Chalmers University of Technology, University of Gothenburg
Francisco Rodríguez-Henríquez, Technology Innovation Institute, Cinvestav
Abstract

Over two decades since their introduction in 2005, all major verifiable pairing delegation protocols for public inputs have been designed to ensure information-theoretic security. However, we note that a delegation protocol involving only ephemeral secret keys in the public view can achieve everlasting security, provided the server is unable to produce a pairing forgery within the protocol’s execution time. Thus, computationally bounding the adversary’s capabilities during the protocol’s execution, rather than across its entire lifespan, may be more reasonable, especially when the goal is to achieve significant efficiency gains for the delegating party. This consideration is particularly relevant given the continuously evolving computational costs associated with pairing computations and their ancillary blocks, which creates an ever-changing landscape for what constitutes efficiency in pairing delegation protocols. With the goal of fulfilling both efficiency and everlasting security, we present AmorE, a protocol equipped with an adjustable security and efficiency parameter for sequential pairing delegation, which achieves state-of-the-art amortized efficiency in terms of the number of pairing computations. For example, delegating batches of 10 pairings on the BLS48-575 elliptic curve via our protocol costs to the client, on average, less than a single scalar multiplication in G2 per delegated pairing, while still ensuring at least 40 bits of statistical security.

Metadata
Available format(s)
PDF
Category
Cryptographic protocols
Publication info
Preprint.
Keywords
efficiencyimplementationpairing delegation
Contact author(s)
keilty @ chalmers se
dfaranha @ cs au dk
elenap @ chalmers se
francisco @ cs cinvestav mx
History
2025-03-25: approved
2025-03-24: received
See all versions
Short URL
https://ia.cr/2025/542
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2025/542,
      author = {Adrian Perez Keilty and Diego F. Aranha and Elena Pagnin and Francisco Rodríguez-Henríquez},
      title = {That’s {AmorE}: Amortized Efficiency for Pairing Delegation},
      howpublished = {Cryptology {ePrint} Archive, Paper 2025/542},
      year = {2025},
      url = {https://eprint.iacr.org/2025/542}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.