International Journal of Information and Computer Security (4 papers in press)

Regular Issues

• MIMO-cooperative-spectrum sensing with trust and reputation method in CRN on blockchain using Adam-gradient descent Archimedes algorithm  
  by Sandip Babanrao Shrote, Sadhana D. Poshattiwar 
  Abstract: Cognitive radio networks (CRNs) have emerged as a promising solution to address spectrum scarcity. A fundamental component of CRNs is spectrum sensing (SS), as it identifies spectrum holes accurately and reliably. However, efficient and accurate SS remains a major challenge. Here, Adam-gradient descent Archimedes algorithm (Adam-GDAA) is designed for multiple-input multiple-output (MIMO)-CSS in CRN. Firstly, the MIMO-CSS system model is simulated. Thereafter, SS is conducted based upon the Renyi-entropy weighted Adam-GD algorithm. However, weight determination is done by employing the Adam-GD algorithm. Thereafter, output 1 is obtained, and then, the data is recorded in BC. After that, trust and reputation-based SS is accomplished, and therefore, output-2 is obtained. Lastly, both outputs are merged, and weights are generated utilising Adam-GDAA. The Adam-GDAA obtained a computation time of 0.829 sec, sensing time of 222.110 sec, and probability of false alarm of 0.330, and probability of detection of 0.913.
  Keywords: cognitive radio network; CRN; spectrum sensing; SS; multiple-input and multiple-output; MIMO; blockchain; BC; trust and reputation.
  DOI: 10.1504/IJICS.2025.10074618
   
  
• IP obfuscation: a survey of methods and the introduction of transient key logic locking  
  by Arsalan Ali Malik, Neelam Nasir, Naveed Riaz, Naveed Ahmed, Mureed Hussain, Sajid Ali Khan, Ammar Masood 
  Abstract: Logic locking is a widely adopted hardware obfuscation technique which can be further sub-categorised into static and dynamic approaches based on the nature of the employed key. Besides being susceptible to SAT and fault injection attacks, static logic locking is vulnerable to widespread compromise from a single key exposure or device breach. On the other hand, dynamic logic locking introduces complexities in resource utilisation, key management, design, and adaptability. In this work, we provide a comprehensive and up-to-date overview of existing IP Obfuscation techniques, highlighting their strengths, and potential vulnerabilities. We also propose, a hybrid logic locking technique that capitalises on the positive attributes of both static and dynamic logic locking methodologies while minimising their inherent limitations. An initial proof-of-concept implementation/simulation has been performed on the Xilinx SP605 FPGA development board. The suggested transient key logic locking scheme is applicable to all type of IPs.
  Keywords: system-on-chip; SoC; field-programmable gate arrays; FPGAs; hardware security; IP protection; IP theft; obfuscation.
  DOI: 10.1504/IJICS.2025.10074686
   
  
• Preventing playback attacks in fingerprint biometrics through four-level hashing  
  by H. Mohamed Khan 
  Abstract: Replay (playback) attacks threaten fingerprint biometric systems by re-using previously captured data to gain unauthorized access. This paper proposes fingerprint matching using four-level hashing method (FMFLHM) a layered approach combining timestamp transformation, fingerprint trait modification, XOR mixing, triangular hashing (three iterative hashes), and AES encryption. FMFLHM fuses ridge orientation and Gabor-HOG descriptors, binds them to time and a server nonce, and transmits an AES-encrypted triangular hash for server verification. Experiments on NIST-302 and MOLFDB datasets show FMFLHM reduces false acceptance and rejection rates and gives higher authentication accuracy (98.09% on NIST-302). We discuss key-management, scalability for resource-constrained devices, and limitations versus advanced spoofing techniques. FMFLHM strengthens resistance to replay attacks and offers a practical route to more robust fingerprint authentication.
  Keywords: NIST; playback attack; hashing; cybersecurity; ridge orientation; histogram of gradients.
  DOI: 10.1504/IJICS.2025.10074825
   
  
• Generalised multi-secret sharing scheme for non-monotone access structures  
  by Shiva Krishna Nallabothu, N. Rukma Rekha, Y.V. Subba Rao 
  Abstract: Generalised secret sharing (GSS) schemes for monotone access structures, which always grant access to larger sets, offer flexibility beyond threshold schemes. But often these schemes struggle with practical limitations and an inability to model complex real-world policies involving specific exclusions or conditional access based on the absence of certain participants. We propose a novel GSS scheme specifically designed for non-monotone access structures, enabling true fine-grained control for scenarios where exceptions or negative constraints are paramount. The proposed GSS scheme is then extended to a generalised multi-secret sharing (GMS) scheme, facilitating the secure and controlled distribution of multiple secrets under the non-monotone access structure. GSS and GMS schemes are constructed using maximum distance separable (MDS) codes and require one-way functions. The proposed schemes are ideal and computationally perfect. The correctness, complexity, and security analysis are also given.
  Keywords: generalised secret sharing; non-monotone access structure; MDS codes.
  DOI: 10.1504/IJICS.2025.10075007