One-More Unforgeability of Blind ECDSA

[1]  Tatsuaki Okamoto,et al.  Provably Secure Partially Blind Signatures , 2000, CRYPTO.

[2]  Markus Rückert,et al.  Lattice-based Blind Signatures , 2010, Algorithms and Number Theory.

[3]  David Chaum,et al.  Blind Signatures for Untraceable Payments , 1982, CRYPTO.

[4]  Mihir Bellare,et al.  The Multi-Base Discrete Logarithm Problem: Tight Reductions and Non-rewinding Proofs for Schnorr Identification and Signatures , 2020, INDOCRYPT.

[5]  Dieter Gollmann,et al.  A New Blind ECDSA Scheme for Bitcoin Transaction Anonymity , 2019, IACR Cryptol. ePrint Arch..

[6]  Georg Fuchsbauer,et al.  Blind Schnorr Signatures and Signed ElGamal Encryption in the Algebraic Group Model , 2020, EUROCRYPT.

[7]  Amit Sahai,et al.  Round Optimal Blind Signatures , 2011, CRYPTO.

[8]  Jan Camenisch,et al.  Blind Signatures Based on the Discrete Logarithm Problem , 1994, EUROCRYPT.

[9]  Fabien Laguillaumie,et al.  Linearly Homomorphic Encryption from $$\mathsf {DDH}$$ , 2015, CT-RSA.

[10]  Eike Kiltz,et al.  On the Provable Security of (EC)DSA Signatures , 2016, CCS.

[11]  Tsz Hon Yuen,et al.  Compact Zero-Knowledge Proofs for Threshold ECDSA with Trustless Setup , 2021, IACR Cryptol. ePrint Arch..

[12]  Eike Kiltz,et al.  The Algebraic Group Model and its Applications , 2018, IACR Cryptol. ePrint Arch..

[13]  Claus-Peter Schnorr,et al.  Security of Blind Discrete Log Signatures against Interactive Attacks , 2001, ICICS.

[14]  Masayuki Abe,et al.  A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures , 2001, EUROCRYPT.

[15]  Tancrède Lepoint,et al.  On the (in)Security of ROS , 2022, Journal of Cryptology.

[16]  Eike Kiltz,et al.  A Modular Treatment of Blind Signatures from Identification Schemes , 2019, IACR Cryptol. ePrint Arch..

[17]  Aggelos Kiayias,et al.  Equivocal Blind Signatures and Adaptive UC-Security , 2008, TCC.

[18]  David A. Wagner,et al.  A Generalized Birthday Problem , 2002, CRYPTO.

[19]  Dennis Hofheinz,et al.  On Instantiating the Algebraic Group Model from Falsifiable Assumptions , 2020, IACR Cryptol. ePrint Arch..

[20]  Marc Fischlin,et al.  Round-Optimal Composable Blind Signatures in the Common Reference String Model , 2006, CRYPTO.

[21]  Pascal Paillier,et al.  Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.