[Resource Topic] 2020/575: From Rerandomizability to Sequential Aggregation: Efficient Signature Schemes Based on SXDH Assumption

Welcome to the resource topic for 2020/575

Title:
From Rerandomizability to Sequential Aggregation: Efficient Signature Schemes Based on SXDH Assumption

Authors: Sanjit Chatterjee, R. Kabaleeshwaran

Abstract:

An aggregate signature allows one to generate a short aggregate of signatures from different signers on different messages. A sequential aggregate signature (SeqAS) scheme allows the signers to aggregate their individual signatures in a sequential manner. All existing SeqAS schemes that do not use the random oracle assumption either require a large public key or the security depends upon some non-standard interactive/static assumptions. In this paper, we present an efficient SeqAS scheme with constant-size public key under the SXDH assumption. In the process, we first obtain an optimized (and more efficient) variant of Libert et al’s randomizable signature scheme. While both the schemes are more efficient than the currently best ones that rely on some static assumption, they are only slightly costlier than the most efficient ones based on some interactive assumption.

ePrint: https://eprint.iacr.org/2020/575

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 .