Allowing Blockchain Loans with Low Collateral

• URL: http://arxiv.org/abs/2306.11620v1
• Date: Tue, 13 Jun 2023 12:49:19 GMT
• Title: Allowing Blockchain Loans with Low Collateral
• Authors: Tom Azoulay, Uri Carl, Ori Rottenstreich
• Abstract summary: In blockchain-based loans, cryptocurrencies serve as the collateral. As assets serving as collateral are locked, this requirement prevents many candidates from obtaining loans. We aim to make loans more accessible by offering loans with lower collateral, while keeping the risk for lenders bound.
• Score: 8.891968048563685
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Collateral is an item of value serving as security for the repayment of a loan. In blockchain-based loans, cryptocurrencies serve as the collateral. The high volatility of cryptocurrencies implies a serious barrier of entry with a common practice that collateral values equal multiple times the value of the loan. As assets serving as collateral are locked, this requirement prevents many candidates from obtaining loans. In this paper, we aim to make loans more accessible by offering loans with lower collateral, while keeping the risk for lenders bound. We use a credit score based on data recovered from the blockchain to predict how likely someone is to repay a loan. Our protocol does not risk the initial amount granted by liquidity providers, but only risks part of the interest yield gained by the protocol in the past.

Related papers

• Escaping the Subprime Trap in Algorithmic Lending [49.1574468325115]
  We study the role of risk-management constraints, specifically Value-at-Risk (VaR) constraints, in the persistence of segregation in loan approval decisions. We develop a formal model in which a mainstream (low-interest) bank is more sensitive to variance risk than a subprime bank. We show that a small, finite subsidy can help minority groups escape the trap by covering enough of the mainstream bank's downside.
  arXiv  Detail & Related papers  (2025-02-25T03:43:57Z)
• Efficient and Universally Accessible Cross-Chain Options without Upfront Holder Collateral [3.5562096606353215]
  We present a protocol for efficient and universally accessible option trading. Our protocol's universality allows for cross-chain options involving nearly $textitany$ assets on $textitany$ two different blockchains. By introducing a guarantee from the option writer, our protocol removes the need of upfront collateral from holders.
  arXiv  Detail & Related papers  (2024-10-21T07:43:20Z)
• Quantum digital signature based on single-qubit without a trusted third-party [45.41082277680607]
  We propose a brand new quantum digital signature protocol without a trusted third party only with qubit technology to further improve the security. We prove that the protocol has information-theoretical unforgeability. Moreover, it satisfies other important secure properties, including asymmetry, undeniability, and expandability.
  arXiv  Detail & Related papers  (2024-10-17T09:49:29Z)
• The Latency Price of Threshold Cryptosystem in Blockchains [52.359230560289745]
  We study the interplay between threshold cryptography and a class of blockchains that use Byzantine-fault tolerant (BFT) consensus protocols. Existing approaches for threshold cryptosystems introduce a latency overhead of at least one message delay for running the threshold cryptographic protocol. We propose a mechanism to eliminate this overhead for blockchain-native threshold cryptosystems with tight thresholds.
  arXiv  Detail & Related papers  (2024-07-16T20:53:04Z)
• Enhancing Trust and Privacy in Distributed Networks: A Comprehensive Survey on Blockchain-based Federated Learning [51.13534069758711]
  Decentralized approaches like blockchain offer a compelling solution by implementing a consensus mechanism among multiple entities. Federated Learning (FL) enables participants to collaboratively train models while safeguarding data privacy. This paper investigates the synergy between blockchain's security features and FL's privacy-preserving model training capabilities.
  arXiv  Detail & Related papers  (2024-03-28T07:08:26Z)
• Empowering Many, Biasing a Few: Generalist Credit Scoring through Large Language Models [53.620827459684094]
  Large Language Models (LLMs) have great potential for credit scoring tasks, with strong generalization ability across multiple tasks. We propose the first open-source comprehensive framework for exploring LLMs for credit scoring. We then propose the first Credit and Risk Assessment Large Language Model (CALM) by instruction tuning, tailored to the nuanced demands of various financial risk assessment tasks.
  arXiv  Detail & Related papers  (2023-10-01T03:50:34Z)
• 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)
• Decentralized Basic Income: Creating Wealth with On-Chain Staking and Fixed-Rate Protocols [0.0]
  We evaluate the mechanisms behind the decentralized finance protocols for generating stable, passive income. Currently, such savings interest rates can be as high as 20% annually, payable in traditional currency values such as US dollars. We will discuss potential pitfalls, assess how these protocols may behave in market cycles, as well as suggest areas for further research and development.
  arXiv  Detail & Related papers  (2021-07-29T20:21:55Z)
• How Costly is Noise? Data and Disparities in Consumer Credit [0.0]
  We show that credit scores are noisier indicators of default risk for historically under-served groups. We find that equalizing the precision of credit scores can reduce disparities in approval rates and in credit misallocation for disadvantaged groups by approximately half.
  arXiv  Detail & Related papers  (2021-05-17T00:42:26Z)
• Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security [67.06003361150228]
  A proof of work (PoW) is an important cryptographic construct enabling a party to convince others that they invested some effort in solving a computational task. In this work, we examine the hardness of finding such chain of PoWs against quantum strategies. We prove that the chain of PoWs problem reduces to a problem we call multi-solution Bernoulli search, for which we establish its quantum query complexity.
  arXiv  Detail & Related papers  (2020-12-30T18:03:56Z)
• Determining Secondary Attributes for Credit Evaluation in P2P Lending [0.0]
  We utilize machine learning classification and clustering algorithms to accurately predict a borrower's creditworthiness. We achieved 65% F1 and 73% AUC on the LendingClub data while identifying key secondary attributes.
  arXiv  Detail & Related papers  (2020-06-08T16:12:00Z)
• Predicting Bank Loan Default with Extreme Gradient Boosting [0.0]
  We use an Extreme Gradient Boosting algorithm called XGBoost for loan default prediction. The prediction is based on a loan data from a leading bank taking into consideration data sets from both the loan application and the demographic of the applicant.
  arXiv  Detail & Related papers  (2020-01-18T18:52:10Z)

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.