Welcome to the resource topic for 2021/806
Title:
Boosting the Security of Blind Signature Schemes
Authors: Jonathan Katz, Julian Loss, Michael Rosenberg
Abstract:Existing blind signature schemes that are secure for polynomially many concurrent executions of the signing protocol are either inefficient or rely on non-standard assumptions (even in the random-oracle model). We show the first efficient blind signature schemes achieving this level of security based on the RSA, factoring, or discrete logarithm assumptions (in the random-oracle model). Our core technique involves an extension and generalization of a transform due to Pointcheval (Eurocrypt '98) that allows us to convert certain blind signature schemes that are secure for (concurrently) issuing logarithmically many signatures into ones secure for (concurrently) issuing polynomially many signatures.
ePrint: https://eprint.iacr.org/2021/806
Talk: https://www.youtube.com/watch?v=FHUggQZ8mSs
Slides: https://iacr.org/submit/files/slides/2021/asiacrypt/asiacrypt2021/300/slides.pdf
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 .