Skip to main content

2024 | OriginalPaper | Buchkapitel

Foundations of Adaptor Signatures

verfasst von : Paul Gerhart, Dominique Schröder, Pratik Soni, Sri AravindaKrishnan Thyagarajan

Erschienen in: Advances in Cryptology – EUROCRYPT 2024

Verlag: Springer Nature Switzerland

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Adaptor signatures extend the functionality of regular signatures through the computation of pre-signatures on messages for statements of NP relations. Pre-signatures are publicly verifiable; they simultaneously hide and commit to a signature of an underlying signature scheme on that message. Anybody possessing a corresponding witness for the statement can adapt the pre-signature to obtain the “regular” signature. Adaptor signatures have found numerous applications for conditional payments in blockchain systems, like payment channels (CCS’20, CCS’21), private coin mixing (CCS’22, SP’23), and oracle-based payments (NDSS’23).
In our work, we revisit the state of the security of adaptor signatures and their constructions. In particular, our two main contributions are:
  • Security Gaps and Definitions: We review the widely-used security model of adaptor signatures due to Aumayr et al. (AC’21) and identify gaps in their definitions that render known protocols for private coin-mixing and oracle-based payments insecure. We give simple counterexamples of adaptor signatures that are secure w.r.t. their definitions but result in insecure instantiations of these protocols. To fill these gaps, we identify a minimal set of modular definitions that align with these practical applications.
  • Secure Constructions: Despite their popularity, all known constructions are (1) derived from identification schemes via the Fiat-Shamir transform in the random oracle model or (2) require modifications to the underlying signature verification algorithm, thus making the construction useless in the setting of cryptocurrencies. More concerningly, all known constructions were proven secure w.r.t. the insufficient definitions of Aumayr et al., leaving us with no provably secure adaptor signature scheme to use in applications.
    Firstly, in this work, we salvage all current applications by proving the security of the widely-used Schnorr adaptor signatures under our proposed definitions. We then provide several new constructions, including presenting the first adaptor signature schemes for Camenisch-Lysyanskaya (CL), Boneh-Boyen-Shacham (BBS+), and Waters signatures, all of which are proven secure in the standard model. Our new constructions rely on a new abstraction of digital signatures, called dichotomic signatures, which covers the essential properties we need to build adaptor signatures. Proving the security of all constructions (including identification-based schemes) relies on a novel non-black-box proof technique. Both our digital signature abstraction and the proof technique could be of independent interest to the community.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
We call these reductions transparent since we can “see-through” the reduction and use its code in a non-black-box way.
 
Literatur
1.
Zurück zum Zitat Albrecht, M.R., Cini, V., Lai, R.W.F., Malavolta, G., Thyagarajan, S.A.: Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology – CRYPTO 2022, pp. 102–132. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-15979-4_4 Albrecht, M.R., Cini, V., Lai, R.W.F., Malavolta, G., Thyagarajan, S.A.: Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology – CRYPTO 2022, pp. 102–132. Springer, Cham (2022). https://​doi.​org/​10.​1007/​978-3-031-15979-4_​4
4.
Zurück zum Zitat Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Denning, D.E., et al. (eds.) ACM CCS 93: 1st Conference on Computer and Communications Security, pp. 62–73. ACM Press, Fairfax, Virginia, USA (1993)CrossRef Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: Denning, D.E., et al. (eds.) ACM CCS 93: 1st Conference on Computer and Communications Security, pp. 62–73. ACM Press, Fairfax, Virginia, USA (1993)CrossRef
5.
Zurück zum Zitat Blum, M., Feldman, P., Micali, S.: Non-interactive zero- knowledge and its applications (extended abstract). In: 20th Annual ACM Symposium on Theory of Computing. Chicago, IL, USA, pp. 103–112. ACM Press (1988) Blum, M., Feldman, P., Micali, S.: Non-interactive zero- knowledge and its applications (extended abstract). In: 20th Annual ACM Symposium on Theory of Computing. Chicago, IL, USA, pp. 103–112. ACM Press (1988)
13.
Zurück zum Zitat Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. J. ACM 51(4), 557–594 (2004)MathSciNetCrossRef Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. J. ACM 51(4), 557–594 (2004)MathSciNetCrossRef
14.
Zurück zum Zitat Dai, W., Okamoto, T., Yamamoto, G.: Stronger security and generic constructions for adaptor signatures. In: Isobe, T., Sarkar, S. (eds.) Progress in Cryptology – INDOCRYPT 2022. Ed. by Takanori Isobe and Santanu Sarkar, pp. 52–77. Springer, Cham (2022). https://doi.org/10.1007/978-3-031-22912-1_3 Dai, W., Okamoto, T., Yamamoto, G.: Stronger security and generic constructions for adaptor signatures. In: Isobe, T., Sarkar, S. (eds.) Progress in Cryptology – INDOCRYPT 2022. Ed. by Takanori Isobe and Santanu Sarkar, pp. 52–77. Springer, Cham (2022). https://​doi.​org/​10.​1007/​978-3-031-22912-1_​3
21.
Zurück zum Zitat Glaeser, N., et al.: Foundations of coin mixing services. In: Yin, H., et al. (eds.) ACM CCS 2022: 29th Conference on Computer and Communications Security, pp. 1259–1273. ACM Press, Los Angeles, CA, USA (2022) Glaeser, N., et al.: Foundations of coin mixing services. In: Yin, H., et al. (eds.) ACM CCS 2022: 29th Conference on Computer and Communications Security, pp. 1259–1273. ACM Press, Los Angeles, CA, USA (2022)
23.
Zurück zum Zitat Looker, T., et al.: The BBS signature scheme. Internet-Draft draft-irtfcfrg- bbs-signatures-02.Work in Progress. Internet Engineering Task Force, pp. 71 (2023) Looker, T., et al.: The BBS signature scheme. Internet-Draft draft-irtfcfrg- bbs-signatures-02.Work in Progress. Internet Engineering Task Force, pp. 71 (2023)
25.
Zurück zum Zitat Madathil, V., et al.: Cryptographic oracle-based conditional payments. In: Proceedings 2023 Network and Distributed System Security Symposium (2023) Madathil, V., et al.: Cryptographic oracle-based conditional payments. In: Proceedings 2023 Network and Distributed System Security Symposium (2023)
26.
Zurück zum Zitat Malavolta, G., et al.: Anonymous multi-hop locks for blockchain scalability and interoperability. In: ISOC Network and Distributed System Security Symposium - NDSS 2019. The Internet Society, San Diego (2019) Malavolta, G., et al.: Anonymous multi-hop locks for blockchain scalability and interoperability. In: ISOC Network and Distributed System Security Symposium - NDSS 2019. The Internet Society, San Diego (2019)
28.
Zurück zum Zitat Poelstra, A.: Scriptless scripts. In: Presentation Slides (2017) Poelstra, A.: Scriptless scripts. In: Presentation Slides (2017)
29.
Zurück zum Zitat Qin, X., et al.: BlindHub: bitcoin-compatible privacy-preserving payment channel hubs supporting variable amounts. In: 2023 IEEE Symposium on Security and Privacy (SP), pp. 2462–2480 (2023) Qin, X., et al.: BlindHub: bitcoin-compatible privacy-preserving payment channel hubs supporting variable amounts. In: 2023 IEEE Symposium on Security and Privacy (SP), pp. 2462–2480 (2023)
30.
32.
Zurück zum Zitat Tsang, P.P., et al.: Blacklistable anonymous credentials: blocking misbehaving users without TTPs. In: Ning, P., De Capitani, S., di Vimercati, and Paul F. Syverson, (eds.) ACM CCS 2007: 14th Conference on Computer and Communications Security, pp. 72–81. ACM Press, Alexandria, Virginia, USA (2007) Tsang, P.P., et al.: Blacklistable anonymous credentials: blocking misbehaving users without TTPs. In: Ning, P., De Capitani, S., di Vimercati, and Paul F. Syverson, (eds.) ACM CCS 2007: 14th Conference on Computer and Communications Security, pp. 72–81. ACM Press, Alexandria, Virginia, USA (2007)
Metadaten
Titel
Foundations of Adaptor Signatures
verfasst von
Paul Gerhart
Dominique Schröder
Pratik Soni
Sri AravindaKrishnan Thyagarajan
Copyright-Jahr
2024
DOI
https://doi.org/10.1007/978-3-031-58723-8_6

Premium Partner