Follow blockchain research across journals, conferences, and preprint repositories.
535 results · page 9 of 23
Prakash Yadav, Harsh Raj, Sahej Gautam, Ankesh Tripathi
No abstract is available for this record.
Cristina Palma, Rui Dias, Rosa Galvão, Paulo Alexandre · 5 authors
The primary purpose of this study is to compare the levels of efficiency between the Islamic cryptocurrency (HelloGold), the ecological cryptocurrencies Cardano (ADA) and Stellar (XLM) and the traditional digital currencies Bitcoin (BTC) and Ethereum (ETH) over the period from 24 February 2022 to 28 January 2024. Analysing the DFA exponents reveals different types of memory in the digital currencies time series. The Islamic digital currency HelloGold (HGT) exhibits short-term memory, suggesting profit opportunities based on recent trends. In contrast, the green cryptocurrency Cardano (ADA) shows long-term memory, indicating the influence of long-term events and trends on prices. The digital currency Stellar (XLM) does not show a clear short-term or long-term memory trend, making it difficult to predict future movements. Meanwhile, Bitcoin (BTC) and Ethereum (ETH) exhibit long-term memory, suggesting that their prices are affected by long-term trends. These results have important implications for investors and traders when adjusting their trading strategies according to the behaviour observed in cryptocurrency prices.
Suresh Kumar Kagitha, Diksha Rani, Pavan Kumar Penta
Cryptocurrency tracker is an online platform that provides a userfriendly experience. Users get a simple and userfriendly experien ce through the user interface. Users can sign into their account with Gmail or a mobile number for easy access to their account. U sers can track prices of different cryptocurrencies and view currency charts. Using this user interface, users can find prices and ot her relevant information about cryptocurrencies. The app helps users to create watchlists and we can track prices. We can set alerts for cryptocurrency prices. We can customize notifications and help understand new cryptocurrency trends. Users can easily find various cryptocurrencies and track future crypt currency trends. It helps users invest in new popular cryptocurrencies that will be more useful to them in the future. Overall, the Cryptocurrency Tracker web app is a valuable tool for anyone looking to invest, trade, or just keep an eye on the cryptocurrency market. It provides realtime data and insights that can help users make informed investment decisions and stay abrea st of the latest industry trends and developments.
Aida Mohagheghzadeh, Babak Amiri, Ahmad Makui
This paper addresses the imperative task of assessing and ranking cryptocurrencies, particularly pertinent in the context of the burgeoning popularity of public blockchains. The proliferation of available options necessitates a rigorous evaluation, prompting the formulation of a novel model grounded in both objective and subjective criteria. To contend with the challenge posed by the expanding landscape of public blockchains, ten discerning criteria are delineated, encompassing facets such as Technology, TPS, Market capitalization, GitHub fork, GitHub stars, Twitter followers, Twitter hashtags, trading volume, sentiment score, and the price range differential. Leveraging expert opinions, the pairwise impact of these criteria is ascertained, and the DEMATEL method is judiciously employed to derive their respective weights. Subsequently, the PROMETHEE method is harnessed to effectuate the ranking of 20 cryptocurrencies predicated on the identified criteria. Furthermore, the integration of LSTM enables the prediction of values for four predictable criteria, seamlessly incorporated into the PROMETHEE model to furnish rankings across diverse temporal intervals. The proposed model, thus, presents a holistic and pragmatic approach to inform investment decision-making within the dynamic cryptocurrency market. By embracing a comprehensive set of criteria and integrating predictive analytics, this model stands as a valuable contribution to the field, offering nuanced insights to stakeholders navigating the complexities of cryptocurrency investment.
Christina Boura, Margot Funk, Yann Rotella
No abstract is available for this record.
Anupam Chattopadhyay, Shivam Bhasin, Stjepan Picek, Chester Rebeiro
No abstract is available for this record.
Xiao Yang, Chengru Zhang, Haiyang Xue, Man Ho Au
A Verifiably Encrypted Signature (VES) scheme encrypts a digital signature in a way that allows the public to verify the validity of the encrypted signature. Recently, several practical VES schemes for ECDSA have been proposed to enable escrowed transactions with cryptocurrencies. However, these schemes are inefficient in terms of both communication and computation, or require a large lookup table. In this paper, we present two efficient VES schemes for ECDSA that improve upon previous work. The first scheme is based on Castagnos-Laguillaumie (CL) encryption, while the second is based on modified Joye-Libert (JL) encryption. Our benchmark shows that our schemes outperform existing constructions by a factor of at least 2 in both computation and communication. Additionally, our solution does not rely on any lookup table. We demonstrate that these schemes can also be generalized to design VES for Schnorr signature scheme and EdDSA. The main technical contribution of this paper, which is of independent interest, is a zero-knowledge proof for the equality of the discrete log of an elliptic-curve point and that of a JL ciphertext. Importantly, the security of our proof does not rely on any non-standard assumptions.
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.
Abylay Satybaldy, Anushka Subedi, Sheikh Mohammad Idrees
No abstract is available for this record.
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.
Zhao Zhang, Chunxiang Xu, Yunxia Han
Cryptocurrency allows for immutable and transparent payments in the decentralized manner. The transparency nature inevitably leads to leakage of users’ private information. Although existing schemes provided privacy preservation in cryptocurrencies, they fail to consider regulation and facilitates conducting illegal activities. To solve this problem, several works aimed at striking a balance between preservation of users’ privacy and identification of malicious users. However, they introduced a central authority (which runs counter to the decentralization design of cryptocurrencies), and reveals only the pseudonym of a malicious user other than her/his real identity due to lack of authentication. In this work, we propose PICTURE, a privacy-preserving cryptocurrency with threshold authentication and regulation. In PICTURE, a user registers to a group of authorities (instead of a centralized one) who cooperatively issue the user with a master account which is actually a randomizable signature. The user randomizes the master account to be authenticated and transact anonymously. Besides, the transaction contains a record, with which the authorities can reveal the user’s identity (that is used in registration) in the threshold way. Our construction enables the user to prove that the record is well-formed with only a standard Schnorr’s protocol, leading to lower overheads compared with existing works. We provide a formal security proof to demonstrate that PICTURE is secure, and conduct a comprehensive performance evaluation to show that PICTURE is ready to be deployed in real world.
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.
Hao Li, Yanbo Wu, Ronghong Huang, Xianghang Mi · 6 authors
With the emergence of Web3, decentralized network protocol technologies have been vigorously developed. As a pioneer for decentralized real-time communication systems, Matrix is an open standard based on a federation specification protocol. Anyone can set up a self-hosted homeserver to participate in the global Matrix network and communicate with others in chat rooms. In this paper, we conduct the first in-depth measurement and exploratory research on Matrix’s ecosystem and security. We designed and implemented several investigation techniques to empirically delve into Matrix federation from various aspects (homeservers, rooms, and users). In the end, we identified a number of interesting findings and potential vulnerabilities, including anti-decentralization phenomena, cybersecurity threats in homeservers, and the confidentiality of encrypted rooms being compromised.
P. V. Sem’yanov, S. V. Grezina
Abstract— This article discusses the security of implementing encryption for the Bitcoin Core cryptocurrency wallet. Particular attention is paid to aspects of the practical use of cryptographic algorithms when encrypting the wallet.dat file with a password. Practical resistance to brute-force attacks using parallel computing on GPUs is also considered. It is discovered that Bitcoin Core does not implement changing the encryption key for the user’s private keys. This implementation makes it possible to carry out a second attack on the wallet without knowing the new password, if it has already been compromised previously. Changes to encryption algorithms are also been proposed to make brute-force attacks more difficult on the GPU.
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.
Yuanyuan Li, Wei Chen, Xin Huang, Peng Han · 6 authors
Due to the continuous improvement of traffic analysis technology, traditional covert channels have become insecure and vulnerable to human sabotage. Blockchain technology has the characteristics of immutability and anonymity, making covert communication more unmonitored and robust. However, it also brings about low communication efficiency. In this article, we adopt the idea of transaction rounds and propose for the first time the construction of HMAC values order (HVO) scheme. Furthermore, we further propose a HMAC values and transaction matrices (HV-TM) scheme to improve communication efficiency. This article is the first to use the gas field to embed data to improve the embedding rate. Use the random numbers generated by the Mersenne Twister algorithm to disrupt the order of addresses to improve the concealment of reused addresses. Experiments have shown that the two schemes have higher communication efficiency and better embedding rate than existing schemes.
Josef Koumar, Richard Plný, Tomáš Čejka
While the popularity of cryptocurrencies and the whole industry's value are rising, the number of threat actors who use illegal “coin miner mal ware” is increasing as well. The threat actors commonly use computational resources of companies, research and educational institutions, or end users. In this paper, we analyzed the long-term periodic behavior of the cryptocurrency miners communicating in computer networks. We propose a novel method for cryptominers detection using specially designed periodicity features. The detection algorithm is based on the mathematical detection of periodic Flow time series (FTS) and feature mining. Altogether with the Machine Learning technique, the resulting system achieves high-precision performance. Furthermore, our approach enhances a flow-based cryptominers detection system DeCrypto to further improve its reliability and feasibility for high-speed networks.
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.