A quantitative notion of economic security for smart contract compositions

• URL: http://arxiv.org/abs/2505.19006v1
• Date: Sun, 25 May 2025 07:10:55 GMT
• Title: A quantitative notion of economic security for smart contract compositions
• Authors: Emily Priyadarshini, Massimo Bartoletti,
• Abstract summary: We introduce a quantitative security notion that measures how an attack on a single component can amplify economic losses of the overall system.<n>In particular, we analyse under-collateralized loan attacks in systems made of lending protocols and decentralized exchanges.
• Score: 0.4604003661048266
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Decentralized applications are often composed of multiple interconnected smart contracts. This is especially evident in DeFi, where protocols are heavily intertwined and rely on a variety of basic building blocks such as tokens, decentralized exchanges and lending protocols. A crucial security challenge in this setting arises when adversaries target individual components to cause systemic economic losses. Existing security notions focus on determining the existence of these attacks, but fail to quantify the effect of manipulating individual components on the overall economic security of the system. In this paper, we introduce a quantitative security notion that measures how an attack on a single component can amplify economic losses of the overall system. We study the fundamental properties of this notion and apply it to assess the security of key compositions. In particular, we analyse under-collateralized loan attacks in systems made of lending protocols and decentralized exchanges.

Related papers

• Information-Theoretic Decentralized Secure Aggregation with Collusion Resilience [98.31540557973179]
  We study the problem of decentralized secure aggregation (DSA) from an information-theoretic perspective.<n>We characterize the optimal rate region, which specifies the minimum achievable communication and secret key rates for DSA.<n>Our results establish the fundamental performance limits of DSA, providing insights for the design of provably secure and communication-efficient protocols.
  arXiv  Detail & Related papers  (2025-08-01T12:51:37Z)
• A theory of Lending Protocols in DeFi [0.4604003661048266]
  Lending protocols are one of the main applications of Decentralized Finance (DeFi)<n>Unlike traditional lending systems, these protocols operate without relying on trusted authorities or off-chain enforcement mechanisms.<n>We propose a formal model of lending protocols that captures the essential features of mainstream platforms.
  arXiv  Detail & Related papers  (2025-06-18T09:25:33Z)
• Security Vulnerabilities in Ethereum Smart Contracts: A Systematic Analysis [7.858744413354451]
  This paper focuses on Ether smart contracts and explains the main components of Ether, smart contract architecture and mechanism.<n>According to the four security events of American Chain, The, Parity and KotET, the principles of integer overflow attack, reentrant attack, access control attack and denial of service attack are studied and analyzed.<n> preventive measures are given.
  arXiv  Detail & Related papers  (2025-04-08T12:25:34Z)
• Phantom Events: Demystifying the Issues of Log Forgery in Blockchain [31.570414211726888]
  We present the first in-depth security analysis of transaction log forgery in EVM-based blockchains.<n>We propose a tool designed to detect event forgery vulnerabilities in smart contracts.<n>We have successfully identified real-world instances for all five types of attacks across multiple decentralized applications.
  arXiv  Detail & Related papers  (2025-02-19T08:07:26Z)
• Application of $α$-order Information Metrics for Secure Communication in Quantum Physical Layer Design [45.41082277680607]
  We study the $alpha$-order information-theoretic metrics based on R'enyi entropy.<n>We apply our framework to a practical scenario involving BPSK modulation over a lossy bosonic channel.
  arXiv  Detail & Related papers  (2025-02-07T03:44:11Z)
• ACRIC: Securing Legacy Communication Networks via Authenticated Cyclic Redundancy Integrity Check [98.34702864029796]
  Recent security incidents in safety-critical industries exposed how the lack of proper message authentication enables attackers to inject malicious commands or alter system behavior.<n>These shortcomings have prompted new regulations that emphasize the pressing need to strengthen cybersecurity.<n>We introduce ACRIC, a message authentication solution to secure legacy industrial communications.
  arXiv  Detail & Related papers  (2024-11-21T18:26:05Z)
• A Survey and Comparative Analysis of Security Properties of CAN Authentication Protocols [92.81385447582882]
  The Controller Area Network (CAN) bus leaves in-vehicle communications inherently non-secure. This paper reviews and compares the 15 most prominent authentication protocols for the CAN bus. We evaluate protocols based on essential operational criteria that contribute to ease of implementation.
  arXiv  Detail & Related papers  (2024-01-19T14:52:04Z)
• An Efficient and Multi-private Key Secure Aggregation for Federated Learning [41.29971745967693]
  We propose an efficient and multi-private key secure aggregation scheme for federated learning. Specifically, we skillfully modify the variant ElGamal encryption technique to achieve homomorphic addition operation. For the high dimensional deep model parameter, we introduce a super-increasing sequence to compress multi-dimensional data into 1-D.
  arXiv  Detail & Related papers  (2023-06-15T09:05:36Z)
• Security of differential phase shift QKD against explicit individual attacks [1.9849264945671103]
  We characterize the security of the 3 and n-pulse Differential Phase Shift Quantum Key Distribution protocols against individual attacks. We compare the secure key rates thus obtained with the known lower bounds under a general individual attack.
  arXiv  Detail & Related papers  (2023-05-19T16:56:26Z)
• Is Vertical Logistic Regression Privacy-Preserving? A Comprehensive Privacy Analysis and Beyond [57.10914865054868]
  We consider vertical logistic regression (VLR) trained with mini-batch descent gradient. We provide a comprehensive and rigorous privacy analysis of VLR in a class of open-source Federated Learning frameworks.
  arXiv  Detail & Related papers  (2022-07-19T05:47:30Z)
• Security of quantum key distribution from generalised entropy accumulation [2.1030878979833467]
  We provide a formal framework for general quantum key distribution protocols. We show that security against general attacks reduces to security against collective attacks. Our proof relies on a recently developed information-theoretic tool called generalised entropy accumulation.
  arXiv  Detail & Related papers  (2022-03-09T19:00:07Z)
• Sharing classical secrets with continuous-variable entanglement: Composable security and network coding advantage [0.913755431537592]
  We show that multi-partite entangled resources achieve a genuine advantage over point-to-point protocols for quantum communication. This is the first concrete compelling examples of multi-partite entangled resources achieving a genuine advantage over point-to-point protocols for quantum communication.
  arXiv  Detail & Related papers  (2021-04-21T17:37:28Z)
• Backflash Light as a Security Vulnerability in Quantum Key Distribution Systems [77.34726150561087]
  We review the security vulnerabilities of quantum key distribution (QKD) systems. We mainly focus on a particular effect known as backflash light, which can be a source of eavesdropping attacks.
  arXiv  Detail & Related papers  (2020-03-23T18:23:12Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.