Blockchain Papers

Christina Boura, Margot Funk, Yann Rotella

No abstract is available for this record.

Tomer Ashur, Thomas Buschman, Mohammad Mahzoun

No abstract is available for this record.

Anaïs Barthoulot, Olivier Blazy, Sébastien Canard

No abstract is available for this record.

Lennart Braun, Guilhem Castagnos, Ivan Damgård, Fabien Laguillaumie · 7 authors

We present distributed key generation and decryption protocols for an additively homomorphic cryptosystem based on class groups, improving on a similar system proposed by Braun, Damgård, and Orlandi at CRYPTO ‘23. Our key generation is similarly constant round but achieves lower communication complexity than the previous work. This improvement is in part the result of relaxing the reconstruction property required of the underlying integer verifiable secret sharing scheme. This eliminates the reliance on potentially costly proofs of knowledge in unknown order groups. We present a new method to batch zero-knowledge proofs in unknown order groups which strengthens these improvements. We also present a protocol which is proven secure against adaptive adversaries in the single inconsistent player (SIP) model. Our protocols are secure in the universal composability (UC) framework and provide guaranteed output delivery. We demonstrate the relative efficiency of our techniques by presenting the running times and communication costs associated with our implementation of the statically secure protocol and provide a direct comparison with alternate state of the art constructions.

Francesca Stabile, Walter Lúcia, Amr Youssef, Giuseppe Franzè

The proliferation of cloud computing technologies has paved the way for deploying networked encrypted control systems, offering high performance, remote accessibility and privacy. However, in scenarios where the control algorithms run on third-party cloud service providers, the control’s logic might be changed by a malicious agent on the cloud. Consequently, it is imperative to verify the correctness of the control signals received from the cloud. Traditional verification methods, like zero-knowledge proof techniques, are computationally demanding in both proof generation and verification, may require several rounds of interactions between the prover and verifier and, consequently, are inapplicable in real-time control system applications. In this paper, we present a novel computationally inexpensive verifiable computing solution inspired by the probabilistic cut-and-choose approach. The proposed scheme allows the plant’s actuator to validate the computations accomplished by the encrypted cloud-based networked controller without compromising the control scheme’s performance. We showcase the effectiveness and real-time applicability of the proposed verifiable computation scheme using a remotely controlled Khepera-IV differential-drive robot.

Mohammed Y. Shakor, Mustafa Ibrahim Khaleel, Mejdl Safran, Sultan Alfarhood · 5 authors

In the rapidly evolving realm of cloud computing security, this paper introduces an innovative solution to address persistent challenges. The proliferation of cloud technology has brought forth heightened concerns regarding data security, necessitating novel approaches to safeguarding sensitive information. The issue centers on the vulnerability of cloud-stored data, often necessitating enhanced encryption and key management strategies. Traditional methods often fall short in mitigating risks associated with compromised encryption keys and centralized key storage. To combat these challenges, our proposed solution encompasses a two-phase approach. In the first phase, dynamic Advanced Encryption Standard (AES) keys are generated, ensuring each file’s encryption with a unique and ever-changing key. This approach significantly enhances file-level security, curtailing an attacker’s ability to decrypt multiple files even if a key is compromised. The second phase introduces blockchain technology, where keys are securely stored with accompanying metadata, bolstering security and data integrity. Elliptic Curve Cryptography (ECC) public key encryption enhances security during transmission and storage, while also facilitating secure file sharing. In conclusion, this comprehensive approach enhances cloud security, providing robust encryption, decentralized key management, and protection against unauthorized access. Its scalability and adaptability make it a valuable asset in contemporary cloud security paradigms, assuring users of data security in the cloud.

Sheng, Peiyao, Ranvir Rana, Bala, Senthil, Himanshu Tyagi · 5 authors

Layer 1 (L1) blockchains such as Ethereum are secured under an "honest supermajority of stake" assumption for a large pool of validators who verify each and every transaction on it. This high security comes at a scalability cost which not only effects the throughput of the blockchain but also results in high gas fees for executing transactions on chain. The most successful solution for this problem is provided by optimistic rollups, Layer 2 (L2) blockchains that execute transactions outside L1 but post the transaction data on L1. The security for such L2 chains is argued, informally, under the assumption that a set of nodes will check the transaction data posted on L1 and raise an alarm (a fraud proof) if faulty transactions are detected. However, all current deployments lack a proper incentive mechanism for ensuring that these nodes will do their job "diligently", and simply rely on a cursory incentive alignment argument for security. We solve this problem by introducing an incentivized watchtower network designed to serve as the first line of defense for rollups. Our main contribution is a "Proof of Diligence" protocol that requires watchtowers to continuously provide a proof that they have verified L2 assertions and get rewarded for the same. Proof of Diligence protocol includes a carefully-designed incentive mechanism that is provably secure when watchtowers are rational actors, under a mild rational independence assumption. Our proposed system is now live on Ethereum testnet. We deployed a watchtower network and implemented Proof of Diligence for multiple optimistic rollups. We extract execution as well as inclusion proofs for transactions as a part of the bounty. Each watchtower has minimal additional computational overhead beyond access to standard L1 and L2 RPC nodes. Our watchtower network comprises of 10 different (rationally independent) EigenLayer operators, secured using restaked Ethereum and spread across three different continents, watching two different optimistic rollups for Ethereum, providing them a decentralized and trustfree first line of defense. The watchtower network can be configured to watch the batches committed by sequencer on L1, providing an approximately 3 minute (cryptoeconomically secure) finality since the additional overhead for watching is very low. This is much lower than the finality delay in the current setup where it takes about 45 minutes for state assertions on L1, and hence will not delay the finality process on L1.

Iveta Grigorova, Aleksandar Karamfilov, Radostin Merakov, A. S. Efremov

In a rapidly evolving and often volatile crypto market, the ability to use historical data for simulations provides a more realistic assessment of how decentralized finance (DeFi) protocols might perform. This insight is crucial for participants, developers, and investors seeking to make informed decisions. This paper presents a comprehensive study evaluating the dynamic performance of a newly developed DeFi protocol—NOLUS. The main objective of this paper is to present and analyze the built realistic model of the platform. This model could be successfully used to analyze the stability of the platform under different environmental influences by performing various simulations and conducting experiments with different parameters that could not be realized with the real platform. In the article, the key components of the platform are presented in detail and the main dependencies between them are clarified, in addition to the ways of forming multiple variables, and the complex relations between them in the real protocol are explained. The main finding from the experimental part of the study is that the performance of the protocol representation accounts for the expected system behavior. Hence the system simulation could be successfully used to reveal essential protocol behaviors resulting from potential shifts in the crypto market environment and to optimize the protocol’s hyper parameters.

Abusaid Manap, Gulnara Abitova, Gulzhan Uskenbayeva, Aigul Shaikhanova

In the era of pervasive digital data, ensuring secure file storage has become a paramount concern. This paper explores the significance of hybrid cryptography in the development of information technology for secure file storage. Hybrid cryptography, combining symmetric and asymmetric encryption, offers robust protection against unauthorized access, tampering, and data loss. The article reviews recent cryptography literature, highlighting the importance of secure file storage in today's interconnected world and examining the benefits of hybrid cryptography. The analysis of articles on cryptography reveals emerging trends and challenges. Post-quantum cryptography addresses concerns about quantum threats, while blockchain-based cryptography enhances security in IoT data sharing. Homomorphic encryption enables computations on encrypted data, and privacy-preserving cryptographic protocols facilitate secure multi-party computation. Machine learning's intersection with cryptanalysis introduces efficiency but raises ethical considerations. The paper further discusses advancements and trends in cryptography techniques, including post-quantum cryptography, homomorphic encryption, zero-knowledge proofs, post-quantum key exchange, secure multi-party computation, and post-quantum signature schemes. These developments aim to ensure long-term security against quantum attacks, enable privacy-preserving computations, and enhance the confidentiality, integrity, and authentication of digital communication and data storage. In conclusion, the paper advocates for the adoption of hybrid cryptography in secure file storage systems. Its combination of symmetric and asymmetric encryption, along with its adaptability to evolving security landscapes, positions hybrid cryptography as a formidable approach to data protection. By embracing hybrid cryptography and staying informed about the latest advancements, organizations can navigate the digital age with confidence, ensuring the confidentiality, integrity, and availability of stored files.

Mohammed Mujeer Ulla, Preethi Preethi, Md. Sameeruddin Khan, Deepak S. Sakkari

Very recent attacks like ladder leaks demonstrated the feasibility of recovering private keys with side-channel attacks using just one bit of secret nonce. ECDSA nonce bias can be exploited in many ways. Some attacks on ECDSA involve complicated Fourier analysis and lattice mathematics. This paper will enable cryptographers to identify efficient ways in which ECDSA can be cracked on curves NIST256p, SECP256k1, NIST521p, and weak nonce, kind of attacks that can crack ECDSA and how to protect yourself. Initially, we begin with an ECDSA signature to sign a message using the private key and validate the generated signature using the shared public key. Then we use a nonce or a random value to randomize the generated signature. Every time we sign, a new verifiable random nonce value is created, and a way in which the intruder can discover the private key if the signer leaks any one of the nonce values. Then we use Lenstra–Lenstra–Lovasz (LLL) method as a black box, we will try to attack signatures generated from bad nonce or bad random number generator (RAG) on NIST256p, SECP256k1 curves. The combination of nonce generation, post-message signing, and validation in ECDSA helps achieve Uniqueness, Authentication, Integrity, and Non-Repudiation. The analysis is performed by considering all three curves for the implementation of the Elliptic Curve Digital Signature Algorithm (ECDSA). The comparative analysis for each of the selected curves in terms of computational time is done with the leak of nonce and with the Lenstra–Lenstra–Lovasz method to crack ECDSA. The average computational costs to break ECDSA with curves NIST256p, NIST521p, and SECP256k1 are 0.016, 0.34,0.46 respectively which is almost zero depicting the strength of the algorithm. The average computational costs to break ECDSA with curves SECP256K1 and NIST256p using LLL are 2.9 and 3.4 respectively

Zheyi Zhang, Yinghong Cao, Hadi Jahanshahi, Jun Mou

With the rapid development of blockchain technology, the security of non-fungible tokens (NFT) in the transaction process has attracted much attention. In the transaction process, the commoditized NFT images will inevitably involve display and leakage problems, which is likely to lead to economic losses drink copyright disputes between the trading parties. To protect transaction security, a chaotic color multi-image compression encryption/LSB data-type steganography scheme is proposed in the paper. A series of chaotic sequences are obtained by iterating the chaotic map, while compression sensing (CS) is introduced to compress multiple secret images and fuse the compressed secret images into one large secret image. Then this image is encrypted, and the encrypted large secret image is hidden on multiple cover images by steganography. This encryption can hide the change in the statistical properties caused by steganography. Finally, the cover image is combined with the 3D object model by using it as a texture for the 3D object model to realize the type steganography of the image data. The simulation and performance test results of the scheme illustrate that the scheme has a large enough key space and steganography capacity, as well as good resistance to differential attacks, statistical attacks, compression reconstruction quality, and robustness. This scheme can well protect the transaction security of NFT images, and at the same time open a channel connecting 2D images and 3D obj textured models, which provides a new idea for steganography.

Dato Kavazi, Victor Smirnov, Sasha Shilina, Jonathan Shomroni · 7 authors

We present a novel 1 Human = 1 Node blockchain protocol which aims to overcome problems arising from plutocratic principles upon which Proof-of-Work (PoW) and Proof-of-Stake (PoS) heavily rely on. The advent of blockchain technology has led to a massive wave of different decentralized ledger technology (DLT) solutions. Projects such as Bitcoin and Ethereum managed to shift the paradigm of how to transact value in a decentralized manner, yet their core technologies give rise to a significant early adopters’ control bias and have led to financial systems flawed by massive inequality and centralization of power. In this paper we propose an alternative to modern decentralized financial networks by introducing the Humanode network. Humanode is a network safeguarded by cryptographically secure bio-authorized nodes on which users are able to deploy nodes by staking their encrypted biometric data. This approach can potentially lead to the creation of a truly public, permissionless financial network, based on consensus between equal human nodes with algorithmic emission mechanisms targeting real value growth and contribution-based wealth distribution.

Augustin Bariant

With the increasing interest for advanced protocols for Multi Party Computation, Fully-Homomorphic Encryption or Zero Knowledge proofs, a need for cryptographic algorithms with new constraints has emerged. These algorithms, called Arithmetization-Oriented ciphers, seek to minimize the number of field multiplications in large finite fields F2n or Fp. Among them, Ciminion is an encryption algorithm proposed by Dobraunig et al. in Eurocrypt 2021. In this paper, we show a new univariate modelization on a variant of Ciminion proposed by the designers. This instance restricts the attacker to at most 2 s/2 data, where s is the security level. Because the designers chose to reduce the number of rounds in that specific attacker model, we are able to attack the cipher for large security levels. We also propose some slight modifications of Ciminion that would overcome this vulnerability.

Aayush Shah, Prabhat Mahato, Aadarsh Bhagat

Abstract: This research paper surveys the landscape of cryptography, encompassing historical origins and modern applications. Beginning with foundational concepts, it explores encryption, decryption, ciphers, and keys, spanning symmetric and asymmetric cryptography. Historical context unfolds, tracing cryptography from ancient Egyptian hieroglyphs to Julius Caesar's cipher. The study then transitions to contemporary subjects. Elliptic Curves and Cryptography are investigated, showcasing their significance in secure communication, demonstrating ECC key exchange and AES-GCM encryption using python and Comparative analysis of ECC, RSA, and Diffie-Hellman sheds light on their performance. Zero-Knowledge Proofs are introduced as tools for privacy-preserving verification followed by an exploration of various Zero-Knowledge Proof (ZKP) protocols. By presenting practical implementation examples using Python, the paper illustrates how these proofs can be applied in real-world scenarios. Random Number Generation is examined and distinction between pseudorandom number generators (PRNGs) and cryptographically secure PRNGs (CSPRNGs) is emphasized conducting a thorough comparative analysis of PRNGs and CSPRNGs, considering factors like correlation, independence, periodicity, and entropy. Furthermore, the section evaluates the performance of different random number generation techniques. Fully Homomorphic Encryption emerges as a groundbreaking concept, discussing its mathematical properties, practical implementation, parameter selection, and optimization techniques enabling computation on encrypted data. Cryptographic Secret Sharing Schemes are explored for secure information distribution. The paper concludes by delving into the Chinese Remainder Theorem's applications within modern cryptographic protocols, particularly in RSA decryption and the integration factorization process of the RSA public key cryptosystem. It also provides a comprehensive overview of the theoretical foundations of primality testing, a pivotal aspect of the RSA algorithm. Overall, this research paper provides a comprehensive exploration of cryptography's historical context, core concepts, advanced techniques, and practical implementations, offering valuable insights into the realm of secure communication

Anirudh Rajagopalan, Kunwar Singh, Balaji Jayashrri, Anu John

No abstract is available for this record.

Xueli Yan

The problem of determining the position relationship between points and polygons is very extensive in practical applications. However, the existing solutions are only applicable to the case of convex polygons, and no solutions are given for arbitrary polygons. In addition, most of the existing schemes are carried out under the semi-honest model, and cannot resist the active attack of malicious adversaries. In order to solve these problems, this paper uses Paillier's encryption scheme, the idea of zero-knowledge proof to design a decision protocol to protect the position relationship between points and arbitrary polygons, which can not only prevent the deceptive behavior of malicious adversaries, but also extend the application from convex polygons to arbitrary polygons. A simulation example is used to prove that this paper is safe and efficient under the malicious model.

Pu Ji

This paper explains the composition of the cryptocurrency wallet by analyzing a wallet’s components, functions, categories, the algorithm of signing, and security features as three major components used in the constitute of the cryptocurrency wallet, private key, public key, and address are introduced from their generation process with specific Elliptic Curve Digital Signature Algorithm secp256k1 and Keccak hash function. A variety of crypto wallets are divided into different categories by their purpose of use, the form of display, and Internet connectivity, and multiple crypto wallets are explained in the second part of this paper. The elliptic curve secp256k1 is selected in Ethereum for both calculating the public key information and performing signing transactions. This paper details secp256k1 and Keystore used behind the signing process and security of cryptocurrency wallet and outlines potential risks due to the development of computing power and transfer of validation system in Ethereum.

John Boyter

In recent years, cryptocurrencies, cryptoassets, electronic coins, tokens, non-fungible tokens, and other various terms for electronic assets have gained prodigious attention in the financial world. From the spike (and subsequent drop) in value of Bitcoin, to people spending millions of dollars on pixelated pictures of punks, the market for these assets has been extremely active despite its ups and downs. However, in addition to potential financial success via crypto markets, the development of crypto technology has allowed for a transformation of how individuals and institutions think of currency, financial security, and access to information Part I of this Comment explains what a cryptoasset is, as well as the current tax regime applicable to them. Part II defines like-kind exchanges and provides the historical context for the nonrecognition event. It also considers the IRS’s recent guidance pertaining to crypto like-kind exchanges. Part III puts forth this Comment’s main arguments for allowing crypto-for-crypto exchanges to qualify as like-kind exchanges.

Mengyao Li

Ethereum digital signatures have been found to make progress, but there has yet to be a consensus regarding their significance and process. Using digital signatures in Ethereum ensures the security of users' money and the Safety of their transportation. Elliptic Curve Digital Signature Algorithm (ECDSA), private key, and public key play an important role here. This paper analyzes the details of Ethereum's Digital Signature based on existing information. First, it explained the general background information about Ethereum. Send explain the ERC-20. ERC-20 are digital assets that represent value. They could become more compatible with the new standard and allow other features. Then digital signatures are explained in detail. This part included ECDSA, private key, and public key. ECDSA is the most critical algorithm during the production process. Private and public keys are the key features to ensure Safety. The last part is the Keystore file system. Using the Keystore file system, users can secure their private keys for their cryptocurrency wallets. To access their account, the user must have a password generated by them. The unencrypted files, on the other hand, create a vulnerability in the key store, which is exposed by these unencrypted files. Once an attacker obtains the user's unencrypted key, he cannot only take control of the account but also sign transactions on behalf of the user.

Mu Han, Shuai Wu

Summary Outsourcing storage and computation to cloud servers have become a trend. Although searchable symmetric encryption (SSE) had handled the data privacy issue caused by honest‐but‐curious servers, a semi‐honest server may return incomplete or incorrect results when users search for their encrypted data. To against such servers, scholars have recently used blockchain/Ethereum‐based SSE schemes which utilize the public, that is, active nodes, to verify the search process. However, the search operation in existing schemes is very expansive in terms of fee and time. In this paper, we propose a new blockchain‐based searchable encryption framework with search optimized, that is, free of charge, quicker, and more private, at the cost of some extra storage. Besides, we design a general and efficient verification algorithm for our framework, which makes the search verifiable. In addition, we deploy an instance of our framework on an official Ethereum test network, and the experimental results and evaluations demonstrate the advantage of our framework.

Manal Abdullah Alohali, Mohammed Aljebreen, Fuad Al-Mutiri, Mahmoud Othman · 8 authors

The real world is bounded by people, hospitals, industries, buildings, businesses, vehicles, cognitive cities, and billions of devices that offer various services and interact with the world. Recent technologies, including AR, VR, XR, and the digital twin concept, provide advanced solutions to create a new virtual world. Due to the ongoing development of information communication technologies and broadcast channels, data security has become a major concern. Blockchain (BC) technology is an open, decentralized, and transparent distributed database that can be maintained by the group. BC’s major features are high credibility, decentralization, transparency, versatility, autonomy, traceability, anonymity, intelligence, reward mechanisms, and irreversibility. This study presents a blockchain-driven image encryption technique using arithmetic optimization with a fractional-order Lorenz system (BDIE-AOFOLS). The BDIE-AOFOLS technique uses the FOLS method, which integrates the Arnold map, tent map, and fractional Lorenz system. Besides this, an arithmetic optimization algorithm (AOA) was carried out for the optimum key generation process to achieve the maximum PSNR value. The design of an AOA-based optimal generation of keys for the FOLS technique determines the novelty of the current work. Moreover, the cryptographical pixel values of the images can be stored securely in the BC, guaranteeing image security. We compared the outcomes of the proposed BDIE-AOFOLS technique against benchmark color images. The comparative analysis demonstrated the improved security efficiency of the BDIE-AOFOLS technique over other approaches, with a mean square error of 0.0430 and a peak signal-to-noise ratio of 61.80 dB.

Mohammed Mujeer Ulla, Deepak S. Sakkari

Very recent attacks like ladder leak demonstrated feasibility to recover private key with side channel attacks using just one bit of secret nonce. ECDSA nonce bias can be exploited in many ways. Some attacks on ECDSA involve complicated Fourier analysis and lattice mathematics. In this paper will enable cryptographers to identify efficient ways in which ECDSA can be cracked on curves NIST256p, SECP256k1, NIST521p and weak nonce, kind of attacks that can crack ECDSA and how to protect yourself. Initially we begin with ECDSA signature to sign a message using private key and validate the generated signature using the shared public key. Then we use a nonce or a random value to randomize the generated signature. Every time we sign, a new verifiable random nonce value is created and way in which the intruder can discover the private key if the signer leaks any one of the nonce value. Then we use Lenstra–Lenstra–Lovasz (LLL) method as a black box, we will try to attack signatures generated from bad nonce or bad random number generator (RAG) on NIST256p, SECP256k1 curves. The analysis is performed by considering all the three curves for implementation of Elliptic Curve Digital Signature Algorithm (ECDSA).The comparative analysis for each of the selected curves in terms of computational time is done with leak of nonce and with Lenstra–Lenstra–Lovasz method to crack ECDSA. The average computational costs to break ECDSA with curves NIST256p, NIST521p and SECP256k1 are 0.016, 0.34, 0.46 respectively which is almost to zero depicts the strength of algorithm. The average computational costs to break ECDSA with curves SECP256K1 and NIST256p using LLL are 2.9 and 3.4 respectively.

Mohammed Mujeer Ulla, Deepak S. Sakkari

No abstract is available for this record.

Abusufiyan Athani Samarth Kumar

Cryptocurrencies are considered to be big fastest growing players in the financial sector in the current scenario of the world. Many individuals, institutions, and corporate enterprises had invested heavily in this. In the last 5years, there is so much fluctuation in almost every crypto-currency price due to government regulations, public sentiment, media hype, and supply and demand of investors and users. So, We have decided to suggest cryptocurrency prices using deep learning techniques which make links between changes in the price of the cryptocurrency, their historical data, and other factors which will affect cryptocurrency price. We have also provided a technique which is suggesting a price of a few days in the future and helping in taking investment decisions about which cryptocurrencyis going to give more benefit in the future.Also, provide currency conversion techniques.