IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-3-032-13377-9_8.html

Economic Security of Multiple Shared Security Protocols

In: Mathematical Research for Blockchain Economy

Author

Listed:
  • Abhimanyu Nag

    (University of Alberta, Department of Mathematical and Statistical Sciences)

  • Dhruv Bodani

    (Catalysis Labs)

  • Abhishek Kumar

    (Catalysis Labs)

Abstract

As restaking protocols gain adoption across blockchain ecosystems, there is a need for Actively Validated Services (AVSs) to span multiple Shared Security Providers (SSPs). This leads to stake fragmentation which introduces new complications where an adversary may compromise an AVS by targeting its weakest SSP. In this paper, we formalize the Multiple SSP Problem and analyze two architectures: an isolated fragmented model called Model $$\mathbb {M}$$ M and a shared unified model called Model $$\mathbb {S}$$ S , through a convex optimization and game-theoretic lens. We derive utility bounds, attack cost conditions and market equilibrium that describe protocol security for both models. Our results show that while Model $$\mathbb {M}$$ M offers deployment flexibility, it inherits lowest-cost attack vulnerabilities, whereas Model $$\mathbb {S}$$ S achieves tighter security guarantees through single validator sets and aggregated slashing logic. We conclude with future directions of work including an incentive-compatible stake rebalancing allocation in restaking ecosystems (The authors would like to thank Jiasun Li, Manvir Schneider, Mingxuan He and Bernardo Vicente for their helpful comments and suggestions that helped this paper take shape.).

Suggested Citation

  • Abhimanyu Nag & Dhruv Bodani & Abhishek Kumar, 2026. "Economic Security of Multiple Shared Security Protocols," Lecture Notes in Operations Research, in: Stefanos Leonardos & Amir K. Goharshady & William Knottenbelt & Panos Pardalos (ed.), Mathematical Research for Blockchain Economy, pages 166-186, Springer.
  • Handle: RePEc:spr:lnopch:978-3-032-13377-9_8
    DOI: 10.1007/978-3-032-13377-9_8
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:lnopch:978-3-032-13377-9_8. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.