CISPA
Browse
1-s2.0-S074373152300031X-main.pdf (609.83 kB)

PI-Cut-Choo! Parallel Instance Cut and Choose for Practical Blind Signatures.

Download (609.83 kB)
preprint
posted on 2024-03-20, 10:29 authored by Benedikt WagnerBenedikt Wagner, Lucjan HanzlikLucjan Hanzlik, Julian LossJulian Loss
Blind signature schemes are one of the best-studied tools for privacy-preserving authentication. Unfortunately, known constructions of provably secure blind signatures either rely on non-standard hardness assumptions, or require parameters that grow linearly with the number of concurrently issued signatures, or involve prohibitively inefficient general techniques such as general secure two-party computation. Recently, Katz, Loss and Rosenberg (ASIACRYPT’21) gave a technique that, for the security parameter n, transforms blind signature schemes secure for O(logn) concurrent executions of the blind signing protocol into ones that are secure for any poly(n) concurrent executions. This transform has two drawbacks that we eliminate in this paper: 1) the communication complexity of the resulting blind signing protocol grows linearly with the number of signing interactions; 2) the resulting schemes inherit a very loose security bound from the underlying scheme and, as a result, require impractical parameter sizes. In this work, we give an improved transform for obtaining a secure blind signing protocol tolerating any poly(n) concurrent executions from one that is secure for O(logn) concurrent executions. While preserving the advantages of the original transform, the communication complexity of our new transform only grows logarithmically with the number of interactions. Under the CDH and RSA assumptions, we improve on this generic transform in terms of concrete efficiency and give (1) a BLSbased blind signature scheme over a standard-sized group where signatures are of size roughly 3 KB and communication per signature is roughly 120 KB; and (2) an Okamoto-Guillou-Quisquater-based blind signature scheme with signatures and communication of roughly 9 KB and 8 KB, respectively.

History

Primary Research Area

  • Algorithmic Foundations and Cryptography

BibTeX

@misc{Wagner:Hanzlik:Loss:2022, title = "PI-Cut-Choo! Parallel Instance Cut and Choose for Practical Blind Signatures.", author = "Wagner, Benedikt" AND "Hanzlik, Lucjan" AND "Loss, Julian", year = 2022, month = 1 }

Usage metrics

    Categories

    No categories selected

    Licence

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC