Nothing Special   »   [go: up one dir, main page]

Skip to main content

Verifiable Timed Accountable Subgroup Multi-signatures

  • Conference paper
  • First Online:
Information Systems Security (ICISS 2023)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 14424))

Included in the following conference series:

  • 629 Accesses

Abstract

Accountable subgroup multi-signature (ASM) is a form of multi-signature scheme that permits any subgroup of a group to sign a message on behalf of the group while ensuring that the signers are accountable for the multi-signature. Since the accountability principle cannot be provided in many multi-signature schemes, an ASM algorithm makes a difference by providing this feature. ASM has many application areas, especially due to its practical and efficient usage in blockchain or legacy systems. On the other hand, timed signatures allow one to send information to the future which is also necessary for many applications such as blockchain, secure communication, or proof of ownership. In this paper, we propose a timed version of a multi-signature scheme with the help of linearly homomorphic time-lock puzzles (LHTLP) using the method constructed by Thyagarajan et al. Also, we slightly modified the ASM scheme constructed by Boneh et al. to adapt it to the verifiable timed commitment schemes.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Boneh, D., Drijvers, M., Neven, G.: Compact multi-signatures for smaller blockchains. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11273, pp. 435–464. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-03329-3_15

    Chapter  Google Scholar 

  2. Micali, S., Ohta, K., Reyzin, L.: Accountable-subgroup multisignatures. In: Proceedings of the 8th ACM Conference on Computer and Communications Security, pp. 245–254 (2001)

    Google Scholar 

  3. Thyagarajan, S.A.K., Bhat, A., Malavolta, G., Döttling, N., Kate, A., Schröder, D.: Verifiable timed signatures made practical. In: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security, pp. 1733–1750 (2020)

    Google Scholar 

  4. Thyagarajan, S.A., Malavolta, G., Moreno-Sanchez, P.: Universal atomic swaps: secure exchange of coins across all blockchains. In: 2022 IEEE Symposium on Security and Privacy (SP), pp. 1299–1316. IEEE (2022)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Duygu Özden .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Özden, D., Yayla, O. (2023). Verifiable Timed Accountable Subgroup Multi-signatures. In: Muthukkumarasamy, V., Sudarsan, S.D., Shyamasundar, R.K. (eds) Information Systems Security. ICISS 2023. Lecture Notes in Computer Science, vol 14424. Springer, Cham. https://doi.org/10.1007/978-3-031-49099-6_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-49099-6_18

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-49098-9

  • Online ISBN: 978-3-031-49099-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics