Welcome to the resource topic for 2023/1076
Title:
Threshold BBS+ From Pseudorandom Correlations
Authors: Sebastian Faust, Carmit Hazay, David Kretzler, Benjamin Schlosser
Abstract:The BBS+ signature scheme is one of the most prominent solutions for realizing anonymous credentials. In particular, due to properties like selective disclosure and efficient protocols for creating and showing possession of credentials. In recent years, research in cryptography has increasingly focused on the distribution of cryptographic tasks to mitigate attack surfaces and remove single points of failure.
In this work, we present a threshold BBS+ protocol in the preprocessing model. Our protocol supports an arbitrary t-out-of-n threshold and achieves non-interactive signing in the online phase. It relies on a new pseudorandom correlation-based offline protocol producing preprocessing material with sublinear communication complexity in the number of signatures. Both our offline and online protocols are actively secure under the Universal Composability framework. Finally, we estimate the concrete efficiency of our protocol, including an implementation of the online phase. The online protocol without network latency takes less than 15 ms for t \leq 30 and credentials sizes up to 10. Further, our results indicate that the influence of t on the online signing is insignificant, < 6 \% for t \leq 30, and the overhead of the thresholdization occurs almost exclusively in the offline phase.
ePrint: https://eprint.iacr.org/2023/1076
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 .