Digital Currency - Concept of Digital Bond Exchange System in Loosely Coupled Mobile Systems

Hochschule für Technik und Wirtschaft Berlin Fachbereich II Professional IT Business and Digitalization Masters Course Master’s Thesis Winter 2024 Digital Currency - Concept of Digital Bond Exchange System in Loosely Coupled Mobile Systems Presented by: Nikhil Amin (s0585844) 1st Evaluator: Prof. Dr. Ing. Thomas Schwotzer 2nd Evaluator: Prof. Dr. Alexander Huhn Digital Currency - Concept of Digital Bond Exchange System in Loosely Coupled Mobile Systems Presented by: Nikhil Amin (s0585844) 1st Evaluator: Prof. Dr. Ing. Thomas Schwotzer 2nd Evaluator: Prof. Dr. Alexander Huhn February 14, 2024 Contents 1 Introduction 7 1.1 Background and Motivation . . . . . . . . . . . . . . . . . . . 7 1.2 Researchquestions ........................ 7 1.3 Methodology ........................... 8 2 Fundamental concepts 9 2.1 WhatisMoney? ......................... 9 2.2 HistoryofMoney......................... 9 2.3 Debt................................ 11 2.4 Bonds ............................... 12 2.5 IOU ................................ 12 2.6 How is Money created? . . . . . . . . . . . . . . . . . . . . . . 13 2.6.1 FolkTales......................... 14 2.6.2 Neoclassical orthodoxy . . . . . . . . . . . . . . . . . . 14 2.6.3 State-based money theories . . . . . . . . . . . . . . . 15 2.6.4 Public-Private “deal” . . . . . . . . . . . . . . . . . . . 15 2.7 Blockchain............................. 15 2.8 DigitalSignatures......................... 21 2.9 Digital Certificates . . . . . . . . . . . . . . . . . . . . . . . . 22 2.10Cryptocurrency.......................... 24 2.11Bitcoin............................... 25 2 2.12 Consensus Algorithms . . . . . . . . . . . . . . . . . . . . . . 31 2.12.1 Non-Byzantine Consensus Algorithms . . . . . . . . . 32 2.12.2 Byzantine Consensus Algorithms . . . . . . . . . . . . 32 2.13Stablecoins ............................ 35 2.14LocalCurrency .......................... 36 3 Scenario for Implementation 38 3.1 Scenario1............................. 38 3.2 Scenario2............................. 39 3.3 The Actors Involved . . . . . . . . . . . . . . . . . . . . . . . 39 3.4 Where can it be used? . . . . . . . . . . . . . . . . . . . . . . 40 3.5 Advantages and Disadvantages . . . . . . . . . . . . . . . . . 40 4 Algorithm for the IOU 41 4.1 Structure of an IOU . . . . . . . . . . . . . . . . . . . . . . . 41 4.2 LifecycleofanIOU........................ 42 4.3 AlgorithmsinIOU ........................ 43 4.3.1 SHA-256 Hashing Algorithm . . . . . . . . . . . . . . 43 4.3.2 The Elliptic Curve Digital Signature Algorithm (ECDSA) 45 4.4 IOUasaCurrency ........................ 46 4.4.1 Utilizing IOU as Local Currency: Scenario 1 . . . . . . 47 4.4.2 Utilizing IOU as Local Currency: Scenario 2 . . . . . . 49 4.5 Distribution of Public Keys . . . . . . . . . . . . . . . . . . . 53 4.5.1 Offline Distribution . . . . . . . . . . . . . . . . . . . . 53 4.5.2 Community-Led Digital Certificate Verification System 54 4.5.3 Diffie–Hellman Key Exchange Algorithm . . . . . . . . 55 4.6 Challenges and Solutions in Digital Certificate Verification for IOUTransactions......................... 56 4.7 Solving Double Spending Problem . . . . . . . . . . . . . . . . 57 4.8 Consequences of Debt Default . . . . . . . . . . . . . . . . . . 57 4.9 IOUAttacks............................ 58 4.10 Feasibility of IOU as currency . . . . . . . . . . . . . . . . . . 59 5 Conclusion 61 3 ListofFigures 1 Blockchain Architecture . . . . . . . . . . . . . . . . . . . . . 19 2 Merkle Tree Structure . . . . . . . . . . . . . . . . . . . . . . 20 3 Digital Signature - Signing and Verifying . . . . . . . . . . . . 22 4 Transaction ............................ 26 5 TimestampServer ........................ 27 6 ProofOfWork .......................... 28 7 Proof Of Work Algorithm Flowchart . . . . . . . . . . . . . . 29 8 PBFT Algorithm Workflow . . . . . . . . . . . . . . . . . . . 34 9 Elliptic Curve Cryptosystem (ECC) . . . . . . . . . . . . . . . 46 10 IOU as a Currency - Scenario 1 . . . . . . . . . . . . . . . . . 49 11 IOU as a Currency - Scenario 2 . . . . . . . . . . . . . . . . . 52 4 Acknowledgments I would like to express my deepest gratitude to all those who have contributed to the completion of this thesis. First and foremost, I extend my sincere appreciation to Prof. Dr. Ing. Thomas Schwotzer, my primary evaluator, for his invaluable guidance, support, and encouragement throughout this journey. His expertise and insightful feedback have been instrumental in the development of this thesis. I am also grateful to Prof. Dr. Alexander Huhn, my second evaluator. His knowledge and experience have been valuable in shaping this thesis. I am indebted to the faculty and staff of HTW Berlin - Hochschule für Technik und Wirtschaft Berlin for providing a conducive environment for academic growth and learning. Special thanks to my family and friends for their unwavering support, understanding, and encouragement during the ups and downs of this endeavor. Their belief in me has been a constant source of strength. Lastly, I would like to dedicate this thesis to all those who strive to innovate and advance the field of IT and Digitalization. May our collective efforts contribute to shaping a more inclusive and efficient digital ecosystem. Nikhil Amin 5 Abstract This thesis investigates the concept of a Digital Bond Exchange System, also referred to as an IOU in this paper, within loosely coupled mobile systems, focusing on their application as a localized currency. By examining various forms of money over 5000 years of history, this study examines the implications of an IOU in small, localized communities, without relying on blockchain technology. Employing a combined approach involving literature review and scenario analysis, a conceptual framework is proposed for implementing the IOU system, assessing its feasibility and potential advantages in localized communities. The research seeks to address key inquiries surrounding the viability of an IOU as a localized currency and strategies for their implementation without the intricate complexities associated with blockchain technology. Furthermore, it delves into the basics of digital cryptocurrencies, and the requisite technological components, including various cryptographic algorithms essential for the development of an IOU. Through an interdisciplinary lens, this study aims to offer insights into the practical application and implications of an IOU as a form of localized currency, shedding light on its potential role in contemporary economic landscapes. 6 1 Introduction The study commences with an examination of diverse historical and contemporary currency systems on a global scale, analyzing their societal impacts. The research seeks to assess the potential of digital bonds as a localized currency system. Of particular interest is the examination of an alternative currency model tailored for small, localized communities, without relying on blockchain technology. Consequently, the study emphasizes the importance of evaluating the feasibility of such a system beyond theoretical considerations. This investigation intersects historical analysis of money, blockchain technology, cryptographic algorithms, local economic dynamics, and innovative digital currency framework. Methodologically, the research employs a combination of literature review and case scenario analysis to achieve its objectives. 1.1 Background and Motivation This research aims to propose a conceptual framework for a Digital Bond Exchange System tailored particularly or local communities, driven by the acknowledgment of the shortcomings of traditional financial systems in meeting their needs. In such communities, conventional currencies and banking systems may prove impractical, necessitating the exploration of alternative solutions. By concentrating on this system, the research aims to bridge this gap by utilizing digital technologies that are not too complex to enable efficient value exchange. The impetus for this initiative lies in empowering individuals within local communities, granting them enhanced financial independence and adaptability in handling economic transactions. Additionally, the study intends to assess the feasibility and advantages of implementing a Digital Bond Exchange System, underscoring the importance of ensuring practicality and real-world benefits. To this end, scenarios have been developed to offer valuable insights into the feasibility and ramifications of adopting such a localized currency system. 1.2 Research questions 1. How can Bonds/IOUs be used as a localized form of currency? 2. How to implement such a localized currency without Blockchain technology? 7 1.3 Methodology The methodology used to support the contents of this thesis includes two key components, which are: 1. Literature research A comprehensive examination of existing literature on money, local currencies, blockchain technology, cryptography, algorithms, information security, and economic theories was conducted to understand the theoretical framework and historical context. 2. Scenarios for Implementation Two hypothetical scenarios were developed to explore the practical application and implications of using IOUs as a form of local currency within small communities, providing insights into their feasibility and potential benefits in real-world settings. 8 2 Fundamental concepts 2.1 What is Money? Money is defined as something generally accepted as a medium of exchange, a measure of value, or a means of payment. Hence, from this definition, we understand that the foundation of money is based on trust. For anything to be of general acceptance can only be possible by trust. If people don’t have trust that others will accept anything given to them as money, then they too won’t accept that as a form of money [Byl04]. Money like any valuable item lacks intrinsic utility; its acceptance is based upon the assumption that others will recognize its value. In other words, its value depends on the importance that people place on it and it is socially accepted [Gra11]. 2.2 History of Money Money has been a part of human history as long as 5000 years in one form or the other [Gra11]. Long before the advent of contemporary monetary systems, human societies engaged in various modes of exchange. Traditional economics literature often references the Barter System as a predominant method of exchanging goods and services in ancient times. Under this system, individuals would directly trade commodities or services without the involvement of any central authority or external intermediary. Transactions occurred based on mutual agreement, with participants exchanging items or services if both parties perceived a tangible benefit from the exchange. The notion of the Barter system serving as a precursor to modern currency was initially posited by the 18th-century Scottish philosopher Adam Smith in his book, ’The Wealth of Nations’. But numerous prominent anthropologists hold different perspectives on the Barter system, contending that credit 1and trust-based systems were the original form of money, while Barter emerged later primarily in preindustrialized societies where transactions occurred beyond a familiar cultural context [Gra11]. Various primitive forms of money emerged throughout history, each serving as a medium of exchange in different cultures and regions. Across the globe, commodities ranging from salt to tobacco have functioned as forms of currency at various points in time. The ancient Babylonians and Assyrians utilized barley for transactions. Almonds were utilized as money by natives in 1Credit is defined as the ability of a person or an entity to obtain goods or services before payment, based on the trust that payment will be made in the future. 9 ledger consistency, asymmetric cryptography 4using Digital Signature and Distributed Consensus algorithms have been integrated into the Blockchain system [Zhe+17]. One of the well known applications of blockchain technology is the cryptocurrency Bitcoin. A node within a blockchain denotes a computational device actively engaged in a peer-to-peer network, contributing computing power to the network. The blockchain network constitutes a collection of such nodes implementing a specific blockchain peer-to-peer protocol. This network operates in a fully federated, decentralized, and distributed manner, with all nodes collaboratively orchestrated and coordinated. The primary responsibility of a blockchain node is to ascertain the correctness and validity of information within a block, storing the accurate data. In accordance with their functions within the blockchain network, nodes can be broadly categorized into three types [Xio+22]: 1. Broadcast Nodes: These nodes exclusively transmit transaction information while accepting a limited amount of blockchain data. 2. Complete Nodes: These nodes store the entire blockchain information and perform various functions such as initiating transactions, propagating transactions, and verifying data consistency. 3. Mining Nodes (Miners): Nodes equipped with substantial computing power to generate new blocks and broadcast transactions. They play a pivotal role in supporting the stable and efficient operation of the blockchain system. This classification reflects the diverse roles and functionalities that nodes fulfill in ensuring the integrity and functionality of the blockchain system [Xio+22]. Key characteristics of Blockchain technology [Zhe+17] 1. Decentralization: Blockchain eliminates the need for a trusted central system such as a central financial institution, in turn eliminating the associated costs and performance bottlenecks at the central servers. Instead, it leverages consensus algorithms to uphold data consistency across a distributed network. 4Asymmetric cryptography, also known as Public key cryptography uses a pair of keys; a public key, which is known publicly, and a private key, which is known only by its owner. A message encrypted by one of the keys can be decrypted only by the paired key [HN17] 16 2. Persistence: Transaction validation occurs promptly, and the acceptance of invalid transactions can be restricted. Once transactions are incorporated into the blockchain, their deletion or rollback is exceedingly challenging. The immediate identification of blocks containing invalid transactions is possible within the blockchain system. 3. Anonymity: Each user possesses the capability to engage with the blockchain through a uniquely generated address, ensuring the confidentiality of their actual identity. 4. Auditability: The verification and tracking of transactions within the Blockchain are straightforward. Blockchain’s capacity to facilitate transactions without the need for banks or intermediaries makes it applicable in diverse financial services, encompassing digital assets, remittance, and online payments. Furthermore, the versatility of blockchain extends to its integration into other domains, including smart contracts 5, public services, the Internet of Things, and security services. [Zhe+17] Current blockchain systems are categorized roughly into three types: public blockchain, private blockchain and consortium blockchain. In public blockchain, all records are visible to the public and everyone could take part in the consensus process. In a consortium blockchain, only a group of pre-selected nodes would participate in the consensus process. As for private blockchain, only those nodes that come from one specific organization would be allowed to join the consensus process. The main difference among the three types of blockchains is that public blockchain is decentralized, consortium blockchain is partially centralized and private blockchain is fully centralized as it is controlled by a single group [Zhe+17]. Disadvantages of Blockchain • Scalability is a major disadvantage in blockchain systems, particularly as transaction volumes surge over time. The increasing number of transactions contributes to the bulkiness of the blockchain, as each node must store all transactions for validation purposes. This necessity arises from the need to verify whether the source of a given transaction has been previously spent or remains unspent. Additionally, the original constraints on block size and the time required to generate new blocks limit the 5Smart contract is a computer program or protocol that runs on a blockchain and executes the terms of an agreement between parties automatically when certain conditions are met. 17 throughput of the Bitcoin blockchain to around 7 transactions per second. Consequently, this capacity falls short of meeting the demand for processing millions of transactions in real-time [Zhe+17]. • Privacy leakage in blockchain technology is another significant concern despite the inherent anonymity provided by public and private keys. While users transact with their keys without revealing their true identities, the transparency of blockchain exposes transactional details and balances associated with public keys. Recent research has demonstrated the potential for identifying users through their Bitcoin transactions, undermining transactional privacy [Zhe+17]. • Selfish Mining, a known vulnerability in blockchain systems, involves colluding miners seeking to exploit the network for personal gain. Selfish miners withhold their mined blocks instead of immediately broadcasting them. Only under specific conditions will they reveal their private branch to the public. Since the private branch tends to be longer than the existing public chain, other miners accept it. Consequently, honest miners waste resources on an obsolete branch while selfish miners continue mining on their private chain unhindered by competition, thereby aiming to maximize their profits [Zhe+17]. Architecture of Blockchain Blockchain is a sequence of blocks or a chained data structure, where distinct data blocks are interconnected based on their generation time in ascending order. Each block in the chain comprises a collection of transaction data, composed of a block header and a block body. The block header and body together constitute a data block. Each block in the sequence possesses a singular parent block, with the block header incorporating the hash of the preceding block. The initial block in the blockchain is referred to as the genesis block, distinguished by its lack of a parent block [Xio+22]. Figure 1 shows the Architecture of Blockchain technology. Specifically, the block header encompasses: [Xio+22] 1. Version: This parameter tracks software or protocol updates. 2. PrevBlock Hash: The current block includes the hash value of the preceding block. The hash is generated irreversibly through a hash algorithm, creating a unique and fixed-length value that distinctly identifies the block. Storing the hash value of the previous block in the current block ensures a linkage between the two. 18 Figure 1: Blockchain Architecture 3. Merkle Root: This records the hash value of the Merkle tree root for the block. 4. Timestamp: The creation timestamp of the block is documented. This timestamp ensures the sequential storage of blockchain data based on the block’s recorded generation time, facilitating the traceability of data sources within the chain. 5. Difficulty Target: This represents the difficulty coefficient that needs to be solved for the current block. 6. Nonce: an 4-byte field calculated by the node using computational power, the nonce is generally a value smaller than the specified target. The block body serves as the repository for transaction content and associated information. Each transaction entry contains a digital signature which is used to protect the integrity of the block data. In the blockchain, all transaction information undergoes processing within the Merkle tree structure located in the block body. The transaction details find their place in the leaf nodes of the Merkle tree which are paired through hash calculations and combined, generating a hash value that extends up to the root node of the Merkle tree. Nodes across the entire network can access transaction information on the tree node. The hash value of the Merkle tree root reflects the collective node information of the entire network and becomes altered if any transaction 19 information is tampered with maliciously. The Merkle tree structure provides a certain level of security for the blockchain [Xio+22]. At its core, a Merkle tree is essentially a hierarchical arrangement of hash values. It starts with a set of concrete data, represented as Merkle leaves, progresses through intermediate hashes (Merkle branches), and culminates in the Merkle root—a singular hash value that encapsulates all the data. A sample representation of a Merkle tree structure is shown in Figure 2 below. Figure 2: Merkle Tree Structure The operation of blockchain follows three main stages: block creation, consensus verification, and ledger maintenance. Firstly, in the block creation stage, nodes on the blockchain network gather transaction details and compete to generate new blocks using their computing power. Nodes that successfully create blocks are rewarded according to the blockchain protocol’s incentive mechanism, often with economic benefits, encouraging them to contribute computing power consistently. Secondly, in the consensus verification stage, the node responsible for block creation broadcasts the newly created block to the entire network. All nodes in the network receive and verify numerous blocks, ensuring the accuracy of their content through a consensus algorithm. The verified data is then recorded in the blockchain ledger. Lastly, in the ledger management phase, nodes store the verified data for an extended period and conduct retrospective checks using timestamps and hash values stored in the block. This enables upper-layer applications to access ledger information through a query interface. Throughout these stages, nodes continuously pro20 vide computing power, ensuring the blockchain remains decentralized, open, stable, trustworthy, and transparent [Xio+22]. 2.8 Digital Signatures A digital signature is similar to a handwritten signature, albeit employing digital means rather than traditional pen and paper. Digital signatures operate on the principles of cryptography utilizing private and public key encryption techniques [Pat+19]. Digital signature infrastructures serve several key objectives. Firstly, messages authenticated using a digital signature offer recipients assurance regarding the authentic source of the message, confirming it originated from the purported sender. Secondly, they guarantee that the message’s content remains unaltered throughout its transmission from sender to recipient, thereby enhancing data integrity along the communication pathway. Lastly, non-repudiation by the signer ensures that signers cannot deny their signature on data, reinforcing accountability and trust in digital transactions [Lin23]. Digital signature algorithms rely on a combination of two major concepts, public key cryptography and hashing functions. Every user possesses a set of private and public keys. The private key is to be held in strict confidentiality while the public key can be distributed to other users. The digital signature process typically comprises two phases: the signing phase and the subsequent verification phase [Zhe+17]. Consider the following that describes the signing and the verification phase in detailed steps. Figure 3 illustrates the same [Lin23]. If a Sender wants to digitally sign a message they are sending to Receiver, they performs the following actions: 1. Sender generates a message digest (i.e. hash) 6of the original plaintext message using one of the cryptographically sound hashing algorithms. 2. Sender then encrypts only the message digest using their private key. This encrypted message digest is called the digital signature. 3. Sender appends the signed message digest to the plaintext message. 4. Sender transmits the appended message to the Receiver. 6Hash, also referred to as message digests, is a super-condensed representation of a message’s content, generated through a Hashing algorithm. We discuss the Hashing algorithm in Section 4.3.1. 21 When Receiver receives the digitally signed message, they reverse the procedure, as follows: 1. The Receiver decrypts the digital signature using the Sender’s public key. 2. Receiver uses the same hashing algorithm to create a message digest of the full plaintext message received from Sender. 3. Receiver then compares the decrypted message digest they received from Sender with the message digest they computed themself. If the two digests match, they can be assured that the message they received was sent by the Sender. If they do not match, either the message was not sent by Sender or the message was modified while in transit. Figure 3: Digital Signature - Signing and Verifying 2.9 Digital Certificates Digital certificates are pivotal in establishing confidence among parties engaged in communication by ensuring the authenticity of the individuals involved. These certificates essentially serve as authenticated representations of a person’s public key, acting as a digital portrayal of their identity. Enclosed within a digital certificate is the public key, along with details about its owner and the entity associated with the certificate. This association binds a public key to a specific person or object, affirming their identity. The authenticity of a digital certificate can be verified by anyone, thereby instilling trust in the certificate and its associated identity. By confirming 22 that a certificate has been signed by a trusted authority or entity, users can rely on the validity and genuineness of the associated public key. The utilization of digital certificates is essential for establishing trust and facilitating secure communication in diverse scenarios. The formulation of digital certificates aligns with the international standard X.509, which governs their structure and content. This standard ensures consistency and compatibility across various systems and applications. X.509-compliant certificates encompass a comprehensive array of data, furnishing vital information about the certificate itself and the entity it represents [Hug22]. Certificates conforming to the X.509 standard encapsulate the subsequent details [Hug22]: 1. Subject Distinguished Name: Identifies uniquely a person, device, or computer. 2. Issuer Distinguished Name: Uniquely identifies the Certification Authority that issued the certificate. 3. 128-bit serial number. 4. ValidFrom: Commencement date and time. 5. ValidTo: Expiry date and time. 6. Public key. 7. Key Usage Flags: Including digital signature and key encipherment. 8. Enhanced Key Usage Flags: Such as Server Authentication, Client Authentication, and Email Security. 9. URL of the Certificate Revocation List (CRL): Associated with the particular certificate. 10. URL of the OCSP (Online Certificate Status Protocol) 7server: Associated with the particular certificate (if available). 11. Digital signature: Generated by the Certification Authority at the time of issuance using their signing private key, encompassing all preceding information. 7Online Certificate Status Protocol (OCSP) is an Internet protocol used for obtaining the revocation status of an X.509 digital certificate. 23 Public Key Infrastructure (PKI) The collective assembly of equipment, legal agreements, and trusted processes essential for securely issuing and managing digital certificates is known as a Public Key Infrastructure (PKI). Understanding PKI necessitates a grasp of digital certificates, as they are the primary entities managed and issued within this framework [Hug22]. However, the Public Key Infrastructure (PKI) is widely used across the globe. It was designed with trust as a fundamental principle. Its cryptographic framework is robust, delineating clear roles for each participant, and supported by mature hardware and widely utilized application program interfaces (APIs) 8[SHC19]. From a technical perspective, a Public Key Infrastructure (PKI) serves as a security framework responsible for generating and overseeing digital certificates to facilitate the application of asymmetric-key cryptography. This infrastructure comprises several components, notably a Certification Authority (CA), which issues digital certificates to requesting entities or subjects, binding their public key to their identity. Additionally, a Registration Authority (RA) plays a role in validating the identities of these end entities. Furthermore, a secured repository is utilized to store and distribute digital certificates, along with maintaining Certificate Revocation Lists (CRLs) which consist of the serial numbers of digital certificates issued by a CA that have been revoked, accompanied by the precise date and time of revocation. Lastly, a Certification Policy (CP) outlines the certification rules. Certificate authorities may revoke digital certificates due to reasons such as compromise, erroneous issuance, changes in certificate details, or alterations in security associations. The primary functions of a PKI consist of identity authentication and digital certification, serving as a foundational element for various applications reliant on public key cryptography, particularly for authentication and certification purposes, such as digital signatures [HN17]. 2.10 Cryptocurrency Cryptocurrencies had gained worldwide attention from investors, regulators, and the media, particularly since the introduction of Bitcoin by Nakamoto in a research paper in 2008. These digital currencies operate as peer-to-peer electronic cash systems, enabling direct online payments between parties without the involvement of any traditional financial institutions, hence making them completely decentralized systems. A distinctive feature of cryptocurrencies is their detachment from any higher authority, devoid of physical representation, 8The Application Programming Interface (API) serves as a software-to-software interface, establishing the terms for communication between applications across a network without requiring user intervention [De23]. 24 and setting them apart from the majority of other financial assets [Cor+19]. In contrast to conventional financial assets, the value of cryptocurrencies is not tied to tangible assets, a country’s economy, or a specific firm. Instead, their value is intricately linked to the security of an algorithm that meticulously traces all transactions. The increasing adoption of cryptocurrencies was attributed to their low transaction costs, decentralized peer-to-peer system, and absence of government control [Cor+19]. 2.11 Bitcoin One of the well-known applications of blockchain technology is the cryptocurrency Bitcoin which was the first cryptocurrency. The concept was introduced in October 2008 through a renowned white paper by a pseudonymous figure Satoshi Nakamoto and its open-source implementation was released in 2009 [KKO17]. The idea behind the concept was to create an electronic payment system based on cryptographic proof rather than trust, allowing parties to be involved in transactions directly instead of a trusted third party such as centralized financial institution. The primary objective of this concept was to mitigate the double spending issue by employing a peer-to-peer distributed timestamp server, which generates computational proof of the chronological order of transactions [Nak08]. Transaction Transactions in a Bitcoin is performed by digital coins, which are represented as a chain of digital signatures. The below diagram illustrates a mechanism through which the owner of such a digital coin can transfer ownership to another individual by establishing a sequence or chain of digital signatures. This process operates by first performing a digital signature of the hash of the previous transaction and the public key of the next owner, then this digital signature is appended to the end of the coin. Consider Figure 4 below with three blocks. Let’s assume that the first block in Figure 4 is owned by Alice and she wants to transfer this to Bob. It would be done by performing a hash of the entire first block and Bob’s public key together. By doing this, Bob’s public key is linked to the previous block. This hash is then signed by Alice’s private key. Bob can decrypt the signature by using Alice’s public key, thus verifying that it was indeed signed by Alice [Nak08]. 25 blockchain and updating existing data, ensuring the reliability of the overall system. Consensus Algorithms aims to achieve consensus among blockchain nodes. Furthermore, the blockchain consensus algorithm must also prioritize considerations of security, scalability, resource consumption, and performance efficiency. Consensus algorithms in a blockchain network are categorized into non-Byzantine fault-tolerant algorithms and Byzantine faulttolerant algorithms based on the consideration of the existence of malicious nodes [Xio+22]. 2.12.1 Non-Byzantine Consensus Algorithms Non-Byzantine Consensus Algorithms find primary application in enclosed environments characterized by a certain degree of isolation and a relatively high level of trust among nodes. Some of the non-Byzantine algorithms are the VR (Viewstamped Replication) algorithm, Paxos algorithm and Raft algorithm. However, there are drawbacks to Non-Byzantine Consensus Algorithms. In scenarios where malicious nodes engage in activities such as data tampering, Non-Byzantine Consensus algorithms face challenges in ensuring data security and system stability. Consequently, the applicability of Non-Byzantine Consensus algorithms becomes constrained when deployed in open networks featuring diverse nodes and lower levels of mutual trust [Xio+22]. 2.12.2 Byzantine Consensus Algorithms As Blockchain contains a network of distributed systems, achieving consensus among untrustworthy nodes presents a variation of the Byzantine Generals (BG) Problem. As per the Byzantine Generals Problem, a group of separate army generals commanding different segments of the Byzantine army surround a city. Some generals advocate for an attack and others for a retreat. However, the success of the attack depends on a unanimous decision, and only a unified front can help attain victory. Consequently, the generals must navigate the challenge of reaching a consensus on whether to attack or retreat. Yet, some generals may be traitors with the intent of thwarting agreement among the loyal generals. To address this challenge, an algorithm is essential to ensure the following conditions [LSP19]: • All the loyal generals agree on the same plan of action: This means that even if there are some traitors among the generals trying to disrupt the plan, the algorithm should make sure that the loyal generals stick to the agreed-upon plan. No matter what the traitors do, the algorithm should ensure that the loyal generals follow the plan. • The plan agreed upon by the loyal generals should be a good one: It’s not enough for everyone to agree; they need to agree on a plan that 32 makes sense. The algorithm should prevent a small number of traitors from convincing the loyal generals to adopt a bad plan. The objective is to ensure that a small faction of traitors cannot cause the adoption of an unfavorable plan by the loyal generals. Byzantine failures, a significant concern in distributed network environments, refers to the challenge of achieving cooperative consensus among distributed nodes, where malicious nodes may exist. Within the context of blockchain technology, an issue may arise from the possibility that individual components within a blockchain network may engage in arbitrary or malicious behaviors, potentially collaborating with other faulty components. As a result, these actions can compromise the accuracy of node calculations within the blockchain, undermining the integrity and reliability of the system [LSP19]. The challenge of consensus in a distributed environment extends to blockchain, where the absence of a central node overseeing ledger uniformity across distributed nodes adds complexity. In this decentralized network, ensuring consistency among ledgers in different nodes becomes a formidable task. Protocols are essential within the blockchain framework to establish and maintain a consensus, addressing the unique challenges posed by its distributed nature. The Bitcoin system uses the POW (Proof of Work) consensus algorithm proposed by Markus Jakobsson, which takes into account the presence of malicious nodes in a blockchain. Few other Byzantine algorithms include PBFT (Practical Byzantine Fault Tolerance) Algorithm, the PoS (Proof of Stake) consensus algorithm, DPoS (Delegated Proof of Stake) algorithm, PoH Algorithm (Proof of Humanity) and CW-PoW (Compute and Wait in the PoW) consensus algorithm. We shall describe PBFT (Practical Byzantine FaultTolerance) Algorithm and PoS (Proof-of-Stake) Algorithm in this paper. 1. PBFT (Practical Byzantine Fault-Tolerance) Algorithm The primary focus of the PBFT algorithm lies in addressing transaction ordering issues within distributed nodes susceptible to Byzantine errors. It ensures consistency among non-Byzantine nodes in the system even when up to one-third of the nodes exhibit Byzantine behavior. Nodes in the PBFT algorithm include the master node and other peer nodes. The system autonomously selects the master node, responsible for distributing and processing information across the blockchain network and verifying its validity [Xio+22]. Assuming 3f + 1 nodes in the PBFT algorithm’s operation, with 1 master node, 2f honest nodes, and f malicious nodes, the algorithm’s operation is divided into three phases: pre-preparation, preparation, and 33 submission. In the pre-preparation phase, the master node dispatches assigned sequence numbers and pre-preparation information to other nodes. As these nodes confirm receipt, the preparation phase commences. Each node broadcasts preparation information to all nodes, excluding itself. Once each node collects 2f + 1 pieces of information, indicating readiness, the confirmation phase initiates. All nodes broadcast confirmation messages to the entire network. Once each node accumulates 2f + 1 confirmation messages, the confirmation phase concludes, and the correct log information is returned and recorded in the blockchain. Figure 8 below illustrates the workflow of PBFT Algorithm. As long as the number of Byzantine nodes remains below 1/3 of the total, the PBFT consensus algorithm operates accurately, ensuring the blockchain system’s reliability and substantially improving security performance. Figure 8 illustrates the workflow of a PBFT consensus algorithm [Xio+22]. Figure 8: PBFT Algorithm Workflow 2. PoS (Proof-of-Stake) Algorithm The Proof of Stake (PoS) algorithm introduces the notion of tokens, utilizing them to designate the node with the highest stake in the system as the accounting node. This stake is calculated based on the quantity and duration of tokens held by a node. Nodes possessing more tokens and holding them for extended periods accrue higher equity. Elevated equity correlates with reduced mining difficulty, enhancing the efficiency of discovering the target value of a random number. Upon successfully obtaining the block’s accounting right, the node’s stake is reset, initiating the next round of stake accumulation. 34 A key advantage of the PoS algorithm lies in its elimination of the intricate mining process, relying solely on proof of stake for securing the accounting right. This streamlined approach reduces block time, transaction processing time, and significantly expedites consensus, thereby enhancing efficiency. Additionally, the PoS algorithm economizes and enhances the utilization of computing resources compared to the Proof of Work (PoW) algorithm [Xio+22]. 2.13 Stablecoins A Stablecoin represents a type of payment token whose value is tethered to an external asset outside the realm of cryptocurrency, typically a fiat currency such as the U.S. dollar or euro. Generally, the Stablecoin token is either fully or partially backed by this external asset, with an assurance from the issuer that it can be exchanged for the referenced asset at any given time. An analogy can be drawn to the early forms of paper notes issued by banks or central banks, which were backed by gold and promised to provide equivalent value in gold upon presentation to the bank. Stablecoins address the volatility issue associated with cryptocurrencies like Bitcoin, making it simpler for individuals to conduct transactions in fiat currency-denominated goods using crypto-assets and facilitating cross-border transfers without concerns about price fluctuations. They offer numerous advantages for traders, allowing them to transition from volatile crypto-assets to Stablecoins seamlessly without exiting the cryptocurrency ecosystem. Moreover, Stablecoins are beneficial for the general public, particularly in facilitating cross-border payments. They enable instantaneous money transfers between users worldwide, often with minimal transaction fees. It’s worth noting that while many Stablecoin tokens utilize fiat currency as their reference asset, some opt for physical commodities like gold instead. Stablecoins can be categorized into three main types: fiat-collateralized, crypto-collateralized, and non-collateralized [Ars22]. • Fiat-collateralized stablecoins typically maintain a fixed value in fiat currency, allowing holders to redeem them for the equivalent amount on demand. This category is the most prevalent in the market, with issuers expected to hold real-world fiat currency reserves off-chain and issue tokens representing these reserves, usually in a 1:1 ratio. This setup assures holders that the stablecoin can be redeemed for the corresponding asset or reserve. • Crypto-collateralised stablecoins are backed by other cryptocurrencies. • Non-collateralized stablecoins are still in experimental phases and lack asset backing. Instead, they depend on mathematical mechanisms to 35 maintain price stability. This is achieved by algorithmically adjusting the coin supply to counterbalance fluctuations in coin demand. 2.14 Local Currency Local currencies or Community currencies belong to the category of complementary currencies, termed so because they operate in complement to a primary currency, thereby contributing to an additional economic benefits. Within this classification, community currencies stand out by their primary objective of fostering more equal, interconnected, and sustainable societies within a distinct and specified group. The classification of such a group may involve various criteria, including geographic boundaries or specific ecological and social goals [Zel20]. Local currencies vary in their structures and requirements. Some local currencies necessitate collateral which means that the individuals must exchange national currency to acquire the local currency. Conversely, others operate on a mutual credit system, leveraging peer pressure as a social collateral mechanism. In this system, members extend transferable loans to one another without interest. Typically confined to specific geographic areas, local currencies are limited to a designated group that accepts them as a supplementary medium of exchange. Since local currencies are often nonconvertible, including into the official national currency, they remain within their defined region of validity and do not experience scarcity. Consequently, they can complement existing currencies by providing consistent liquidity or serving as an additional form of money supply, particularly in scenarios where the official currency’s supply is insufficient [Zel20]. Local currencies have the potential to foster exchange systems that contribute to sustainable development, offering avenues for change through economic, environmental, and social pathways. The economic pathway suggests several dimensions. Firstly, local currencies are anticipated to serve as tools for enhancing local value and preventing economic leakage, thus stimulating localized economic activity and generating a local multiplier effect. Secondly, these schemes may provide a means of recognizing and valuing non-market activities, such as informal work and skills exchange. Thirdly, they can serve as a mechanism for financially marginalized individuals to access goods and services, while also facilitating trade among local businesses that are perceived as being more supportive of the community [JH18]. The social pathway is often regarded as the primary objective of local currency systems. They can incentivize neighborly support, foster trust among 36 the community members, enable participation by marginalized social groups, and underscore the value of skills beyond those recognized in the labor market [JH18]. Lastly, the environmental pathway highlights the potential contribution of local currencies to sustainable development by promoting reduced ecological footprints through localized consumption, facilitating resource sharing and reuse, addressing psychological needs for recognition and belonging through social interaction rather than consumption, and encouraging proenvironmental behavior [JH18]. In a local community be it a town, a village, a religious society, or a small family setting, virtually anything has the potential to serve as currency, depending upon the shared understanding among its members that there exist willing recipients ready to accept it in exchange for debt settlement [Gra11]. This is the premise of this paper where we discuss in the following sections how an IOU can be used as a form of local currency within a small community or a family setting. 37 3 Scenario for Implementation This segment delves into two scenarios showcasing the use of an IOU as a local currency system. Within these contexts, the scenario introduces characters who play specific roles in the transactions, including Alice, Bob, Charlie, and Dave. These individuals represent loosely coupled mobile systems. By exploring these scenarios, we aim to understand the multifaceted dynamics of small local economies and the diverse means through which transactions occur. Furthermore, the inclusion of characters such as Alice, Bob, Charlie, and Dave serves to facilitate a deeper understanding of the interpersonal interactions inherent in local currency systems. These scenarios highlight the interplay between individuals and their economic transactions, emphasizing the importance of trust in shaping the functioning of local economies. 3.1 Scenario 1 Let us take the first scenario which takes place between two individuals, Alice and Bob. In a simple act of exchange of goods or services between the two, Alice gives her jacket to Bob not seeking a favor in return, but rather hoping for an exchange of something else based on equivalence. This something else could be any material goods or any services that Bob could provide to Alice. Bob decides to express his gratitude by promising something of equal value. This promise takes the form of a casual yet significant IOU, a note that says Bob owes Alice something in return. Both Alice and Bob would be in possession of the IOU which is signed by them and mentions the details of the transaction, be it goods or services. This IOU is a symbol of trust and mutual understanding. Alice, in accepting the IOU, believes in Bob’s word and is willing to wait for the promise to be fulfilled. Now, when Bob has something valuable or useful that he can offer in return, he can redeem the IOU. The IOU is redeemed either by giving back any goods of equivalent value that Alice is in need of or by providing any kind of services that Alice would be in need of. Bob could redeem the IOU at once or alternatively, over a period of time by giving Alice multiple goods or services of smaller value. In such a case, as Bob fulfills the IOU, either in one comprehensive transaction or gradually over time, entries are made in the IOU held by both Alice and Bob to reflect the ongoing exchange. These goods or services could be mutually decided and agreed upon by both Alice and Bob. Once the value of the IOU in its entirety has been redeemed, the IOU is said to be closed or nulled. This IOU that results from a simple act of exchange sets the stage for a unique form of currency. 38 3.2 Scenario 2 In an extension of the previously discussed scenario, we examine a situation where Alice, after receiving an IOU from Bob, opts to transfer it to a third party, Charlie, to whom Alice has a previously outstanding debt. This alteration in the dynamic results in Charlie becoming the recipient of the IOU, and concurrently, Bob incurs a debt to Charlie equivalent to the IOU’s stated value. This sequential progression initiates a chain of reciprocal IOU transactions, with participants sometimes navigating the dual roles of creditor and debtor. In the next phase, if Charlie, now holding the IOU, decides to conduct a transaction with another member of the community, say Dave, by acquiring a jacket from him, a further layer of complexity is introduced. Dave facilitates this transaction by accepting the IOU from Charlie, thereby affirming the creditworthiness of Bob, the original debtor. Theoretically, the continued circulation of these IOUs within the community is dependent upon the sustained faith in Bob’s unwavering commitment to meeting his financial obligations. It is pivotal to note that the IOU’s functionality as a local currency hinges on Bob not paying the settlement of his debt. 3.3 The Actors Involved In Scenario 1, the main actors involved are Alice and Bob. Alice acts as the creditor, providing goods or services to Bob without seeking an immediate return. Bob, in turn, becomes the debtor by accepting the goods or services and promising to repay Alice with something of equivalent value in the future. The IOU serves as a tangible representation of Bob’s debt to Alice, with both parties agreeing to its terms and conditions. As Bob fulfills his promise by redeeming the IOU through either goods or services, the roles of creditor and debtor cease to exist between Alice and Bob. In Scenario 2, the dynamics expand to include additional actors such as Charlie and potentially Dave. Alice, having initially been involved in IOU transaction with Bob, was a creditor to Bob and also a debtor to Charlie based on a previous debt. By transferring the IOU to Charlie, Alice shifts the creditor role to Charlie. If Charlie further engages in transactions with Dave using the IOU, Dave becomes part of the creditor-debtor network, affirming Bob’s creditworthiness. Throughout these exchanges, the actors navigate the dual roles of creditor and debtor, with the continued circulation of IOUs depending on their trust in Bob. This scenario illustrates the interconnected nature of local economies and the reliance on mutual trust among community members to sustain the functioning of IOUs as a form of local currency. 39 3.4 Where can it be used? This unique form of local currency can find application in various settings, particularly within closely-knit social structures such as small village communities, familial units, and closely connected households. The scenario presented between Alice and Bob exemplifies its potential within individual interactions within small communities, where everyone has a degree of familiarity with each other. Within these intimate settings characterized by interpersonal familiarity and mutual acquaintance, the operational dynamics of such a form of local currency can seamlessly integrate. The effectiveness of this local currency system is dependent upon the ability of participants to keep track of transactions and maintain a level of trust. Any divergence from established norms or failure to honor commitments carries the risk of undermining trust and social reputation. While also scalable to dispersed communities, it may encounter challenges in larger, more complex urban settings where keeping track of numerous transactions becomes demanding. 3.5 Advantages and Disadvantages The implications of employing simple bonds or IOUs as a local currency are multifaceted. On the positive side, it fosters a sense of trust and mutual understanding between participants. The IOU can become a symbol of commitment, and its redemption reinforces the reciprocal nature of the relationship. The flexibility in the redemption process, allowing for gradual fulfillment or comprehensive transactions, adds versatility to this system. However, challenges exist. Scaling this system to accommodate the diverse transactions of a medium-sized community presents logistical hurdles. The need for a significant number of IOUs raises questions about the financial capacity of the initial issuer. Additionally, the system relies heavily on the ongoing commitment of participants to fulfill their promises, and any breach of trust could disrupt the functioning of such a local currency. Overall, this form of local currency, initiated by simple exchanges and embodied in IOUs, introduces a dynamic economic model based on trust and reciprocal relationships. While its effectiveness is notable in smaller, closely-knit communities, challenges arise in scaling it to larger, more complex settings. The balance between trust, commitment, and logistical feasibility shapes the advantages, and disadvantages of an IOU as a local currency system. 40 4 Algorithm for the IOU 4.1 Structure of an IOU The IOU structure encompasses essential elements to document the details of an IOU. It starts with a header containing basic information such as the Name and a unique identification number, followed by Date and Time details when the IOU was issued and then the identification of the parties involved. The specifics of the transaction are also articulated which includes details about the goods or services exchanged, its value the date of exchange, and then comes the terms and conditions, including redemption details. Optionally, a witness section can be included for added authentication. The IOU’s status and history section helps track its progression, and space is provided for any additional terms that may be relevant to the specific transaction. 1. Header: •Title: IOU •IOU Number: [Unique Identifier] 2. Timestamp: •Date: [Date of Issuance] •Time: [Time of Issuance] 3. Parties Involved: •Creditor’s Name: [Alice] •Debtor’s Name: [Bob] •Third Party (if applicable): [Charlie] 4. Transaction Details: •Description of Goods/Services Exchanged: [Description of the exchanged item, e.g.:- jacket] •Value Amount (Optional): [Monetary value or equivalent value of the goods/services] •Date of Exchange: [Date when the exchange occurred] •Time of Exchange: [Time when the exchange occurred] 5. Terms and Conditions: •Terms of Redemption: [Conditions and terms agreed upon for redemption] 41 6. Digital Signature by Bob Upon receiving the IOU and verifying its authenticity, Bob reviews the terms and, if in agreement, digitally signs the document using his private key. Bob’s signature indicates his acknowledgment and acceptance of the debt. Again, he encrypts his digitally signed IOU and the original IOU with Alice’s public key. 7. Return to Alice Bob sends the encrypted IOU back to Alice who also verifies it. The document now bears both Alice’s and Bob’s digital signatures, symbolizing mutual consent and commitment to the specified terms. 8. Copy Retention by Bob Bob retains a copy of the digitally signed IOU with himself. This copy serves as a ledger entry and proof of the transaction. It includes the digital signatures of both parties, making it tamper-evident. 9. Verification of Signatures In subsequent transactions related to the owed amount, both Alice and Bob can verify the authenticity of the IOU by checking each other’s digital signatures. This process adds a layer of trust to the local currency system. The entire process described above is illustrated in Figure 10 below. 48 Figure 10: IOU as a Currency - Scenario 1 The digitally signed IOU now functions as a local currency between Alice and Bob. Either party can reference the IOU for the owed value and terms. The document serves as a trustworthy record of the debt. 4.4.2 Utilizing IOU as Local Currency: Scenario 2 In Scenario 2 as described in Section 3.2. where Alice wishes to transfer the IOU to Charlie, establishing a sequential chain of IOU transactions, the steps described below is followed. This process ensures the continuation of the IOU’s functionality as a local currency. The subsequent explanation outlines the transfer from Alice to Charlie, with Bob’s continued involvement: 1. IOU Transfer from Alice to Charlie Alice, who is the current creditor of the IOU, opts to transfer it to Charlie for various reasons, such as resolving a prior debt owed to him. Alice and Charlie reach an agreement on the terms of the IOU transfer. These terms can include the new debtor-creditor relationship, any associated conditions, and specific stipulations, all of which are duly amended and 49 recorded in the IOU document before the transfer initiation. Alice then initiates the transfer. 2. Hash of the IOU Alice hashes the IOU using the SHA-256 Hashing Algorithm. 3. Digital Signature by Alice Alice digitally signs the hashed IOU using her private key using ECDSA Algorithm. She then attaches the original IOU with the digitally signed IOU. Alice attaches the original IOU along with the digitally signed IOU and encrypts both these using Charlie’s public key. Alice encrypts the hashed IOU using her private key which in turn generates Alice’s digital signature. This signature serves as Alice’s commitment to the specified terms and also ensures the integrity and authenticity of the document. Alice attaches the original IOU along with the digitally signed IOU and encrypts both these using Charlie’s public key. 4. Transmission to Charlie Alice securely transmits the encrypted IOU to Charlie through a secure communication channel. 5. Verification by Charlie Charlie receives the encrypted IOU from Alice. He first decrypts the entire encrypted document using his private key, upon which he gets the original IOU and Alice’s digital signature. He decrypts Alice’s digital signature using Alice’s public key. He verifies the contents of the IOU and copies it into a new IOU to create his copy of the IOU. He then hashes the original IOU using the same SHA-256 Hashing Algorithm to get a hash value which he compares with already hashed IOU that was obtained on decrypting Alice’s digital signature. If the two digests match, he can be assured that the IOU was sent by Alice. 6. Digital Signature by Charlie Next Charlie digitally signs the IOU using his private key. This signature signifies Charlie’s acknowledgment and acceptance of the transferred debt. 7. Transmission to Bob Charlie then encrypts this digitally signed IOU using Bob’s public key and sends the encrypted IOU to Bob through a secure communication channel. 50 8. Verification by Bob Bob receives the encrypted IOU from Charlie. He first decrypts the entire encrypted document using his private key, upon which he gets the original IOU and Charlie’s digital signature. He decrypts it using Charlie’s public key, upon which he has both the hashed IOU and the original IOU. He verifies the contents of the updated IOU that primarily has new creditor and debtor relationship. He then hashes the IOU using the same SHA-256 Hashing Algorithm to compare it with already hashed IOU that was included in Charlie’s digital signature. He then compares the hash he received from Charlie with the hash he computed himself. If the two digests match, he can be assured that the IOU was sent by Charlie. 9. Digital Signature by Bob Upon receiving the IOU, Bob reviews the terms and, if in agreement, digitally signs the document using his private key. Bob’s signature indicates his acknowledgment and acceptance of the debt. 10. Return to Charlie Bob sends the digitally signed IOU back to Charlie. The document now bears both Charlie’s and Bob’s digital signatures, symbolizing mutual consent and commitment to the specified updated IOU. The updated IOU now reflects Bob’s debt to Charlie, which serves as a ledger entry and proof of the transaction. It includes the digital signatures of both Charlie and Bob, making it tamper-evident. The entire process described above is illustrated in Figure 11 below. 51 Figure 11: IOU as a Currency - Scenario 2 52 The IOU, now with both Charlie and Bob’s digital signature and Bob’s incurred debt, can continue circulating within the community. It remains dependent on the community’s sustained faith in Bob’s commitment to meeting his financial obligations. Advantages of IOU 1. Simplicity: An single IOU document simplifies the process, reducing the need for multiple documents. 2. Mutual Consent: Both parties actively participate in the creation and signing of the IOU, reinforcing mutual consent. 3. Tamper-Evidence: The digital signatures on the IOU enhance tamperevidence, providing a secure and verifiable record. 4. Ease of Implementation: In contrast to the intricate and complex technological requirements of Blockchain, the IOU implementation outlined in this paper offers a simpler approach to implementation. 4.5 Distribution of Public Keys In the case of the IOU as a local currency, as mentioned earlier that the IOU that is created and then digitally signed with the senders private key. Now in order for the receiver to decrypt the signature, they would require the senders public key. One of the most significant challenges in implementing encryption lies in the secure distribution of public keys among communicating parties. This paper explores few primary methods that could be used for the secure exchange of public keys: Offline distribution, Digital Certificates, and the Diffie–Hellman key exchange algorithm. 4.5.1 Offline Distribution Offline distribution emerges as a straightforward approach for exchanging public keys within the context of utilizing IOUs as a currency in small-scale communities or family settings. The parties engaged in the IOU exchange can meet at a predetermined location. For instance, within a family environment, individuals may gather in a communal area like a living room to exchange their respective public keys. In a community setting, a secure community hall or a secluded venue could serve as the meeting point. This method may also entail the physical exchange of key material, wherein both parties furnish each other with a tangible medium containing the public key. Such mediums could encompass a sheet of paper or a storage device resembling an electronic key. 53 Offline distribution is particularly well-suited for small, close-knit communities or familial settings characterized by mutual trust among participants. Despite its apparent simplicity, offline distribution may harbor inherent vulnerabilities. Keying material transmitted through conventional channels may be susceptible to interception risks. for instance, face-to-face meetings could potentially expose the exchange to third-party eavesdropping or secretive recording. Additionally, the physical nature of paper documents or devices heightens the risk of inadvertent loss or theft, thereby compromising the security of the cryptographic process. 4.5.2 Community-Led Digital Certificate Verification System The use of Digital Certificates for sharing public keys addresses some of the issues associated with offline distribution, providing a more efficient alternative. This paper considers 2 cases on how the digital certificates could be used for sharing the public keys of the members in the case of IOU as a form of local currency. 1. Certificate Authority A Certificate Authority (CA) serves as a reliable intermediary that verifies the identity of an entity, issues a digital certificate attesting to that identity, and subsequently digitally signs the certificate to ensure its integrity. By affixing its digital signature, the CA effectively links the identity of the subject to their public key, assuming responsibility for verifying the subject’s authenticity. This trusted third party, the CA, facilitates secure communication between individuals who may not have prior acquaintance. For instance, in a scenario where Alice wishes to securely communicate with Bob despite never having met him, and both individuals place trust in the same CA, Alice can obtain Bob’s digital certificate which contains his public keys to initiate the secure communication process. In order to acquire a digital certificate from a respected Certificate Authority (CA), individuals are required to provide their identity details to the CA’s satisfaction. The reliability and credibility of the certificates issued by a CA are contingent upon the level of trust invested in the CA itself. While it may be uncommon for individuals within a local community to be unfamiliar with one another or have not met one another, nevertheless the utilization of CAs remains a viable consideration for using digital certificates for securely exchanging public keys among community members. 2. Community Leader or Elder 54 In a local community or a family setting where trust is deeply ingrained, the role of a Community Leader or Elder can be pivotal in implementing a digital certificate verification system. Such a trusted individual could potentially act as an internal Certificate Authority (CA) to issue digital certificates within the community. This process aims to ensure secure communication among community members while leveraging the authority and familiarity that the leader possesses. In this approach, the Elder assumes a role similar to that of a Certificate Authority (CA) but holds a unique position as the most trusted member of the community. To obtain a digital certificate, community members approach the Elder, who acts as the central authority overseeing this process. The community member who wishes to be involved in a transaction using the local IOU approaches the elder who verifies their identity ensuring that they align with the community’s values and norms. Since the local community or family is trust-based, the elder takes the member’s public key and embeds that in a certificate, and signs the certificate using his private key. The elder then provides his public key to the member who can then use it to verify any digital certificates that the elder issues during IOU transaction. Whenever a dispute arises or there is a need for validation, community members can consult the Elder, who possesses the authority to also verify the legitimacy of the digital certificates. 4.5.3 Diffie–Hellman Key Exchange Algorithm A key exchange algorithm called Diffie-Hellman could be used in certain scenarios where neither Digital Certificates nor offline distribution proves adequate. In such scenarios, Diffie–Hellman proves to be an alternative mechanism by addressing the challenges posed by physical constraints and the absence of Digital Certificates. Diffie–Hellman algorithm can work as a valuable mechanism facilitating secure public key exchange between parties. The Diffie–Hellman algorithm is a key exchange method that enables two parties to generate a shared secret key over an insecure communication channel. The distinctive feature of this algorithm lies in its capability to facilitate the creation of a shared secret known to both users without the actual transmission of that secret. The efficacy of the Diffie-Hellman algorithm relies on the challenge associated with computing discrete logarithms [RA17]. The functioning of the Diffie–Hellman algorithm is grounded in the mathematics of prime numbers. Consider the scenario where Alice and Bob aim to communicate securely over different locations without a pre-shared key. Instead of directly creating such a key, which could be vulnerable to eaves55 dropping, they employ the Diffie–Hellman algorithm, following this sequence [RA17]: 1. Alice and Bob agree on two large numbers, p(a prime number), and g (an integer), satisfying 1< g < p. 2. Alice selects a large random integer rand computes R=grmod p. 3. Bob selects a large random integer sand computes S=gsmod p. 4. Alice sends Rto Bob, and Bob sends Sto Alice. 5. Alice calculates K=Srmod p. 6. Bob calculates K=Rsmod p. At this juncture, both Alice and Bob possess the same value K, which serves as the basis for secure key communication between the two parties. Now, using this symmetric key, Alice and Bob can exchange their respective public keys with each other. Alice will encrypt her public key using this symmetric key, K and send it to Bob. Bob will decrypt the encrypted message from Alice using the same symmetric key, Kto obtain her public key. Although this approach may seem redundant in a close-knit local community or familial context where trust is implicit, it still presents itself as an alternative mechanism in worstcase scenarios. In environments where interpersonal relationships foster a high degree of trust, the need for symmetric key-based encryption may be diminished. However, its utilization offers an additional layer of security and can be a viable option even within trust-based communities. 4.6 Challenges and Solutions in Digital Certificate Verification for IOU Transactions In certain situations, instances may arise wherein a digital certificate cannot undergo verification, or if the public key of the issuer remains inaccessible. In such scenarios, Alice, Bob, or Charlie may resort to employing subsequent strategies to navigate and resolve these challenges. 1. Alternative Verification Methods In the absence of the ability to verify a digital certificate, the parties involved can explore alternative methods for confirming the authenticity of the certificate or the identity of the issuer. This may involve crossreferencing the information provided in the certificate with other trusted sources or conducting additional verification steps, such as contacting the issuer directly through alternative communication channels. 56 2. Peer Validation In a decentralized context, where trust is established through peer-topeer relationships, Alice, Bob, or Charlie may opt for peer validation mechanisms. This involves seeking validation from other members of the community who have previously interacted with the issuer or who possess relevant knowledge about the issuer’s identity and credibility. 4.7 Solving Double Spending Problem In the context of a small local community or family network, the use of IOUs as a local currency presents a solution to the double spending problem through the application of digital signatures and hashing techniques. Several strategies can be used to address this challenge effectively. Firstly, the implementation of immutable transaction records is crucial. Each transaction undergoes verification and is subsequently recorded in a IOU digital ledger maintained collectively by all the members involved in the transaction. This ledger serves as a comprehensive document, documenting every details such as the parties involved, transaction information, and timestamps, thus ensuring transparency and accountability. Furthermore, the integrity of these transaction records is upheld through the use of cryptographic hashing algorithms like SHA-256. Each entry in the digital ledger undergoes hashing, generating a unique hash value that functions as a digital fingerprint, facilitating data integrity and safeguarding against tampering or manipulation. Moreover, the inherent trust and familiarity among the members within the local community or family setting foster a system of member oversight. With active engagement from trusted members, any discrepancies or irregularities in transaction records can be promptly identified and addressed, reinforcing the security and reliability of the system. By combining these methods, an IOU-based local currency system can effectively mitigate the double spending problem, ensuring the integrity, security, and trustworthiness of transactions within the community or family network. 4.8 Consequences of Debt Default In a trust-based community or familial setting where the interpersonal trust holds significant weight, the failure to fulfill a debt obligation owed through an IOU may result in various forms of social repercussions rather than legal penalties. The following list includes likely social sanctions for non-payment of debts within such a local community framework. 57 DSA: Digital Signature Algorithm ECDSA: Elliptic Curve Digital Signature Algorithm ECC: Elliptic Curve Cryptosystem MD5: Message Digest 5 API: Application Program Interface PKI: Public Key Infrastructure CA: Certificate Authority RA: Registration Authority CRL: Certificate Revocation List CP: Certification Policy OCSP: Online Certificate Status Protocol ASCII: American Standard Code for Information Interchange NIST: National Institute of Standards and Technology FIPS: Federal Information Processing Standard MITM: Man in the Middle 64 References [Aqe10] Sandeep Sood Aqeel Khalique Kuldip Singh. “Implementation of Elliptic Curve Digital Signature Algorithm”. inInternational Journal of Computer Applications: 2.2 (may 2010), pages 21–27. issn: 0975-8887. doi:10.5120/631-876.url:https://ijcaonline. org/archives/volume2/number2/631-876/. [Ars22] Henri Arslanian. “Stablecoins. The Complete Guide to Understanding Bitcoin, Cryptocurrencies and Digital Assets”. inThe Book of Crypto: 1 edition. Palgrave Macmillan Cham, 2022. isbn: 978-3-030-97950-8. doi:10.1007/978-3-030-97951-5.url: https://doi.org/10.1007/978-3-030-97951-5. [Bor21] Michael D Bordo. Central Bank Digital Currency in Historical Perspective: Another Crossroad in Monetary History. Working Paper 29171. National Bureau of Economic Research, august 2021. doi:10.3386/w29171.url:http://www.nber.org/papers/ w29171. [Byl04] Ray Byler. “What is Money?” inProceedings of the 2nd Annual Conference on Mid-South College Computing: MSCCC ’04. Little Rock, Arkansas, USA: Mid-South College Computing Conference, 2004, pages 200–209. [Cor+19] Shaen Corbet andothers. “Cryptocurrencies as a financial asset: A systematic analysis”. inInternational Review of Financial Analysis: 62 (2019), pages 182–199. issn: 1057-5219. doi:https: //doi.org/10.1016/j.irfa.2018.09.003.url:https://www. sciencedirect.com/science/article/pii/S1057521918305271. [De23] Brajesh De. “Introduction to APIs”. inAPI Management: An Architect’s Guide to Developing and Managing APIs for Your Organization: Berkeley, CA: Apress, 2023, pages 1–26. isbn: 9798-8688-0054-2. doi:10 . 1007 / 979 - 8 - 8688 - 0054 - 2 _ 1.url: https://doi.org/10.1007/979-8-8688-0054-2_1. [GPW22] Hanhui Guan, Nuno Palma and Meng Wu. The Rise and Fall of Paper Money in Yuan China, 1260-1368. Economics Discussion Paper Series 2207. Economics, The University of Manchester, september 2022. url:https:// ideas.repec. org/p/ man/ sespap/2207.html. [Gra11] David Graeber. Debt: The First 5000 Years. Brooklyn, NY: Melville House, 2011. isbn: 978-1-933633-86-2. 65 [HN17] Jingwei Huang and David Nicol. “An anatomy of trust in public key infrastructure”. inInternational Journal of Critical Infrastructures: 13 (january 2017), page 238. doi:10.1504/IJCIS.2017. 088234. [Hoo22] Andrew Hook. “Examining modern money creation: An institutioncentered explanation and visualization of the “credit theory” of money and some reflections on its significance”. inThe Journal of Economic Education: 53.3 (2022), pages 210–231. doi:10.1080/ 00220485.2022.2075510. eprint: https://doi.org/10.1080/ 00220485.2022.2075510.url:https://doi.org/10.1080/ 00220485.2022.2075510. [Hug22] Lawrence E. Hughes. “X.509 Digital Certificate”. inPro Active Directory Certificate Services: Creating and Managing Digital Certificates for Use in Microsoft Networks: Berkeley, CA: Apress, 2022, pages 45–73. isbn: 978-1-4842-7486-6. doi:10.1007/9781-4842-7486-6_5.url:https://doi.org/10.1007/978-14842-7486-6_5. [ICM24] International Capital Market Association (ICMA). Tracker of New Fintech Applications in Bond Markets. 2024. url:https://www. icmagroup.org/market-practice-and-regulatory-policy/ fintech-and-digitalisation/fintech-resources/trackerof-new-fintech-applications-in-bond-markets/. [Invnd] Investopedia. IOU (I Owe You) Definition.https://www.investopedia. com/terms/i/iou.asp. Accessed: November 16, 2023. n.d. [JH18] Susan Johnson and Helen Harvey-Wilson. Local currency adoption and use: insights from a realist evaluation of the Bristol Pound. English. WorkingPaper 56. Centre for Development Studies, University of Bath, april 2018. [JMV01] Don Johnson, Alfred Menezes and Scott Vanstone. “The Elliptic Curve Digital Signature Algorithm (ECDSA)”. inInt. J. Inf. Secur.: 1.1 (august 2001), pages 36–63. issn: 1615-5262. doi: 10.1007/s102070100002.url:https://doi.org/10.1007/ s102070100002. [JP15] David S Jones and Scott H Podolsky. “The history and fate of the gold standard”. inThe Lancet: 385.9977 (2015), pages 1502–1503. issn: 0140-6736. doi:https : / / doi . org / 10 . 1016 / S0140 - 6736(15)60742-5.url:https://www.sciencedirect.com/ science/article/pii/S0140673615607425. 66 [Kie+21] Binh Kieu-Do-Nguyen andothers. “A Power-efficient Implementation of SHA-256 Hash Function for Embedded Applications”. in2021 International Conference on Advanced Technologies for Communications (ATC): 2021, pages 39–44. doi:10.1109/ATC52653. 2021.9598264. [KKO17] Tsung-Ting Kuo, Hyeon-Eui Kim and Lucila Ohno-Machado. “Blockchain distributed ledger technologies for biomedical and health care applications”. inJournal of the American Medical Informatics Association: 24.6 (september 2017), pages 1211–1220. issn: 10675027. doi:10.1093/jamia/ocx068. eprint: https://academic. oup.com/jamia/article-pdf/24/6/1211/34149246/ocx068. pdf.url:https://doi.org/10.1093/jamia/ocx068. [Lin23] Weyde Lin. “Digital Signature”. inTrends in Data Protection and Encryption Technologies:byeditorValentin Mulder andothers. Cham: Springer Nature Switzerland, 2023, pages 77–81. isbn: 978-3-031-33386-6. doi:10.1007/978-3-031-33386-6_15.url: https://doi.org/10.1007/978-3-031-33386-6_15. [LSP19] Leslie Lamport, Robert Shostak and Marshall Pease. “The Byzantine generals problem”. inConcurrency: The Works of Leslie Lamport: New York, NY, USA: Association for Computing Machinery, 2019, pages 203–226. isbn: 9781450372701. url:https://doi. org/10.1145/3335772.3335936. [Nak08] Satoshi Nakamoto. “Bitcoin: A Peer-to-Peer Electronic Cash System”. in(2008): Accessed on: November 16, 2023. url:https: //bitcoin.org/bitcoin.pdf. [Nat23] National Institute of Standards and Technology. Digital Signature Standard (DSS). Federal Information Processing Standards Publication (FIPS) NIST FIPS 186-5. Department of Commerce, Washington, D.C., 2023. url:https://doi.org/10.6028/NIST. FIPS.186-5. [Pat+19] Unnati Patel andothers. “THE STUDY OF DIGITAL SIGNATURE AUTHENTICATION PROCESS”. in1: (october 2019), pages 38–43. [RA17] Dr. S. V. B. Subrahmanyeswara Rao and Mrs. Yalamanchili Anjani. “An Approach to Public-Key Cryptography using DiffieHellman Key Exchange Algorithm”. inInternational Journal for Research in Engineering Application & Management (IJREAM): 03.08 (2017), page 69. issn: 2454-9150. url:https : / / www . ijream.org/papers/IJREAMV03I083256.pdf. 67 [Red+21] Gautham P. Reddy andothers. “Multiple Hashing Using SHA256 and MD5”. inAdvances in Computing and Network Communications:volume 735. 2021. isbn: 978-981-33-6976-4. [Ros+18] Stephen A Ross andothers.Corporate Finance. 13th. New York, NY: McGraw-Hill Education, 2018. isbn: 978-1259918940. [SHC19] Nicolas Serrano, Hilda Hadan and L. Jean Camp. “A Complete Study of P.K.I. (PKI’s Known Incidents)”. inTPRC47: The 47th Research Conference on Communication, Information and Internet Policy 2019: (july 2019). Available at SSRN: https://ssrn. com/abstract=3425554 or http://dx.doi.org/10.2139/ssrn. 3425554. [SJC21] Nonce: Life Cycle, Issues and Challenges in Cryptography.volume 698. 2021. isbn: 978-981-15-7960-8. [Xio+22] Huanliang Xiong andothers. “Research on Progress of Blockchain Consensus Algorithm: A Review on Recent Progress of Blockchain Consensus Algorithms”. inFuture Internet: 14.2 (2022). issn: 19995903. doi:10.3390/fi14020047.url:https://www.mdpi.com/ 1999-5903/14/2/47. [Zel20] Sarah Zeller. “Economic Advantages of Community Currencies”. inJournal of Risk and Financial Management: (2020). url:https: //api.semanticscholar.org/CorpusID:228919616. [Zha+21] Hao Zhao andothers. “Radiocarbon-dating an early minting site: the emergence of standardised coinage in China”. inAntiquity: 95 (august 2021), pages 1–18. doi:10.15184/aqy.2021.94. [Zhe+17] Zibin Zheng andothers. “An Overview of Blockchain Technology: Architecture, Consensus, and Future Trends”. in2017 IEEE International Congress on Big Data (BigData Congress): 2017, pages 557–564. doi:10.1109/BigDataCongress.2017.85. 68