Mehmet Ali AygĂŒl, Hakan Ali Ăırpan, HĂŒseyin Arslan
This paper proposes a novel multi-party key generation method that jointly utilizes channel state information (CSI) and blockchain technology to enhance security in distributed systems. The proposed method starts by extracting CSI from wireless channels, leveraging the channelsâ inherent randomness and reciprocity to generate secure key fragments shared among legitimate parties. Then, the key generation process involves several stages, including quantization, reconciliation, and privacy amplification, ensuring that the resulting keys are secure and synchronized across participants. Blockchain technology is then leveraged to securely commit these keys, ensuring that the key agreements are recorded in a decentralized, tamper-resistant ledger. The proposed method effectively combines the physical-layer properties of CSI with the decentralized nature of blockchain, providing robust protection against eavesdropping and tampering attacks. Theoretical analyses and simulation results demonstrate the effectiveness of the proposed method in terms of key mismatch probability and secrecy capacity. Additionally, the randomness of the generated keys by the proposed method is validated using the National Institute of Standards and Technology randomness tests.
Mingwang Zhang, Liming Zhang, Tao Tan, Yang Zhao-jun · 5 authors
ABSTRACT With the rapid advancement of autonomous driving, the privacy and credibility of highâdefinition (HD) maps, which serve as an essential foundation for driving safety, are receiving increasing attention. Traditional ciphertextâdomain digital watermarking technology encounters high computational overhead and risks of privacy leakage, making it challenging to balance data security, privacy protection, and trustworthiness verification. Against this background, a zeroâknowledge watermark (ZKW) algorithm based on compressed sensing is proposed. First, the highâprecision map data in OpenDrive format is dynamically encrypted using DNAâbased techniques to enhance data security and privacy. Secondly, to ensure the credibility of data verification, a zeroâknowledge watermark is generated using compressed sensing and embedded into the attribute values of ciphertextâdomain data as invisible characters. Experimental results demonstrate that the proposed ZKW scheme is commutative with the encryption scheme and can achieve zeroâknowledge proof (ZKP) in both ciphertext and plaintext domains. Furthermore, the scheme exhibits excellent robustness against various security threats, including geometric attacks, cropping attacks, and combined attacks.
Advanced Steganography and Watermarking Techniques
The dawn of the disruptive quantum computing scenario marks a serious threat to the existence of traditional cryptosystems. With laws such as Shorâs, capable of factoring large integers in polynomial time, and Groverâs, able to speed up brute-force key searches, these attacks make conventional public-key infrastructures increasingly vulnerable, whereas even symmetric ciphers lose good measure of their strength. In this article, we focus on an elaborative description of a patented method for quantum-secure key generation, wherein Qabbalah (QBLH) complexity is utilized in the geometric-symbolic realm, in conjunction with magic number squares, phi/pi coordinate weighting, and tetrahedral trinary state encoding. The proposed system of TriGate QBLH Quantum-Safe Encryption converts seed inputs to multidimensional keys that resist linear algebraic attacks owing to non-linear permutations, irrational constant weighting, and topological complexity. Normally, pseudo-random number generators spatialize entropy in Euclidean geometry, as opposed to the present technique that places entropy in a completely non-Euclidean domain, where classical as well as quantum adversaries find it hard to traverse. We describe the method in detail, present its benefits over lattice- and hash-based post-quantum schemes, and walk through an example of its implementation. Consideration is also given to its potential integration with PQC standards, blockchain authentication, and decentralized finance applications. The system fuses symbolic mathematics, such as the 231 Gates of QBLH, with trinary logic mapped onto tetrahedral states to not only create encryption keys but also verifiable geometric signatures. This represents a paradigm shift toward geometric cryptography, which may be a viable method to realize scalable and trustworthy digital infrastructure in a quantum-threatened environment.
R. Praveen Kumar, G. Gautham Kumar, Arun Amaithi Rajan, V. Vetriselvi · 5 authors
Remote sensing and satellite imaging have become essential in various geological and surveillance applications. These systems often rely on cloud platforms for storing satellite and aerial images, introducing trust and security concerns, especially in sensitive domains like border surveillance, monitoring, and reconnaissance. Traditional cloud solutions are prone to data breaches and adversarial attacks, highlighting the need for a secure, end-to-end framework. To address this, we propose a comprehensive security architecture for storing and retrieving sensitive remote sensing images. Our system ensures confidentiality, integrity, and access control, while also resisting adversarial attacks during image retrieval. It adopts a three-phase structure: secure authentication, secure storage, and secure retrieval. Authentication is achieved using a combination of Zero-Knowledge Proof and Quantum Key Distribution, establishing a tamper-proof user verification process. In the storage phase, quantum-based cryptography secures the images, while a deep hashing model resistant to adversarial attacks enables efficient indexing and retrieval. A watermark embedding mechanism helps detect insider threats and support forensic tracking in case of data breaches. Evaluated on a remote sensing image dataset using various backbone networks, our system achieved a retrieval accuracy of 94.77%, outperforming existing models by 8â12%. The framework is well-suited for high-security environments, including military applications.
Chaos-based Image/Signal Encryption
Advanced Steganography and Watermarking Techniques
Cloud storage has undergone drastic improvements in recent years as it facilitates the storage of huge volumes of data. However, storing data in the cloud remains a complex task as it has to deal with security concerns. Blockchain is implemented to successfully avoid the security crises involved in the cloud storage network. Several approaches have been developed to secure data transmission within the cloud, but they have resulted in minimal throughput, failed in detecting threats, and consumed more time to transmit data. To address these complexities, a Hybrid Smart Contract-enabled Lightweight Authentication framework (HSC-LwA) is proposed to secure the transmission of data in a heterogeneous blockchain. The proposed HSC-LwA model works with hybrid concepts that include a consensus algorithm, Proof of Stake (PoS), and Proof of Work (PoW). This hybrid method incorporates a reward-based strategy to verify the transaction to add a block to the network. The primary task of this model is to safeguard the information within the cloud network and the data in a heterogeneous blockchain. The evaluation of the proposed HSC-LwA method obtained the values for Gas Transaction, Genuine user rate, Responsiveness, and Transaction Time is 286.87KB, 0.88, 6.73s, and 5.48s based on transaction analysis, whereas the model showed the improvement by obtaining the values for the above metrics as 330.12KB, 0.86, 6.32s, 5.55s with user analysis.
We propose N-choice game (NCG), a decentralized method for generating pseudo-random numbers for smart contracts. NCG involves multiple participants, each of whom chooses a value between 0 and \(N-1\) and whose collective choices determine the generation of a pseudo-random number. The design of NCG has three key objectives: incentivizing participants to make random choices, assessing randomness in a decentralized environment, and achieving high operational performance. Implemented in Solidity and rigorously tested, NCG has shown remarkable effectiveness. Our results show that the randomness of the numbers generated by NCG is high and consistent, even under a strict NIST randomness test, provided that there is no collusion between the majority of participants. Not only is it impossible to customize the outputs generated by NCG, but it is also impractical to make them non-random. Therefore, it is rational to engage NCG for the purpose of rewards rather than the output values it produces. Selecting values in a way that is not predicted by other nodes yields the highest expected value, and NCG incentivizes random selection. Furthermore, NCG demonstrates a significant performance advantage, being up to 158 times faster at generating random numbers than the existing Random Bit Generator framework [ 3 ]. This efficiency underscores NCGâs potential to enhance blockchain applications.
Blockchain Technology Applications and Security
Chaos-based Image/Signal Encryption
Advanced Steganography and Watermarking Techniques
Health-care is undergoing a considerable digital shift in the present state, which is driven by the rise of new technologies and the changes taking place globally. The movement is rebalancing the provision and availability of health care, at the same time that it highlights the importance of protecting confidential information about patients. Coupled with the cryptographic primitives, blockchain technology provides a formidable answer, as it promises to improve data integrity using decentralized processes. In this paper, a hybrid blockchain-based EHR management and security solution to Electronic Health Records (EHRs) is described. Having considered the drawbacks of the blockchain in its ability to work with large files the system is connected with Ethereum blockchain through Ganache and program construction tools is equipped with the InterPlanetary File System (IPFS). In the hybrid model, one does store each row hash (unique identifier) of the patients records on the blockchain, but one does not store the actual data on the blockchain, instead on IPFS. A Decentralized Application (DApp) built on the programing language of Ethereum, Solidity, and the web3.js interface also allows secure data access via cryptocurrency wallets like MetaMask. The use of smart contracts is deployed to process transactions to achieve transparency and verifiability. To enhance security the Elliptic Curve Digital Signature Algorithm (ECDSA) is adapted to provide unauthorised access. Results of simulation reveal that a suggested method is reliable in providing patient data security, maintain immutability, and secure exchange of data. The approach promotes transparency within the digital health-care systems and strengthens the stakeholder belief by allowing a decentralised structure of these systems.
This chapter delves into how cryptocurrencies and decentralized finance are transforming the traditional financial landscape. The chapter explains how digital currencies enable peer-to-peer transactions without intermediaries, making transfers faster, cheaper, and more secure. It then expands on DeFi, where financial services such as lending, borrowing, and trading are reimagined through smart contracts and blockchain technology, eliminating centralized gatekeepers. Real-world comparisons illustrate the advantages of DeFi over traditional finance, including lower fees, enhanced transparency, and greater accessibility for underserved populations. The discussion also covers the technological underpinnings â Layer 1 and Layer 2 solutions, smart contracts, and consensus mechanisms â highlighting how these innovations create a more inclusive, efficient, and trustless financial ecosystem.
Abstract The increasing levels of data collection and processing, and the consequential risks to both individual users and society, have led to rising demands for privacy. This chapter first discuses different notions of privacy, including anonymity, and how cryptography relates to them. It then reviews a range of cryptographic privacy-enhancing technologies that can be used to support a variety of privacy objectives. The first is Tor, which is used to support anonymity on the internet. Next, it is shown how zero-knowledge proofs enable truths to be communicated without revealing unnecessary information. The goal of secure multiparty computation (MPC) is to enable sensitive data from multiple sources to be input to a computation while maintaining the privacy of the component data items. Finally, a range of further technologies are introduced, including blind signature schemes, group signature schemes, homomorphic encryption, private set intersection and private information retrieval.
This paper unveils the LemniCoin ecosystem, advancing from a Binance Smart Chain (BSC) foundation to a quantum-resistant paradigm through the Lemniscate-AGM Isogeny (LAI) cryptosystem.Building on security audits conducted on March 27, 2025, and April 13, 2025, we introduce LemniCoin-QR (April 2025), a quantumhardened token; a secure wallet (May 2025); and LemniChain (December 2025), a Proof-of-Stake (PoS) blockchain.The Lemniscate-AGM Isogeny Problem (LAIP) underpins LAI, offering unparalleled resistance to quantum threats, surpassing Bitcoin (BTC) and Ethereum (ETH).We provide detailed proofs, audit insights, and implementation strategies, demonstrating superior security, transaction efficiency, and environmental sustainability-positioning LemniCoin as a premier investment in the post-quantum era.
In a time of rising cyber threats and widespread digital communication, protecting sensitive information is crucial. This paper offers a detailed survey and analysis of current methods in secure communication, focusing on the relationship between cryptographic systems and steganographic techniques. We base our work on foundational mathematics, especially commutative algebra, and use modern technologies like Generative Adversarial Networks (GANs), zero-knowledge proofs, and quantum-resistant algorithms. We present a layered approach to information security. We discuss how combining classical and modern cryptography with improved steganographic embedding and signal processing techniques highlights the need for hybrid and adaptable models to protect communication. This study aims to be a reference point for future research and development in secure digital systems. Key Words: Cryptography : from classical to post-quantum, Steganography and Data hiding Techniques, GAN-Based Steganography in wireless sensor network , Methodology Overview.
This chapter and Chapter 9 deal with crypto assets: first cryptocurrencies specifically (this chapter) and then stablecoins (Chapter 9). We look at the structures underpinning cryptocurrencies to see whether they can fulfil the classical attributes of money, that is, as a means of transactions, store of value, and unit of account, plus the other more complex functions discussed earlier. This chapter offers a complete overview of how cryptocurrencies work: blockchains, miners, distributed ledgers, and so on. It recaps the history of Bitcoin and details the structure of the transactions and its informational characteristics. Then we rate the performance of Bitcoin: transaction speed, user costs, mining rewards, privacy, environmental cost. We also consider variants of the Bitcoin scheme, such as Ethereum, with the potential advantages of âproof of stakeâ as opposed to âproof of work,â from the point of view of private users and social costs. Finally, we deal with security aspects: fraud, technical failures, scalability, and so on. The real-world case of El Salvador, the only country that attempted an official use of Bitcoin, with disastrous results, is mentioned. The conclusion is that Bitcoin and its peers are unlikely to be used broadly either as means of payment or as stores of value. However, they may eventually establish an interesting niche as part of diversified portfolios.
The major challenge in the existing communication system is maintaining the user's privacy while ensuring the pro- cess of verification and authentication. The conventional methods either jeopardize with user's privacy by linking the data or message to the source or fail to prevent false submissions because of weak authentication mechanisms. To address these issues, this paper proposes a Zero-Knowledge Proofs-based Quantum- resistant Anonymous and Authenticated Feedback System that optimizes Zero-Knowledge Succinct Non-Interactive Argument of Knowledge, shortly termed as zk-SNARKs, to enable secure, anonymous, and verifiable feedback submissions. The method presented in this research achieves strong authentication without sacrificing user privacy, which was not possible with traditional techniques like digital signatures, public-key infrastructure, and others. The system is resistant to impersonation and Sybil attacks because it uses zk-SNARKs to enable users to authenticate their permission to send feedback without disclosing their identity. Furthermore, the suggested framework is made to be postquantum secure, guaranteeing long-term resilience against sophisticated quantum attackers, since quantum computing poses a danger to traditional cryptographic techniques like RSA and ECC. Security, effectiveness, and practical viability of the system are assessed, based on which it is concluded that zk-SNARKs are a reliable and scalable basis for privacy-preserving feedback mechanisms and in various other applications like online dis- cussion forums, educational assessments. The study highlights how well zk-SNARKs succeeds in making a privacypreserving authentication system and mitigating the risk of quantum attacks.
Digital systems, networks, and data require robust cyber security measures to counter evolving cyber threats and unauthorized intrusions. Steganography enhances secure communication by embedding information within digital media such as images, audio, and video, rendering hidden messages nearly undetectable. However, traditional steganography suffers from vulnerabilities to steganalysis, limited data capacity, and exposure to statistical and machine learning-based attacks. To overcome these limitations, modern steganography systems integrate advanced cryptographic methods to enhance security and resilience. This review examines solutions combining the Advanced Encryption Standard (AES) for symmetric encryption, Rivest-Shamir- Adelman (RSA) for asymmetric encryption, Quantum Key Distribution (QKD) for secure key exchange, Elliptic Curve Digital Signature Algorithm (ECDSA) for lightweight authentication, and Zero-Knowledge Proof (ZKP) for privacy-preserving verification. These integrated techniques improve data confidentiality, prevent unauthorized access, and strengthen defences against steganalysis attacks. The study evaluates the performance, limitations, and prospects of these intelligent cybersecurity applications, highlighting their potential to advance secure data transmission in the digital landscape.
Advanced Steganography and Watermarking Techniques
bstract In order to give users instant access to market data, portfolio management features, and analytical tools, this research paper introduces CryptoTracker, a feature-rich real-time cryptocurrency tracking application. The system makes use of contemporary web technologies to provide a responsive interface that is constantly updated to reflect the state of the market. In addition to outlining the system's functionality, architecture, and implementation specifics, we also go into the difficulties in creating trustworthy cryptocurrency tracking tools in a volatile market. Keywords: Cryptocurrency, Real-time tracking, Portfolio management, Web technologies, Financial analysis, Data visualization
To solve the privacy leakage and identity island problems in cross-chain interaction, we propose an anti-quantum cross-chain identity authentication approach based on dynamic group signature (DGS-AQCCIDAA) for smart education. The relay-based cross-chain model promotes interconnection in heterogeneous consortium blockchains. DGS is used as the endorsement strategy for cross-chain identity authentication. Our approach can ensure quantum security under the learning with error (LWE) and inhomogeneous small integer solution (ISIS) assumptions, and it uses non-interactive zero-knowledge proof (NIZKP) to protect user identity privacy. Our scheme has low calculation overhead and provides anonymous cross-chain identity authentication in the smart education system.
Hala Saeed Omar, M. A. Elsisy, Tamer O. Diab, Wageda I. Elsobky
Smart contracts are blockchain-based algorithms that activate when specific conditions are fulfilled. They streamline the execution of agreements, allowing both parties to trust the outcome instantly without needing intermediaries or experiencing delays. To ensure secure and verified contract execution, cryptographic methods such as hash functions and digital signatures are used. Additionally, mathematical approaches like mathematical proofs and finite state machines are applied in designing and assessing smart contracts to guarantee their proper functionality. This paper explores the mathematical foundations of smart contracts, highlighting how they rely on mathematics to ensure immutability, security, and enforceability. A key technique behind their encryption methods is the pseudo-random number generator, which is based on chaotic maps. These chaotic maps generate highly random patterns depending on the initial seed value through complex mathematical operations. This work provides an overview of how chaotic maps are implemented in smart contracts. Additionally, the results obtained from these chaotic maps are presented showing that these maps achieve a high performance in digital signature algorithms.
Abstract: Algebraic geometry offers a powerful and elegant mathematical framework for the design and analysis of modern cryptographic protocols. This research paper investigates the application of algebraic geometry methodsâsuch as elliptic curves, abelian varieties, and projective algebraic structuresâin enhancing the security, efficiency, and scalability of cryptographic systems. By bridging advanced algebraic structures with cryptographic primitives, the study demonstrates how algebraic geometry enables the construction of secure public key protocols, zero-knowledge proofs, and post-quantum resilient schemes. Through theoretical modeling, performance benchmarking, and comparative analysis with classical cryptographic approaches, the paper illustrates the advantages of algebraic geometry in terms of computational hardness assumptions, structural integrity, and potential for innovation in secure communications. The findings contribute to the evolving landscape of cryptography by positioning algebraic geometry as a foundational tool in next-generation cryptographic protocol design. Keywords: algebraic geometry, cryptographic protocols, elliptic curves, public key cryptography, post-quantum cryptography, projective varieties, zero-knowledge proofs, secure communication, mathematical cryptography, abelian varieties
TetraUnified v2.0 presents a fully revised, academically aligned research framework integrating three experimental components: Tetrahedral Key Exchange (TKE):Exploratory key exchange mechanism based on recursive geometric projections. Recursive Tesseract Hashing (RTH):Hyperdimensional hashing model using 16-axis Clifford projections and recursive entropy mixing. Quantum Isoca-Dodecahedral Lattice Encryption (QIDL):Conceptual encoding model for representing plaintext within dynamic polyhedral phase lattices. This version restructures the system into a coherent research-grade framework, emphasizing mathematical clarity, reproducibility, consistent notation, and proper cryptographic disclaimers.No security guarantees are claimed and no component should be used in production systems.All structures are intended strictly for experimental simulation, prototyping, and conceptual evaluation. Purpose of This Release Version 2.0 was developed to achieve three objectives: Remove speculative, metaphorical, or narrative content from earlier drafts and establish a formal academic tone. Strengthen mathematical structure and notation, including explicit operator definitions and theoremâproof formulations. Position the system as a technical R&D testbed, rather than a security product or operational cryptographic protocol. This release supersedes all previous versions.Earlier manuscripts are preserved only as historical development notes. Key Improvements in v2.0 1. Formal Mathematical Structures Includes new theoremâproof style sections addressing: TKE reconstruction consistency RTH entropy evolution under recursion QIDL transformation intractability (as a conceptual model) Defined core operators: Projection (đŻ) Modulation (f) Reconstruction (đ) Polyhedral rotation (đ_{I,D}) Sealing (đź) Geometric embeddings now use clearly stated synthetic Clifford bases. 2. Cryptographic Positioning TKE, RTH, and QIDL are explicitly described as experimental, unverified, not secure, and not production-ready. No hardness assumptions are claimed. All constructs are positioned as alternative simulation models inspired by geometric/topological methods. 3. Distributed Systems & Navigation Concepts Introduces a conceptual framework for: phase-based synchronization inertial alignment without external timing sources distributed state coordination under high latency resilience to environmental drift or partial network partitions 4. Comparison with Existing Quantum Programming Includes a revised comparison table contrasting: NISQ-era quantum programming TetraUnifiedâs hyperdimensional simulation models Highlights key architectural differences without implying superiority. 5. Expanded Application Sections Updated application discussions for TKE, RTH, and QIDL covering: distributed identity experiments mesh communication models ledger integrity prototyping inertial navigation research off-world / high-latency environments multi-agent swarm coordination recursive lineage tracking for AI pods All applications are strictly conceptual research pathways, not operational deployments. Version Philosophy TetraUnified v2.0 establishes the framework as: an academic-style experimental cryptography model a research environment for hyperdimensional and geometric transformations an R&D prototype for studying non-linear distributed coordination a computational sandbox for exploring alternative post-quantum architectures No practical security, correctness, or adversarial resistance should be inferred.Formal verification and cryptanalysis remain open areas for future work. Included Artifacts This release includes: the revised LaTeX manuscript (PDF) updated mathematical definitions for TKE, RTH, QIDL reference diagrams and basis definitions example code structures (if present in repository) reproducibility metadata and version history Notes on Previous Versions Earlier versions contained exploratory and speculative material.Version 2.0 replaces these with a rigorous mathematical and systems-engineering structure. Per Zenodo policies, earlier versions remain visible but represent developmental prototypes only.The DOI series now resolves to v2.0 as the authoritative technical edition. Intended Use TetraUnified v2.0 is intended for: researchers exploring geometric or topological cryptography models distributed systems experimentation verifiable computation and XR/digital-twin state modeling conceptual post-quantum architecture studies academic and peer review simulation, prototyping, and reproducibility analysis This work is not intended for operational cryptography, production deployment, or security-critical environments. Citation MacDonald, M. (2025).TetraUnified v2.0 â Experimental Framework for Hyperdimensional Cryptography, Recursive Hashing, and Distributed State Models.Zenodo. https://doi.org/10.5281/zenodo.17759222
To provide the encrypted data with public tamperproof and traceability, in this paper, we first explore and discuss that the alone signature attached to the encrypted data is in a low coupling state with the ciphertext which gives rise to signature substitution attack destructing assurance of the encrypted data. Then we propose a new cryptographic primitive called Secret-Embedded Ciphertext Signature of Knowledge (SECTSoK). And then give the general construction of SE-CTSoK in Schnorr identification scheme form over groups. The proposed SE-CTSoK is not only a signature for the ciphertext to make the ciphertext tamper-proof, but also a zero-knowledge argument of the ciphertext random secret to give the proof that the ciphertext secret is embedded in SE-CTSoK for sure without revealing it. Furthermore, we introduce the standardized definition of the Irreconfigurability model for the ciphertext signature to cover any type of the signature substitution attack, and then we give the formalized proof to our proposed SE-CTSoK in Irreconfigurability model which demonstrates that the ciphertext with the corresponding SE-CTSoK can only be correctly traced and confirmed to the ciphertext generator.
The rapid advancement of quantum computing presents a fundamental challenge to modern cryptographic security, particularly in the domain of hash functions that ensure data integrity, authentication, and blockchain security. Traditional crypto graphic hash functions such as SHA-256, SHA-3, and BLAKE2 rely on computational hardness assumptions that become obsolete in the presence of large-scale quantum computers. Shorâs algorithm can efficiently break RSA and ECC-based cryptosys tems, while Groverâs algorithm reduces the security of traditional hash functions by square root complexity, significantly weakening their preimage and collision resistance. This quantum threat necessitates the development of post-quantum secure hashing techniques that remain resilient against both classical and quantum adversaries. This paper proposes Quantum Hashing, a novel cryptographic framework that integrates quantum entanglement, lattice-based cryptography, and hybrid quantum classical hashing to construct post-quantum secure hash functions. We introduce a formal model for Quantum Collision Resistance (QCR) and provide entropy-based ran domness enhancement to ensure unpredictable hash outputs. Unlike classical hashing approaches, our framework leverages the hardness of lattice problems (e.g., Shortest Vector Problem, Learning with Errors) to withstand quantum attacks while incorpo rating Quantum Key Distribution (QKD) mechanisms to enhance entropy and key management. Furthermore, we evaluate the security of Quantum Hashing under various attack models, comparing its resistance against Groverâs search and collision attacks. We benchmark its performance against NIST Post-Quantum Cryptography (PQC) final ists, including CRYSTALS-DILITHIUM, SPHINCS+, and Falcon, demonstrating that our approach offers superior resilience while maintaining computational feasibility. Additionally, we present an implementation of Quantum Hashing using Qiskit, show casing its practical applicability in quantum circuits and quantum-secure blockchain architectures. Our findings highlight that Quantum Hashing provides a scalable, entropy-efficient, and post-quantum resilient cryptographic primitive suitable for next-generation cryptographic applications. This work paves the way for secure post-quantum digital signatures, blockchain consensus mechanisms, and zero-knowledge proof systems that require tamper-resistant hashing in a quantum computing era.
Justin A. Drake, Dmitry Khovratovich, Mikhail Kudinov, Benedikt Wagner
With the threat posed by quantum computers on the horizon, systems like Ethereum must transition to cryptographic primitives resistant to quantum attacks. One of the most critical of these primitives is the non-interactive multi-signature scheme used in Ethereum's proof-of-stake consensus, currently implemented with BLS signatures. This primitive enables validators to independently sign blocks, with their signatures then publicly aggregated into a compact aggregate signature. In this work, we introduce a family of hash-based signature schemes as post-quantum alternatives to BLS. We consider the folklore method of aggregating signatures via (hash-based) succinct arguments, and our work is focused on instantiating the underlying signature scheme. The proposed schemes are variants of the XMSS signature scheme, analyzed within a novel and unified framework. While being generic, this framework is designed to minimize security loss, facilitating efficient parameter selection. A key feature of our work is the avoidance of random oracles in the security proof. Instead, we define explicit standard model requirements for the underlying hash functions. This eliminates the paradox of simultaneously treating hash functions as random oracles and as explicit circuits for aggregation. Furthermore, this provides cryptanalysts with clearly defined targets for evaluating the security of hash functions. Finally, we provide recommendations for practical instantiations of hash functions and concrete parameter settings, supported by known and novel heuristic bounds on the standard model properties.
Muhammad Jawad, âȘMahmood A. Al-ShareedaâŹâ, Omar Yawez Mustafa Mustafa, Mohammed Amin Almaiah · 5 authors
Analysis of repeated attack signatures is important because of the rapid evolution of the Social Internet of Vehicles (SIoV). However, threats such as replay attacks, session hijacking, and key reuse make secure communication between vehicles, roadside units (RSUs), and the fog node difficult. Traditional models for authentication are limited by computational overhead and lack quick key revocation. In response to these challenges, we propose a hybrid cryptographic authentication scheme that combines a Zero-Knowledge Proof (ZKP) with AES-GCM encryption. Our protocol implements a dynamic key revocation mechanism to avoid rogue and session key migration, minimizing re-authentication delay. Security analysis in the Real-Oracle Random (ROR) model shows that it is not vulnerable to impersonation or replay attacks. Evaluations demonstrate decreases of 58% in authentication latency while achieving 45% and 72% improvements in communication and computation efficiency, respectively. Our approach is also scalable and secure, providing SIoV with higher reliability for automotive applications in the vehicular networks of the future.