Multiple internet services rely on the Diffie–Hellman (DH) algorithm for security. In spite of this, a study from October 2015 reveals that many DH-based internet applications are not protected adequately from highly resourced attackers, including the security services of some nations. To improve the security of data while it is in transit over an unsecured network, a novel method for encrypting and decrypting voice signals is presented in this research. The Diffie–Hellman algorithm, a specific form of asymmetric key cryptography, is the basis of the presented technique. This method&s;s primary value is that it lets users encrypt and decode their conversations using an encrypted session key. To begin, the dispatcher uses the agreed-upon secret key to encrypt the incoming speech signal using this technique. Second, the encrypted voice signal is transmitted through a public network to reach its final destination. To begin, we implemented a client-side encryption system to better protect sensitive information while still allowing for secure communication between client and server. Key exchange is protected from man-in-the-middle and discrete logarithm attacks with the help of the modified Diffie–Hellman method and from unauthorized access with the help of the modified Zero Knowledge Proof (ZKP) method. Criteria for evaluation include file size, time to generate keys, time to encrypt and decode data, and time to execute the algorithm.
Blockchain technology has evolved from its origins in cryptocurrencies to become a fundamental component of secure digital interactions across diverse sectors, including healthcare, finance, and public administration. This article delves into the theoretical and practical applications of cryptography within blockchain networks, emphasizing key cryptographic functions, algorithms, and protocols such as RSA, elliptic curve cryptography (ECC), and SHA-256. It scrutinizes the use of digital signatures for transaction verification and the crucial role of hash functions in ensuring data integrity. Additionally, the article presents practical examples of symmetric and asymmetric encryption methods, underscoring their significance in maintaining privacy and security. The study also highlights the emerging challenges posed by quantum computing and explores ongoing research in post-quantum cryptography. Furthermore, it provides insights into the advancements in cryptographic techniques essential for the robustness of decentralized networks. By linking theoretical frameworks with practical implementations, this article aims to offer a comprehensive understanding of the cryptographic security measures pivotal for the future of blockchain technology.
Open access
Blockchain Technology Applications and Security
Advanced Steganography and Watermarking Techniques
The development and increased accessibility of quantum computing paradigms will significantly compromise traditional cryptographic protocols. Decentralized data systems, specifically those built to handle concurrent data transactions such as the blockchain, will be vulnerable to quantum attacks - due to the stark disparity in computational strength and speed relative to classical computing systems. Although quantum computing is still in its infancy, its future threat to data security is imperative. This threat is amplified when considering resource-constrained systems that optimize transaction throughput, which is true for Internet of Things (IoT) devices and infrastructures. Thus, this paper proposes a novel architecture for a Dual-Factor Quantum-Safe Blockchain (DFQSB) to ensure latency minimization and fortify against quantum threats. Before proposing the quantum-safe blockchain, we conduct a background review of blockchain, post-quantum cryptography (PQC), and quantum key distribution (QKD). Then, we describe the proposed DFQSB architecture and provide an overview of the platform, workflow, and modularity. Finally, we identify potential algorithms that can work within the architecture, outline limitations, and make recommendations.
Poulami Das, Andreas Erwig, Michaël Meyer, Patrick Struck
Cryptocurrency networks crucially rely on digital signature schemes, which are used as an authentication mechanism for transactions. Unfortunately, most major cryptocurrencies today, including Bit-coin and Ethereum, employ signature schemes that are susceptible to quantum adversaries, i.e., an adversary with access to a quantum computer can forge signatures and thereby spend coins of honest users. In cryptocurrency networks, signature schemes are typically not executed in isolation, but within a so-called cryptographic wallet. In order to achieve security against quantum adversaries, the signature scheme and the cryptographic wallet must withstand quantum attacks.
In IoT(Internet of Things) Traditional authentication methods, such as passwords or public-key cryptography, often encounter challenges related to security, efficiency, and scalability. In response, Present work proposed a streamlined alternative utilizing Zero-knowledge proofs(ZKPs), allowing users to prove their identity with minimal exposure to sensitive information. Emphasizing the need for optimization in computational resources, this approach becomes particularly valuable in the context of Internet of Things application(IOTA). Current work introduces a novel method for authentication that combines the concept of isomorphic graphs from multi-graph ZKP with ZeroKnowledge Succinct Non-Interactive Argument of Knowledge (Zk-SNARKs), along with multi-threading in the IOTA ecosystem. This advancement represents a significant step forward in scalability and provides a solution to the increasing need for secure and effective authentication methods.
Abstract The evolution of decentralized storage, propelled by blockchain advancements, has revolutionized data management. This paper focuses on content security in the InterPlanetary File System (IPFS), a leading decentralized storage network lacking inherent content encryption. To address this vulnerability, we propose a novel hybrid cryptographic algorithm, merging AES 128-bit encryption with Elliptic Curve Cryptography (ECC) key generation. The algorithm includes ECC key pairs, random IV generation, and content/AES key encryption using ECC public keys. Benchmarking against standard AES 256-bit methods shows a significant 20% acceleration in encryption speed and a 16% increase in decryption efficiency, affirming practicality for enhancing IPFS content security. This research contributes to securing decentralized storage and provides a performance-driven solution. The promising results highlight the viability of the proposed approach, advancing understanding and mitigating security concerns in IPFS and similar systems.
In a decentralized environment of blockchain, people usually select a random node to perform bookkeeping with the Proof of Stake (PoS) consensus mechanism. To randomly select miners and validators and ensure fair distribution of rewards, the algorithm must incorporate a fair, unbiased random number source. Therefore, in many PoS consensus mechanisms, random numbers are a critical technology. PoS consensus faces the following problems in random number generation: Firstly, in the PoS system, if the number and order of the selected verification nodes are predicted by the attacker, the system will be vulnerable to attacks. Second, if the random number generation algorithm has loopholes or is cracked by an attacker, the attacker may use these loopholes to attack the network, resulting in the insecurity of the PoS system. To address the challenges above, this paper proposes a low-cost, light-weighted, true random number generator designed by a sensors that detects non-deterministic signals. The random numbers generated through this method passed the NIST-STS randomness test. The true random number generator is applied to the commit-reveal service in PoS consensus to randomly elect block producer. Using the random number generated can also enhance IoT security because Photoresistor sensors have applications in IoT systems for smart building. The random number generated by the IoT device can be used as the basis for randomness proof on the blockchain. And the cloud can also use the randomness for identity verification, secure event tracing, data integrity and tamper resistance.
Chaos-based Image/Signal Encryption
Advanced Steganography and Watermarking Techniques
Xin Liu Xin Liu, Xiaomeng Liu Xin Liu, Dan Luo Xiaomeng Liu, Gang Xu Dan Luo · 5 authors
<p>Secure multi-party computation is a hotspot in the cryptography field, and it is also a significant means to realize privacy computation. The Millionaires&rsquo; problem is the most fundamental problem among them, which is the basic module of secure multi-party computation protocols. Although there are many solutions to this problem, there are few anti-malicious adversarial protocols besides protocols based on Yao&rsquo;s garbled circuit. Only a few solutions have low efficiency, and there is no protocol for rational numbers comparison under the malicious model, which restricts the solution of many secure multi-party computation problems. In this paper, the possible malicious behaviors are analyzed in the existing Millionaires&rsquo; problem protocols. These behaviors are discovered and taken precautions against through the triangle area formula, zero-knowledge proof, and cut-and-choose method, so the protocol of comparing confidentially rational numbers is proposed under the malicious model. And this paper adopts the real/ideal model paradigm to prove the security of the malicious model protocol. Efficiency analysis indicates that the proposed protocol is more effective than existing protocols. The protocol of rational numbers comparison under the malicious model is more suitable for the practical applications of secure multi-party computation, which has important theoretical and practical significance.</p> <p>&nbsp;</p>
Empowered by the blockchain technology, cryptocurrencies have become quite popular in recent years. In account-based cryptocurrency systems, maintaining the state of every account is essential for a node to validate transactions, which generally requires a large storage space. In addition to this efficiency issue, privacy issues in cryptocurrency systems attract people's increasing attention. To address the above issues, this paper proposes a privacy-preserving stateless cryptocurrency system named PPSC. Specifically, PPSC reduces the storage cost of a node by employing the aggregatable sub-vector commitment scheme (aSVC). The node only needs to maintain a commitment of the large state vector. And transactions can be validated in a stateless manner. The aSVC scheme is also utilized to hide the value of a transaction. By utilizing the ring signature scheme, PPSC can hide the sender and the receiver of a transaction from third parties. Simulation results demonstrate that PPSC is space efficient, and the time overhead for privacy preserving is acceptable.
Bitcoin uses the elliptic curve Secp256k1 for its security operations. This article analyzes and compares various elliptic curves to identify the most secure curve for implementation. Our comparison examines the resistance of these curves to several attacks: Brute force, Anomalous, Baby-step Giant-step, Pollard rho, Pohlig-Hellman, and field discriminant in complex multiplication. Our findings indicate that the curves Ed22519, Ed448-Goldilocks, and E-521 offer superior security compared to the other evaluated curves, thus providing clear guidance for their adoption in Bitcoin cryptography.
Chaos-based Image/Signal Encryption
Advanced Steganography and Watermarking Techniques
Creating a blockchain, particularly a cryptocurrency, is a complex task that demands a profound understanding of the technical, economic, legal, and social challenges it faces. In this work, we seek to explore the various technical obstacles hindering the development and adoption of Blockchains. The article proposes a basic modeling approach to overcome these challenges and achieve a generic prototype for a new blockchain. We delve into specific challenges related to cryptocurrency creation, highlighting architecture choices, security strategies, and the benefits of a decentralized P2P approach. This research contributes to understanding decentralized systems and provides a practical guide for those aiming to build robust cryptocurrencies. This approach was experimented with using a cryptocurrency as an example. The results were conclusive, particularly in terms of its security, evolution, and consensus.
Blockchain Technology Applications and Security
Advanced Steganography and Watermarking Techniques
The emergence of Bitcoin as a disruptive force in the business and finance space, starting an extensive examination of its origin, technology foundations, effects on trade, and where it will go from here, has set off a chain reaction. This research paper takes us through the broad range of Bitcoin landscapes, examining its past context, fundamental features, and underpinning technologies for a decentralized framework. The exploration begins with the introduction, which serves as a starting point for an in-depth analysis that explains the background, scope, and significance of the study. Before a dedicated section on Bitcoin, which discusses its roots, developmental evolution and fundamental features that distinguish it from the digital asset field, is an introductory overview of cryptocurrencies. Regulatory complexity, security risks and the risk to business in an evolving cryptocurrencies ecosystem are highlighted by a comprehensive assessment of challenges and concerns. Anticipating the future of Bitcoin occupies the eighth section, where scaling solutions like Segregated Witness (SegWit) and the Lightning Network are discussed. In addition, potential developments which might occur in the Bitcoin landscape such as integration of smart contracts and collaboration with other technologies can also be seen. This research project is intended to provide valuable insight into the current discussion about how bitcoin has fundamentally changed the business landscape and its future development.
Blockchain Technology Applications and Security
Advanced Steganography and Watermarking Techniques
The advent of the digital era and computer-based remote communications has significantly enhanced the applicability of various sciences over the past two decades, notably data science (DS) and cryptography (CG). Data science involves clustering and categorizing unstructured data, while cryptography ensures security and privacy aspects. Despite certain CG laws and requirements mandating fully randomized or pseudonoise outputs from CG primitives and schemes, it appears that CG policies might impede data scientists from working on ciphers or analyzing information systems supporting security and privacy services. However, this study posits that CG does not entirely preclude data scientists from operating in the presence of ciphers, as there are several examples of successful collaborations, including homomorphic encryption schemes, searchable encryption algorithms, secret-sharing protocols, and protocols offering conditional privacy. These instances, along with others, indicate numerous potential solutions for fostering collaboration between DS and CG. Therefore, this study classifies the challenges faced by DS and CG into three distinct groups: challenging problems (which can be conditionally solved and are currently available to use; e.g., using secret sharing protocols, zero-knowledge proofs, partial homomorphic encryption algorithms, etc.), open problems (where proofs to solve exist but remain unsolved and is now considered as open problems; e.g., proposing efficient functional encryption algorithm, fully homomorphic encryption scheme, etc.), and hard problems (infeasible to solve with current knowledge and tools). Ultimately, the paper will address specific solutions and outline future directions to tackle the challenges arising at the intersection of DS and CG, such as providing specific access for DS experts in secret-sharing algorithms, assigning data index dimensions to DS experts in ultra-dimension encryption algorithms, defining some functional keys in functional encryption schemes for DS experts, and giving limited shares of data to them for analytics.
Saba Inam, Shamsa Kanwal, Rabia Firdous, Fahima Hajjej
Improved software for processing medical images has inspired tremendous interest in modern medicine in recent years. Modern healthcare equipment generates huge amounts of data, such as scanned medical images and computerized patient information, which must be secured for future use. Diversity in the healthcare industry, namely in the form of medical data, is one of the largest challenges for researchers. Cloud environment and the Block chain technology have both demonstrated their own use. The purpose of this study is to combine both technologies for safe and secure transaction. Storing or sending medical data through public clouds exposes information into potential eavesdropping, data breaches and unauthorized access. Encrypting data before transmission is crucial to mitigate these security risks. As a result, a Blockchain based Chaotic Arnold's cat map Encryption Scheme (BCAES) is proposed in this paper. The BCAES first encrypts the image using Arnold's cat map encryption scheme and then sends the encrypted image into Cloud Server and stores the signed document of plain image into blockchain. As blockchain is often considered more secure due to its distributed nature and consensus mechanism, data receiver will ensure data integrity and authenticity of image after decryption using signed document stored into the blockchain. Various analysis techniques have been used to examine the proposed scheme. The results of analysis like key sensitivity analysis, key space analysis, Information Entropy, histogram correlation of adjacent pixels, Number of Pixel Change Rate, Peak Signal Noise Ratio, Unified Average Changing Intensity, and similarity analysis like Mean Square Error, and Structural Similarity Index Measure illustrated that our proposed scheme is an efficient encryption scheme as compared to some recent literature. Our current achievements surpass all previous endeavors, setting a new standard of excellence.
Open access
Brain Tumor Detection and Classification
Chaos-based Image/Signal Encryption
Advanced Steganography and Watermarking Techniques
Bo Zhang, Tao Zhang, Zesheng Xi, Ping Chen · 6 authors
With the rapid development of the Internet of Things (IoT), ensuring secure communication between devices has become a crucial challenge. This paper proposes a novel secure communication solution by extracting wireless channel state information (CSI) features from IoT devices to generate a device identity. Due to the instability of the wireless channel, the CSI features are fuzzy and time-varying; thus, we a employ locally sensitive hashing (LSH) algorithm to ensure the stability of the generated identity in a dynamically changing wireless channel environment. Furthermore, zero-knowledge proofs are utilized to guarantee the authenticity and effectiveness of the generated identity. Finally, the identity generated using the aforementioned approach is integrated into an IBE communication scheme, which involves the fuzzy extraction of channel state information from IoT devices, stable identity extraction for fuzzy IoT devices using LSH, and the use of zero-knowledge proofs to ensure the authenticity of the generated identity. This identity is then employed as the identity information in identity-based encryption (IBE), constructing the device’s public key for achieving confidential communication between devices.
In decentralized finance (DeFi), stablecoins like DAI are designed to offer a stable value amidst the fluctuating nature of cryptocurrencies. We examine the class of crypto-backed stable derivatives, focusing on mechanisms for price stabilization and exemplified by the well-known stablecoin DAI from MakerDAO. For simplicity, we consider a single-collateral setting. We introduce a belief parameter to the simulation model of DAI in a previous work (DAISIM), reflecting market sentiments about the value and stability of DAI, and show that it better matches the expected behavior when this parameter is set within a particular range of values. Our methods include comparing simulated data with real-world data, focusing on monthly correlations between ETH and DAI prices and scatter plots illustrating the relationship of their price trends over time. We also propose a simple mathematical model of DAI price to explain its stability and dependency on ETH price. Finally, we analyze possible risk factors associated with these stable derivatives to provide valuable insights for stakeholders in the DeFi ecosystem.
This work is the first in literature to tackle the difficult open problem of determining the upper bound and threshold theorem for the TDCDP (time-dependent controller parameter) of the (Fokker Planck Kolmogorov) probability density function. This revolutionary exposition will put control theory and other related inter-disciplinary fields to a higher level towards contemporary control theory. Notably, based on the influential role of control theory in both engineering and industry, this paper will be of great value to all engineering and industry professionals who seek to know more about advanced trends within control theory settings. On the other remit of the spectrum, Fokker Planck Kolmogorov(FPK) equations are of high importance to physicists as well as mathematicians, based on their multiple applicability to information theory, graph theory, data science, finance, economics, and beyond. So, this by default adds more taste and credibility to this study. This leads by nature to introducing a different flavor to this ground-breaking research by highlighting the impact of Fokker Planck Kolmogorov(FPK) to revolutionize crypocurrency,which have received its name because it uses encryption to verify transactions, a new debatable digital payment system that doesn't rely on banks to verify transactions. It&rsquo;s a peer-to-peer system that can enable anyone anywhere to send and receive payments. The paper ends with closing remarks combined with some challenging open problems and the next phase of research.
It is well-known that digital signatures can be constructed from one-way functions in a black-box way. While one-way functions are essentially the minimal assumption in classical cryptography, this is not the case in the quantum setting. A variety of qualitatively weaker and inherently quantum assumptions (e.g. EFI pairs, one-way state generators, and pseudorandom states) are known to be sufficient for non-trivial quantum cryptography. While it is known that commitments, zero-knowledge proofs, and even multiparty computation can be constructed from these assumptions, it has remained an open question whether the same is true for quantum digital signatures schemes (QDS). In this work, we show that there $\textit{does not}$ exist a black-box construction of a QDS scheme with classical signatures from pseudorandom states with linear, or greater, output length. Our result complements that of Morimae and Yamakawa (2022), who described a $\textit{one-time}$ secure QDS scheme with classical signatures, but left open the question of constructing a standard $\textit{multi-time}$ secure one.