LOVE a Pairing
Aranha, Diego ; Pagnin, Elena LU
and Hernàndez-Rodriguez, Francisco
(2021)
7th International Conference on Cryptology and Information Security in Latin America, LATINCRYPT 2021
In Lecture Notes in Computer Science
12912.
p.320-340
- Abstract
- The problem of securely outsourcing the computation of a bilinear pairing has been widely investigated in the literature. Designing an efficient protocol with the desired functionality has, however, been an open challenge for a long time. Recently, Di Crescenzo et al. (CARDIS’20) proposed the first suite of protocols for securely and efficiently delegating pairings with online inputs under the presence of a malicious server. We progress along this path with the aim of LOVE (Lowering the cost of Outsourcing and Verifying Efficiently) a pairing. Our contributions are threefold. First, we propose a protocol (LOVE) that improves the efficiency of Di Crescenzo et al.’s proposal for securely delegating pairings with online, public inputs.... (More)
- The problem of securely outsourcing the computation of a bilinear pairing has been widely investigated in the literature. Designing an efficient protocol with the desired functionality has, however, been an open challenge for a long time. Recently, Di Crescenzo et al. (CARDIS’20) proposed the first suite of protocols for securely and efficiently delegating pairings with online inputs under the presence of a malicious server. We progress along this path with the aim of LOVE (Lowering the cost of Outsourcing and Verifying Efficiently) a pairing. Our contributions are threefold. First, we propose a protocol (LOVE) that improves the efficiency of Di Crescenzo et al.’s proposal for securely delegating pairings with online, public inputs. Second, we provide the first implementation of efficient protocols in this setting. Finally, we evaluate the performance of our LOVE protocol in different application scenarios by benchmarking an implementation using BN, BLS12 and BLS24 pairing-friendly curves. Interestingly, compared to Di Crescenzo et al.’s protocol, LOVE is up to 29.7% faster for the client, up to 24.9% for the server and requires 23–24% less communication cost depending on the choice of parameters. Furthermore, we note that our LOVE protocol is especially suited for subgroup-secure groups: checking the correctness of the delegated pairing requires up to 56.2% less computations than evaluating the pairing locally (no delegation). This makes LOVE the most efficient protocol to date for securely outsourcing the computation of a pairing with online public inputs, even when the server is malicious. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/5f9135d6-8626-4151-9d87-0fa7314153aa
- author
- Aranha, Diego
; Pagnin, Elena
LU
and Hernàndez-Rodriguez, Francisco
- organization
- publishing date
- 2021
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- host publication
- Progress in Cryptology – LATINCRYPT 2021 : 7th International Conference on Cryptology and Information Security in Latin America, Bogotá, Colombia, October 6–8, 2021, Proceedings - 7th International Conference on Cryptology and Information Security in Latin America, Bogotá, Colombia, October 6–8, 2021, Proceedings
- series title
- Lecture Notes in Computer Science
- volume
- 12912
- pages
- 320 - 340
- publisher
- Springer
- conference name
- 7th International Conference on Cryptology and Information Security in Latin America, LATINCRYPT 2021
- conference location
- Bogota, Colombia
- conference dates
- 2021-10-06 - 2021-10-08
- external identifiers
-
- scopus:85116928100
- ISSN
- 0302-9743
- 1611-3349
- ISBN
- 978-3-030-88237-2
- 978-3-030-88238-9
- DOI
- 10.1007/978-3-030-88238-9_16
- language
- English
- LU publication?
- yes
- id
- 5f9135d6-8626-4151-9d87-0fa7314153aa
- date added to LUP
- 2021-09-28 15:06:19
- date last changed
- 2024-06-16 19:40:06
@inproceedings{5f9135d6-8626-4151-9d87-0fa7314153aa,
abstract = {{The problem of securely outsourcing the computation of a bilinear pairing has been widely investigated in the literature. Designing an efficient protocol with the desired functionality has, however, been an open challenge for a long time. Recently, Di Crescenzo et al. (CARDIS’20) proposed the first suite of protocols for securely and efficiently delegating pairings with online inputs under the presence of a malicious server. We progress along this path with the aim of LOVE (Lowering the cost of Outsourcing and Verifying Efficiently) a pairing. Our contributions are threefold. First, we propose a protocol (LOVE) that improves the efficiency of Di Crescenzo et al.’s proposal for securely delegating pairings with online, public inputs. Second, we provide the first implementation of efficient protocols in this setting. Finally, we evaluate the performance of our LOVE protocol in different application scenarios by benchmarking an implementation using BN, BLS12 and BLS24 pairing-friendly curves. Interestingly, compared to Di Crescenzo et al.’s protocol, LOVE is up to 29.7% faster for the client, up to 24.9% for the server and requires 23–24% less communication cost depending on the choice of parameters. Furthermore, we note that our LOVE protocol is especially suited for subgroup-secure groups: checking the correctness of the delegated pairing requires up to 56.2% less computations than evaluating the pairing locally (no delegation). This makes LOVE the most efficient protocol to date for securely outsourcing the computation of a pairing with online public inputs, even when the server is malicious.}},
author = {{Aranha, Diego and Pagnin, Elena and Hernàndez-Rodriguez, Francisco}},
booktitle = {{Progress in Cryptology – LATINCRYPT 2021 : 7th International Conference on Cryptology and Information Security in Latin America, Bogotá, Colombia, October 6–8, 2021, Proceedings}},
isbn = {{978-3-030-88237-2}},
issn = {{0302-9743}},
language = {{eng}},
pages = {{320--340}},
publisher = {{Springer}},
series = {{Lecture Notes in Computer Science}},
title = {{LOVE a Pairing}},
url = {{http://dx.doi.org/10.1007/978-3-030-88238-9_16}},
doi = {{10.1007/978-3-030-88238-9_16}},
volume = {{12912}},
year = {{2021}},
}