Welcome to the resource topic for 2018/523
Title:
Reducing Complexity of Pairing Comparisons using Polynomial Evaluation
Authors: Adam Bobowski, Marcin Słowik
Abstract:We propose a new method for reducing complexity of the pairing comparisons based on polynomials. Thought the construction introduces uncertainty into (usually deterministic) checks, it is easily quantifiable and in most cases extremely small. The application to CL-LRSW signature verification under n messages and group order q allows to reduce the number of computed pairings from 4n down to just 4, while the introduced uncertainty is just (2n-1)/q.
ePrint: https://eprint.iacr.org/2018/523
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 .