Md. Sameeruddin Khan, Tom Chen, Mithileysh Sathiyanarayanan, Mohammed Mujeerulla · 5 authors
The Internet of Things (IoT) model is presented in this paper with multi-layer security based on the Lenstra-Lenstra-Lovasz (LLL) algorithm. End nodes for the Internet of Things include inexpensive gadgets like the Raspberry Pi and Arduino boards. It is not practical to run rigorous algorithms on them, as opposed to computer systems. Therefore, a cryptography procedure is required that could function on this IOT equipment. Bitcoins and Ethereum are examples of cryptocurrency and Ripple employs techniques such as elliptic curve digital signature, Elliptic-Curve Diffie-Hellman (ECDH), and algorithm to sign any cryptocurrency on SECP256k1 elliptic curves transactions. By using Lenstra-Lenstra-Lovasz on a real-world Bitcoin blockchain and applying it to multiple dimensions, such as nonce leakage and weak nonces across several elliptic curves with different bit sizes on a Raspberry Pi, we can demonstrate the security of elliptic curve cryptosystems. Public key encryption techniques are seriously threatened by the development of quantum computing. Therefore, employing lattice encryption with Nth Degree Truncated Polynomial Ring Units (NTRU-NTH) on the Bitcoin blockchain will increase the resistance of Bitcoin blocks to quantum computing assaults. The execution time taken on SECP256k1 is 131.7 Milli seconds comparatively faster than NIST-224P and NIST-384P.
Threshold cryptography is a powerful and well-known technique with many applications to systems relying on distributed trust. It has recently emerged also as a solution to challenges in blockchain: frontrunning prevention, managing wallet keys, and generating randomness. This work presents Thetacrypt, a versatile library for integrating many threshold schemes into one codebase. It offers a way to easily build distributed systems using threshold cryptography and is agnostic to their implementation language. The architecture of Thetacrypt supports diverse protocols uniformly. The library currently includes six cryptographic schemes that span ciphers, signatures, and randomness generation. The library additionally contains a flexible adapter to an underlying networking layer that provides peer-to-peer communication and a total-order broadcast channel; the latter can be implemented by distributed ledgers, for instance. Thetacrypt serves as a controlled testbed for evaluating the performance of multiple threshold-cryptographic schemes under consistent conditions, showing how the traditional micro benchmarking approach neglects the distributed nature of the protocols and its relevance when considering system performance.
Secure multi-party computation is an area in cryptography which studies how multiple parties can compare their private information without revealing it. Besides digital protocols, many unconventional protocols for secure multi-party computation using physical objects have also been developed. The vast majority of them use playing cards as the main tools. In 2024, Kaneko et al. introduced the use of a balance scale and coins in zero-knowledge proof protocols for pencil puzzles. In this paper, we extend the use of these tools to secure multi-party computation. In particular, we develop four protocols that can securely compute any $n$-variable Boolean function using a balance scale and coins.
Internet of Things (IoT) is adopted in a wide spectrum of applications in which a vast amount of data are produced and distributed to centralized cloud platforms to deliver various services. It involves smart devices that collect thousands of terabytes of heterogeneous data and deployed this to make instant decision that aids for the better performance and most comfort life. Traditional IoT architecture is heavily centralized, where it stores the most sensitive information that creates the multiple threats and security breaches as the attackers target towards these centralized cloud systems. To improve the security chain in IoT environment, edge computing (EC) was introduced to distribute the applications of IoT at the edge of the communication networks. However, these edge-based IoT are also vulnerable to many threats due to their decentralized and in secured management. Block chain (BC) technology offers a most trusted solution to resolve the security issues in the IoT-Edge computing environment. This research study presents the block chain driven medical image encryption technique using modified honey badger optimization with the ensemble chaotic systems. The proposed block chain framework uses the divergent methods that integrates differential scroll, Hénon chaotic maps and modified honey badger optimization to generate the optimum keys and high secured image data. These high secured data are stored in the block chain, ensuring the image security to be stored in edge nodes. The complete framework was experimented using Ethereum using Ganache API and Python3.19 are utilized as the major programs for designing the varied interfaces of the recommended model. The comprehensive experimentation is undertaken to assess the security strength of the recommended encryption scheme. The evaluation metrics like as NACI, UACI, Entropy and standard verification methods such as NIST standard tests are deployed and analyzed. To prove it security strength, proposed secured BC framework is compared with the wide-variety of secured frameworks. The experimental findings reveal that the suggested framework establishes a more robust and secure environment for image exchange, surpassing the performance of other blockchain-based systems in terms of integrity, robustness and security. Finally, the paper spreads the bright light of advantages in deploying the proposed framework to formulate the most secured environment in the IoT-Edge environment for medical image transmission.
Open access
Blockchain Technology Applications and Security
Advanced Steganography and Watermarking Techniques
Currently, PAKE (Password Authenticated Key Exchange) protocols on lattice using a single-server architecture are widely applied. However, such protocols are vulnerable to server leakage attacks, dictionary attacks, and other threats. To address these issues, researchers have proposed multi-server and two-server architecture-based PAKE protocols. However, PAKE protocols in a multi-server architecture require the use of complex cryptographic primitives such as signatures, and zero-knowledge proofs to ensure security, which reduces the execution efficiency of the protocol. To solve these problems, we propose a two-server PAKE protocol on the lattice based on the MLWE (Module learning with errors) problem. The protocol is built using instances of the MLWE problem and utilizes the Peikert error coordination technique, which ensures both parties with similar values arrive at the same result through computation. Additionally, we introduce the error pairing hypothesis and demonstrates its security within the random oracle model. The protocol securely stores different shares of password information across various servers. This approach protects user password data, even if one of the servers is compromised. Compared to similar protocols, we avoid the use of numerous cryptographic primitives, and can better resist quantum computing attacks and server leakage. And we reduce computational and communication costs, and can better meet practical application needs.
In an era where digitalization has dominated the financial world, cryptographic methods have become the foundation of secure transactions and data integrity. This report conducts an in-depth analysis of the cryptographic methods used in modern cryptocurrencies, namely Bitcoin and Ethereum, and traditional banking systems. The strengths, limitations and implications regarding security and scalability will be highlighted. Bitcoin, employing the usage of Elliptic Curve Cryptography (ECC) and the Secure Hash Algorithm (SHA-256) offers a robust and decentralized architecture heavily resistant to modern threats such as brute force attacks, as well as future threats that may arise with the rapid development of quantum computing. Ethereum takes the fundamental principles of Bitcoin, and enhances them with innovations like Keccak-256, and Recursive Length Prefix (RLP) encoding, optimizing the security and efficiency for complex operations such as smart contracts. Comparatively, traditional banking systems utilize a hybridized cryptographic system, incorporating the usage of methods like AES and ECC to balance security with performance within a centralized financial system, however often constrained by the vulnerabilities methods like AES brings, such as information leakage and overall human error. This comparative analysis highlights the trade-offs between these three systems, offering critical insights into the rapidly evolving role that cryptography is taking in shaping the future of the financial world. The findings presented in this report offer actionable recommendations for advancing cryptographic techniques and adopting decentralized systems to enhance the resilience of commonly used financial systems out in the world today.
As quantum computing advances, classical public-key cryptosystems face escalating risks, driving global standardization efforts by NIST, ETSI, and ISO. This paper provides a comprehensive review of recent developments in post-quantum cryptography (PQC), focusing on lattice-based, hash-based, and multivariate approaches. We examine their security foundations, implementation challenges, and applicability across domains such as finance, blockchain, and the Internet of Things (IoT). A core contribution is the proposed Hybrid Cryptographic Framework (HCF), which combines classical and quantum-resistant primitives to enable a secure and interoperable migration path. The framework integrates hybrid key exchange, dual-signature schemes, and PQC-compatible Merkle trees, and is supported by a discrete multi-objective optimization model for selecting algorithms under real-world constraints. The paper also discusses deployment challenges, including hardware acceleration, side-channel resistance, and legacy compatibility. Real-world case studies illustrate how leading institutions are piloting PQC integration in practice. Finally, we propose a strategic roadmap for PQC adoption, incorporating adaptive triggers based on quantum capabilities and evolving threat models. By aligning cryptographic design with international standards and practical system requirements, this work offers guidance for building resilient, quantum-safe infrastructures.
Delaram Kahrobaei, Ludovic Perret, Martina Vigorito
Abstract Bidoux and Gaborit introduced a new general technique to improve zero-knowledge ( ZK ) proof-of-knowledge ( PoK ) schemes for a large set of well-known post-quantum hard computational problems such as the syndrome decoding, the permuted kernel, the rank syndrome decoding, and the multivariate quadratic ( MQ ) problems. In particular, the authors’ idea in the study of Bidoux and Gaborit was to use the structure of these problems in the multi-instance setting to minimize the communication complexity of the resulting ZK PoK schemes. The security of the new schemes is then related to new hard problems. In this article, we focus on the new multivariate-based ZK PoK and the corresponding new underlying problem: the so-called <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msub> <m:mrow> <m:mi mathvariant="monospace">DiffMQ</m:mi> </m:mrow> <m:mrow> <m:mi mathvariant="normal">H</m:mi> </m:mrow> </m:msub> </m:math> {{\mathtt{DiffMQ}}}_{{\rm{H}}} . We present a new efficient probabilistic algorithm for solving the <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:msub> <m:mrow> <m:mi mathvariant="monospace">DiffMQ</m:mi> </m:mrow> <m:mrow> <m:mi mathvariant="normal">H</m:mi> </m:mrow> </m:msub> </m:math> {{\mathtt{DiffMQ}}}_{{\rm{H}}} which is polynomial-time if <m:math xmlns:m="http://www.w3.org/1998/Math/MathML"> <m:mi>m</m:mi> <m:mo>−</m:mo> <m:mi>n</m:mi> <m:mo>∈</m:mo> <m:mi>O</m:mi> <m:mrow> <m:mo>(</m:mo> <m:mrow> <m:mn>1</m:mn> </m:mrow> <m:mo>)</m:mo> </m:mrow> </m:math> m-n\in O\left(1) . We also present experimental results showing that the algorithm is efficient in practice.
Михайленко, Олександр Ігорович, Гороховський, Кирило Семенович, Гороховський, Семен Самуїлович
The paper explores the possibility of expanding the use of end-to-end encryption protocols based on the Double Ratchet algorithm in applications with low trust in the server, particularly in turn-based games and strategic interactions. The relevance of the research is due to the growing need for secure communication in cyberattacks, especially during military operations. The field of end-to-end encryption requires the study of additional applications beyond the usual ones, such as encrypted communication in text messengers. The developed implementation of the protocol can be safely used in any applications that aim to implement end-to-end encryption and satisfy the criterion of session ephemerality (in cases where secrets are stored outside a secure environment). The implemented server supports ephemeral sessions, which guarantee minimal risks of information compromise, and uses digital signatures (EdDSA) for user authentication. Logical routing of requests ensures efficient message transmission in secure scenarios. The choice of the classic game of checkers as an example allowed the authors to effectively demonstrate the advantages of end-to-end encryption and the capabilities of the implemented protocol. All cryptographic operations, including key generation, encryption and decryption of messages, are successfully performed on client devices. It is important to improve error handling mechanisms and optimize the operation of WebAssembly. An interesting area of further research is the creation of zero-knowledge proof mechanisms to prevent Man-In-The-Middle attacks during the creation of a shared secret, optimizing integration with cryptographic hardware security modules (HSM), and exploring the scalability of the solution. The proposed approach can be used to solve real-world information security problems where trust in the data transmission channel is critically important. Thus, the work has created a comprehensive solution that includes a cryptographic protocol, a backend, and a web client, which demonstrates the viability of end-to-end encryption in browser environments and multiplayer games. The work can be used as a basis for further research and development in the field of security of communication systems and privacy in multiplayer games.
The design of financial instruments and processes is contingent on the infrastructure supporting them. Blockchain technology, as utilised by public crypto networks such as Ethereum, represents a novel type of payment and settlement infrastructure that gives rise to a new generation of solutions. This paper discusses the key properties of this technology, including immediacy, omni-asset capability, programmability and its ability to flatten the financial architecture (disintermediation). We illustrate the distinctive products these features make possible, and have the potential to disrupt current payment and capital market systems. We discuss the utility of blockchain technology in private (permissioned) networks. Finally, we revisit the risks of public crypto networks and their mitigants. This article is also included in the Business & Management Collection which can be accessed at https://hstalks.com/business/.
The business world is seeing towards the cryptocurrency as a future currency. A very less literature is available on cryptocurrencies. This research paper focused on the concept, features, history and the mechanism of cryptocurrency. It also discussed the current status of cryptocurrencies in India and some leading cryptocurrencies with their market cap. While considering cryptocurrency as a digital investment, its pros and cons are to be kept in mind, which are also included in this research paper.
Senthil G. A, R. Prabha, R. Avudainayaki, Srinidhi Sundaram · 5 authors
Due to the rise of cryptocurrencies and blockchain technology, banking is changing forever through introducing transparent, secure, and decentralized solutions. They strongly rely on solid mathematics to ensure the security and functionality of these technologies. This paper explores the importance of mathematics in blockchain and cryptocurrency systems. In this article, we take a look at the properties of cryptographic hash functions which are necessary for tamper–evidence data integrity and blockchain records immutability. Next, we dive into public-key cryptography and digital signatures, which are core to the security of transactions and user authentication. These aspects are essential to maintaining secure communication and identity verification within the blockchain realm. So not PoW—because everyone knows PoW now—we go to another method of consensus such as a PoS, for example. With PoS, validation is dependent on ownership of bit coin rather than the vastly voracious computational power that PoW is reliant upon, thus making PoS more energy efficient and opening a wider net in terms of network participation. It discusses about the role of error-correcting codes in blockchain systems, and why they are needed to ensure that data is protected from unintentional corruption or deliberate attacks. These codes guarantee information saved on the blockchain has reliability and sustainability. These methods also include mathematical modeling and game theoretic applications to blockchain design that study participant behavior, promote cooperative behaviors, and deter malicious actions. In the world of cryptocurrency, these mathematical principles have particular applications; cryptographic techniques are used by consensus mechanisms and smart contracts to ensure privacy in decentralized and secure transactions. It is a powerful new area of mathematics that offers exciting possibilities for blockchain applications particularly for privacy-preserving transactions and computations. We provide a comprehensive overview of these essential mathematical concepts in order to provide developers, investors, and policymakers an insight into the underlying technology that sustains blockchain and cryptocurrency systems. All of which allows stakeholders to confidently orient themselves in this fast-emerging area. Lastly, we baptize some path-breaking directions for blockchain, including homomorphic encryption which enables evaluating expressions on ciphertexts.
Mohamadsajad afkhami, Mahmoud baghani, Amir toranjsimin, Hamid‐Reza Mahrooghi
This article introduces a secure and efficient framework for the storage and validation of medical images using the Ethereum blockchain platform, incorporating the decentralized capabilities of the Interplanetary File System (IPFS) and digital signature methodologies employing zero watermarking. Medical images are critical to patient diagnosis and treatment, necessitating robust security measures, especially during transmission over insecure networks. Our approach utilizes chaotic sequences and transformations through Integer Wavelet Transform (IWT) and Singular Value Decomposition (SVD) to create a digital signature that ensures the integrity and privacy of the images without modifying their content. The solution encrypts medical images before storing them in IPFS with their corresponding digital signatures to safeguard confidentiality. Upon access, the images are decrypted and their signatures are checked to confirm their integrity. The effectiveness of this methodology is demonstrated by its strong resilience to network disturbances and potential security threats, achieving an average Normalized Correlation (NC) value of 0.97. This performance underscores the potential of integrating advanced cryptographic techniques with blockchain technology to enhance the security of medical image data.
Open access
Advanced Steganography and Watermarking Techniques
What will computer security look like in the year 2100? This talk will begin with a few predictions that aim to suggest a few research directions in the present. We will then transition to the exciting area of applied zero knowledge proofs, an area that has seen tremendous growth in recent years. We will describe some of the new ideas in the space and focus on a number of remarkable real-word applications of these techniques. The talk will be self contained and accessible to all.
Abstract The image protection of non‐fungible tokens based on zero‐watermark methods has received widespread attention. However, on the one hand, existing zero‐watermark methods are often limited to complex texture changes in the host image, and the features for constructing the zero‐watermark are vulnerable to geometric attacks. On the other hand, a single watermark image cannot adapt to the diverse usage scenarios of non‐fungible tokens. This paper proposes a robust personalized zero‐watermark scheme to address the challenges above. Firstly, the image regions suitable for constructing zero‐watermarks are highlighted by the non‐uniform weighted reconstruction, and the U‐Net is introduced for feature extraction against the geometric attacks. At the same time, the watermark images generated by generative models that are suitable for the usage scenario have achieved zero‐watermark addition and protection for non‐fungible token image content. The proposed method has been experimentally verified to have a certain degree of robustness in geometric and non‐geometric attacks.
Open access
Advanced Steganography and Watermarking Techniques