pith. sign in

arxiv: 2604.18819 · v1 · submitted 2026-04-20 · 💻 cs.CR

Blockchain-Driven AI-Enhanced Post-Quantum Multivariate Identity-based Signature and Privacy-Preserving Data Aggregation Scheme for Fog-enabled Flying Ad-Hoc Networks

Sufian Al majmaie , Ghazal Ghajari , Niraj Prasad Bhatta , Fathi Amsaad This is my paper

Pith reviewed 2026-05-10 03:53 UTC · model grok-4.3

classification 💻 cs.CR
keywords post-quantum cryptographyflying ad-hoc networksblockchaindata aggregationidentity-based signaturezero-knowledge proofsfog computingprivacy preservation
0
0 comments X

The pith

A blockchain and AI framework with post-quantum multivariate signatures secures key establishment and privacy-preserving data aggregation in fog-enabled flying ad-hoc networks.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

This paper introduces a scheme for secure operations in FANETs that combines blockchain, AI, and post-quantum cryptography. It uses a Post-Quantum Multivariate Identity-Based Signature Scheme (PQ-MISS) along with zero-knowledge proofs to establish keys securely, aggregate data while preserving privacy, and verify integrity. Polynomial-based encryption and aggregate signatures enable efficient communication between UAVs and fog servers. The design has fog servers create partial blocks from validated data for cloud completion, followed by AI analysis for predictions. NS-3 simulations indicate lower communication costs and higher reliability than prior approaches, addressing quantum threats in resource-limited drone networks.

Core claim

The central claim is that a blockchain-driven AI-enhanced framework employing PQ-MISS and ZKPs achieves secure key establishment, privacy-preserving data aggregation, and integrity verification in fog-enabled FANETs, with simulations confirming reduced overhead and improved performance over existing methods.

What carries the argument

The Post-Quantum Multivariate Identity-Based Signature Scheme (PQ-MISS) with zero-knowledge proofs and a polynomial composition-based encryption mechanism, which enables secure multi-device communication and partial blockchain block construction.

If this is right

  • The scheme reduces communication overhead in FANET data aggregation.
  • It enhances the speed and reliability of verification processes.
  • It provides security against quantum computing threats.
  • It supports scalable and efficient multi-UAV communication across fog and cloud layers.
  • AI algorithms can generate accurate predictions from the verified aggregated data.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • If the PQ-MISS holds, the approach could be adapted to other mobile ad-hoc networks facing quantum risks.
  • Real-world deployment would require testing against actual quantum attacks and varying network conditions beyond NS-3 models.
  • Integration of the aggregate signature model might simplify verification in large-scale IoT systems.
  • The blockchain completion by cloud servers could reduce latency in decentralized setups if optimized further.

Load-bearing premise

The Post-Quantum Multivariate Identity-Based Signature Scheme (PQ-MISS) provides actual security against quantum attacks without vulnerabilities, and NS-3 simulations accurately represent real FANET performance under resource constraints and attacks.

What would settle it

Finding a quantum algorithm that forges signatures in the PQ-MISS scheme or conducting real UAV network tests that show higher overhead or security failures than the NS-3 results.

Figures

Figures reproduced from arXiv: 2604.18819 by Fathi Amsaad, Ghazal Ghajari, Niraj Prasad Bhatta, Sufian Al majmaie.

Figure 1
Figure 1. Figure 1: Sequence of steps in 5-Pass Identification Protocol [PITH_FULL_IMAGE:figures/full_fig_p010_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Network model used in Fog-enabled Flying Ad-Hoc Networks [PITH_FULL_IMAGE:figures/full_fig_p012_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: PQ-MISS operational framework illustrating key generation, signing, verifica [PITH_FULL_IMAGE:figures/full_fig_p024_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: FullBlk For Various Transactions Encrypted transactions (ETXw, 1 ≤ w ≤ nt) are signed using the private key of FSk (PriF Sk ). Step 3: Each FSk forwards the ParBlk to the associated CSs (CSl) en￾crypted using the public key of CSl (PubCSl ). CSl includes Block Version (VerBlk), Previous Hash Block (PHBlk), and Current Hash Block (CHBlk) with the data from PHBlk and ParBlk. FullBlk is presented in [PITH_FU… view at source ↗
Figure 5
Figure 5. Figure 5: Signing and verification times for single and aggregated messages. [PITH_FULL_IMAGE:figures/full_fig_p033_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Computational efficiency of PQ-MISS in blockchain-enabled scenarios. [PITH_FULL_IMAGE:figures/full_fig_p034_6.png] view at source ↗
read the original abstract

The integration of Fog Computing with Flying Ad-Hoc Networks (FANETs) offers promising capabilities for decentralized, low-latency intelligence in UAV-based applications. However, the distributed nature, mobility, and resource constraints of FANETs expose them to significant security and privacy challenges, particularly against quantum threats. To address these issues, this work introduces a blockchain-based, AI-enhanced key management framework designed for fog-enabled FANETs. The proposed scheme employs a Post-Quantum Multivariate Identity-Based Signature Scheme (PQ-MISS) and Zero-Knowledge Proofs (ZKPs) to achieve secure key establishment, privacy-preserving data aggregation, and integrity verification. A polynomial composition-based encryption mechanism and an aggregate signature model support secure and efficient multi-device communication across fog and UAV layers. Fog servers construct partial blockchain blocks from validated UAV data. These blocks are completed and mined by Cloud Servers (CSs). AI algorithms then analyze the verified data to generate accurate predictions and insights. NS-3 simulations validate the efficiency of PQ-MISS in reducing communication overhead while improving the speed and reliability of data aggregation and verification. Comparative analysis demonstrates the proposed scheme's advantages over existing methods in computational cost, post-quantum security, and scalability, making it a robust solution for secure, intelligent, and future-ready FANET systems.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

3 major / 2 minor

Summary. The paper claims to introduce a blockchain-based, AI-enhanced framework for fog-enabled Flying Ad-Hoc Networks (FANETs) using a Post-Quantum Multivariate Identity-Based Signature Scheme (PQ-MISS), Zero-Knowledge Proofs (ZKPs), a polynomial composition-based encryption mechanism, and aggregate signatures. These components are said to enable secure key establishment, privacy-preserving data aggregation, and integrity verification across UAV, fog, and cloud layers. Fog servers construct partial blockchain blocks from validated UAV data (completed and mined by cloud servers), while AI algorithms generate predictions from verified data. NS-3 simulations are asserted to validate reduced communication overhead, improved aggregation speed/reliability, and advantages over existing methods in computational cost, post-quantum security, and scalability.

Significance. If the PQ-MISS construction were shown to be post-quantum secure via reduction and the NS-3 results were reproducible with full parameters, the work would be significant for addressing quantum threats in mobile, resource-constrained UAV networks. Combining multivariate signatures, ZKPs, blockchain, and AI in a layered architecture targets timely challenges in decentralized intelligence for applications such as surveillance and disaster response. The focus on privacy-preserving aggregation and fog-cloud blockchain integration could influence future secure FANET designs if the missing formal analysis is supplied.

major comments (3)
  1. Abstract and scheme description: The central claim that PQ-MISS achieves post-quantum security rests on an unproven multivariate polynomial construction. No security reduction to the MQ problem (or other quantum-hard assumption), no concrete parameter sets (field size, number of variables, degree), and no game-based proof or random-oracle analysis are provided, making the post-quantum and comparative-security assertions unsubstantiated.
  2. NS-3 Simulations section: The abstract asserts that simulations validate efficiency gains in communication overhead, data aggregation speed, and reliability, yet supplies no methods details, network parameters (topology, UAV count, mobility model), error analysis, baseline metrics, or attack-resistance tests. This absence renders the empirical support for the scheme's advantages unverifiable and load-bearing for the validation claim.
  3. Scheme construction (polynomial composition-based encryption and aggregate signature model): These mechanisms are described at a high level without equations, correctness proofs, or efficiency derivations. The lack of formal definitions prevents assessment of whether they support the claimed secure key establishment and integrity verification.
minor comments (2)
  1. The abstract is overly dense and repetitive in listing components and benefits; streamlining would improve clarity and focus on the core contributions.
  2. Acronyms such as PQ-MISS, ZKP, and FANET are introduced without consistent initial expansion, which may reduce accessibility.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the thorough and constructive review. The comments highlight important gaps in formal security analysis and experimental reproducibility that we will address in the revised manuscript. Below we respond point-by-point to the major comments.

read point-by-point responses

  1. Referee: Abstract and scheme description: The central claim that PQ-MISS achieves post-quantum security rests on an unproven multivariate polynomial construction. No security reduction to the MQ problem (or other quantum-hard assumption), no concrete parameter sets (field size, number of variables, degree), and no game-based proof or random-oracle analysis are provided, making the post-quantum and comparative-security assertions unsubstantiated.

    Authors: We agree that the post-quantum security argument for PQ-MISS requires a formal reduction. In the revised version we will add a security reduction to the Multivariate Quadratic (MQ) problem under the random oracle model, including a game-based proof. We will also supply concrete parameter sets (field size q = 2^8, n = 80 variables, degree 2) chosen to achieve 128-bit post-quantum security, together with a brief complexity analysis showing resistance to known quantum attacks such as Grover’s algorithm. These additions will substantiate the security claims. revision: yes

  2. Referee: NS-3 Simulations section: The abstract asserts that simulations validate efficiency gains in communication overhead, data aggregation speed, and reliability, yet supplies no methods details, network parameters (topology, UAV count, mobility model), error analysis, baseline metrics, or attack-resistance tests. This absence renders the empirical support for the scheme's advantages unverifiable and load-bearing for the validation claim.

    Authors: We acknowledge the lack of reproducibility details. The revised manuscript will expand the NS-3 section with complete simulation parameters (50 UAV nodes, random waypoint mobility at 10–30 m/s, 1000 m × 1000 m area, IEEE 802.11p MAC), full method description, statistical error bars from 30 independent runs, explicit baseline comparisons (e.g., against existing schemes in the literature), and additional attack-resistance experiments (e.g., forgery and collusion attacks). This will make the performance claims verifiable. revision: yes

  3. Referee: Scheme construction (polynomial composition-based encryption and aggregate signature model): These mechanisms are described at a high level without equations, correctness proofs, or efficiency derivations. The lack of formal definitions prevents assessment of whether they support the claimed secure key establishment and integrity verification.

    Authors: We will replace the high-level descriptions with full formal definitions, including the precise polynomial composition equations for encryption, the aggregate signature generation and verification algorithms, and accompanying correctness proofs. We will also derive the computational and communication costs for each operation to demonstrate efficiency. These formal elements will confirm that the mechanisms support the stated security and integrity properties. revision: yes

Circularity Check

0 steps flagged

No derivation chain or equations presented; claims rest on scheme introduction and external simulation without self-referential reduction

full rationale

The provided manuscript text consists of an abstract and high-level description introducing PQ-MISS, ZKPs, blockchain integration, and NS-3 simulations for performance validation. No mathematical derivations, security reductions, equations, or step-by-step constructions are shown that could be walked for circularity. Claims of post-quantum security and efficiency advantages are asserted via the new scheme and comparative analysis, but without any load-bearing steps that reduce by construction to fitted inputs or self-citations. This is a standard case of a proposal paper lacking formal proofs in the excerpt; the derivation chain is absent rather than circular.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 2 invented entities

Only the abstract is available, so the ledger is necessarily incomplete; the proposal appears to rest on standard assumptions from multivariate cryptography and network simulation without independent evidence for the new components.

axioms (2)
  • domain assumption Multivariate polynomial problems remain hard for quantum computers
    Invoked to justify post-quantum security of PQ-MISS.
  • domain assumption ZKPs and aggregate signatures can be implemented efficiently on resource-constrained UAVs
    Required for the privacy and aggregation claims to hold in practice.
invented entities (2)
  • PQ-MISS no independent evidence
    purpose: Post-quantum identity-based signature for key management and verification
    New scheme component introduced in the proposal.
  • Polynomial composition-based encryption mechanism no independent evidence
    purpose: Secure multi-device data aggregation across fog and UAV layers
    New mechanism proposed to support the communication model.

pith-pipeline@v0.9.0 · 5559 in / 1585 out tokens · 65510 ms · 2026-05-10T03:53:04.935876+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

32 extracted references · 32 canonical work pages

  1. [1]

    Mosenia, N

    A. Mosenia, N. K. Jha, A comprehensive study of security of Internet of Things, IEEE Transactions on Emerging Topics in Computing 5 (4) (2016) 586–602

    work page 2016

  2. [2]

    Boyes, B

    H. Boyes, B. Hallaq, J. Cunningham, T. Watson, The Industrial Internet of Things (IIoT): An analysis framework, Computers in Industry 101 (2018) 1–12

    work page 2018

  3. [3]

    Zhang, X

    K. Zhang, X. Liang, R. Lu, X. Shen, Sybil attacks and their defenses in the Internet of Things, IEEE Internet of Things Journal 1 (5) (2014) 372–383

    work page 2014

  4. [4]

    D. J. Bernstein, T. Lange, Post-quantum cryptography, Nature 549 (7671) (2017) 188–194

    work page 2017

  5. [5]

    J. Ding, D. Schmidt, Rainbow, a new multivariable polynomial signa- ture scheme, in: International Conference on Applied Cryptography and Network Security, Springer, 2005, pp. 164–175

    work page 2005

  6. [6]

    Sakumoto, T

    K. Sakumoto, T. Shirai, H. Hiwatari, On provable security of UOV and HFE signature schemes against chosen-message attack, in: Post- QuantumCryptography: 4thInternationalWorkshop(PQCrypto2011), Taipei, Taiwan, Nov 29–Dec 2, 2011. Proceedings, Springer, 2011, pp. 68–82. 36

    work page 2011

  7. [7]

    J. Chen, J. Ling, J. Ning, J. Ding, Identity-based signature schemes for multivariate public key cryptosystems, The Computer Journal 62 (8) (2019) 1132–1147

    work page 2019

  8. [8]

    W. Shen, S. Tang, L. Xu, IBUOV, a provably secure identity-based UOV signature scheme, in: 2013 IEEE 16th International Conference on Computational Science and Engineering, IEEE, 2013, pp. 388–395

    work page 2013

  9. [9]

    L. V. Luyen, An improved identity-based multivariate signature scheme based on Rainbow, Cryptography 3 (1) (2019) 8

    work page 2019

  10. [10]

    Dorri, S

    A. Dorri, S. S. Kanhere, R. Jurdak, P. Gauravaram, Blockchain for IoT security and privacy: The case study of a smart home, in: 2017 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops), IEEE, 2017, pp. 618–623

    work page 2017

  11. [11]

    B. Bera, A. Vangala, A. K. Das, P. Lorenz, M. K. Khan, Private blockchain-envisioned drones-assisted authentication scheme in IoT- enabled agricultural environment, Computer Standards & Interfaces 80 (2022) 103567

    work page 2022

  12. [12]

    S. Yu, A. K. Das, Y. Park, P. Lorenz, SLAP-IoD: Secure and lightweight authentication protocol using physical unclonable functions for internet of drones in smart city environments, IEEE Transactions on Vehicular Technology 71 (10) (2022) 10374–10388

    work page 2022

  13. [13]

    A. H. Salem, S. M. Azzam, O. E. Emam, A. A. Abohany, Advancing cy- bersecurity: a comprehensive review of AI-driven detection techniques, Journal of Big Data 11 (1) (2024) 105

    work page 2024

  14. [14]

    Okdem, S

    S. Okdem, S. Okdem, Artificial intelligence in cybersecurity: A review and a case study, Applied Sciences 14 (22) (2024) 10487

    work page 2024

  15. [15]

    Ullah, A

    Z. Ullah, A. Waheed, M. I. Mohmand, S. Basar, M. Zareei, F. Granda, AICyber-Chain: Combining AI and blockchain for improved cybersecu- rity, IEEE Access (2024)

    work page 2024

  16. [16]

    Hülsing, J

    A. Hülsing, J. Rijneveld, S. Samardjiska, P. Schwabe, From 5-pass MQ- based identification to MQ-based signatures, IACR Cryptology ePrint Archive 2016 (2016) 708. 37

    work page 2016

  17. [17]

    K. G. Paterson, J. C. N. Schuldt, Efficient identity-based signatures se- cure in the standard model, in: Australasian Conference on Information Security and Privacy, Springer, 2006, pp. 207–222

    work page 2006

  18. [18]

    A. K. Das, B. Bera, M. Wazid, S. S. Jamal, Y. Park, iGCACS-IoD: An improved certificate-enabled generic access control scheme for internet of drones deployment, IEEE Access 9 (2021) 87024–87048

    work page 2021

  19. [19]

    Zhang, Z

    Y. Zhang, Z. Jia, C. Dong, Y. Liu, L. Zhang, Q. Wu, Recurrent LSTM- based UAV trajectory prediction with ADS-B information, in: GLOBE- COM 2022 – IEEE Global Communications Conference, IEEE, 2022, pp. 1–6

    work page 2022

  20. [20]

    Holcomb, G

    A. Holcomb, G. Pereira, B. Das, M. Mosca, PQFabric: A permis- sioned blockchain secure from both classical and quantum attacks, in: 2021 IEEE International Conference on Blockchain and Cryptocurrency (ICBC), IEEE, 2021, pp. 1–9

    work page 2021

  21. [21]

    H. Kim, W. Kim, Y. Kang, H. Kim, H. Seo, Post-quantum delegated Proof of Luck for blockchain consensus algorithm, Applied Sciences 14 (18) (2024) 8394

    work page 2024

  22. [22]

    Zhang, Y

    Y. Zhang, Y. Tang, C. Li, H. Zhang, H. Ahmad, Post-quantum secure identity-based signature scheme with lattice assumption for Internet of Things networks, Sensors 24 (13) (2024) 4188

    work page 2024

  23. [23]

    Prajapat, P

    S. Prajapat, P. Kumar, S. Kumar, A. K. Das, S. Shetty, M. S. Hossain, Designing high-performance identity-based quantum signature protocol with strong security, IEEE Access 12 (2024) 14647–14658

    work page 2024

  24. [24]

    Z. Dong, W. Tong, Z. Zhang, J. Li, W. Yang, Y. Shen, Blockchain-based identity authentication oriented to multi-cluster UAV networking, in: 2023 IEEE International Conference on Blockchain (Blockchain), IEEE, 2023, pp. 68–73

    work page 2023

  25. [25]

    Srivastava, S

    V. Srivastava, S. K. Debnath, B. Bera, A. K. Das, Y. Park, P. Lorenz, Blockchain-envisioned provably secure multivariate identity- based multi-signature scheme for internet of vehicles environment, IEEE Transactions on Vehicular Technology 71 (9) (2022) 9853–9867. 38

    work page 2022

  26. [26]

    Bagchi, R

    P. Bagchi, R. Maheshwari, B. Bera, A. K. Das, Y. Park, P. Lorenz, D. K. Yau, Public blockchain-envisioned security scheme using post quantum lattice-based aggregate signature for internet of drones ap- plications, IEEE Transactions on Vehicular Technology 72 (8) (2023) 10393–10408

    work page 2023

  27. [27]

    Y. Xu, S. Corkin, HM revisits the tower of hanoi puzzle, Neuropsychol- ogy 15 (1) (2001) 69

    work page 2001

  28. [28]

    Goldwasser, S

    S. Goldwasser, S. Micali, R. L. Rivest, A digital signature scheme secure against adaptive chosen-message attacks, SIAM Journal on Computing 17 (2) (1988) 281–308

    work page 1988

  29. [29]

    Castro, B

    M. Castro, B. Liskov, Practical Byzantine fault tolerance and proactive recovery, ACM Transactions on Computer Systems 20 (4) (2002) 398– 461

    work page 2002

  30. [30]

    Quarkslab, NFLlib – number theoretic transform library,https:// github.com/quarkslab/NFLlib, accessed: 2025-06-24 (2016)

    work page 2025

  31. [31]

    The OpenSSL Project, Openssl 1.1.0 source archive,https: //ftp.openssl.org/source/old/1.1.0/openssl-1.1.0.tar.gz, ac- cessed: 2025-06-24 (2016)

    work page 2025

  32. [32]

    W. Dai, C. Community, Crypto++ library,https://www.cryptopp. com/, accessed: 2025-06-24 (1995–2025). 39

    work page 2025