Forthcoming and Online First Articles

International Journal of Applied Cryptography

International Journal of Applied Cryptography (IJACT)

Forthcoming articles have been peer-reviewed and accepted for publication but are pending final changes, are not yet published and may not appear here in their final order of publication until they are assigned to issues. Therefore, the content conforms to our standards but the presentation (e.g. typesetting and proof-reading) is not necessarily up to the Inderscience standard. Additionally, titles, authors, abstracts and keywords may change before publication. Articles will not be published until the final proofs are validated by their authors.

Forthcoming articles must be purchased for the purposes of research, teaching and private study only. These articles can be cited using the expression "in press". For example: Smith, J. (in press). Article Title. Journal Title.

Articles marked with this shopping trolley icon are available for purchase - click on the icon to send an email request to purchase.

Online First articles are published online here, before they appear in a journal issue. Online First articles are fully citeable, complete with a DOI. They can be cited, read, and downloaded. Online First articles are published as Open Access (OA) articles to make the latest research available as early as possible.

Open AccessArticles marked with this Open Access icon are Online First articles. They are freely available and openly accessible to all without any restriction except the ones stated in their respective CC licenses.

Register for our alerting service, which notifies you by email when new issues are published online.

International Journal of Applied Cryptography (3 papers in press)

Regular Issues

  • Fortifying cloud-based healthcare: a link load balancer infused with NTRU, honey, and proxy algorithms for robust identity and access management   Order a copy of this article
    by Shrabani Sutradhar, Rajesh Bose, Sudipta Majumder, Haraprasad Mondal 
    Abstract: Cloud-based IoMT has transformed healthcare, improving patient care but also exposing new security vulnerabilities. Medical data's sensitivity and its critical role in healthcare make the sector a prime target for cyberattacks, with data breaches and ransomware incidents on the rise. The growing threat of quantum computing to current cryptographic methods further compounds the issue. Our study addresses these challenges by proposing a comprehensive security framework for healthcare systems. It introduces three key innovations: quantum resistant NTRU cryptography for long-term data protection, deceptive Honey algorithms for proactive threat monitoring, and robust proxy algorithms to prevent unauthorized access and data breaches. The framework also optimizes load balancing for better resource utilization and faster response times. This multi-dimensional approach tackles both current and future cyber threats, offering a scalable solution that ensures confidentiality, integrity, and availability of medical data. Its principles can also be applied to other critical infrastructure sectors facing similar cybersecurity challenges.
    Keywords: honey algorithm; hybrid cryptosystem; link load balancer; Nth degree truncated polynomial ring; NTRU; proxy algorithm.
    DOI: 10.1504/IJACT.2025.10069924
     
  • A pairing-free ID-based group key agreement protocol using elliptic curve cryptography for secure group communication   Order a copy of this article
    by Manmohan Pundir, Abhimanyu Kumar 
    Abstract: Group key agreement (GKA) is a critical component of secure communication in group-oriented scenarios, such as multi-party messaging, collaborative environments, etc. Elliptic curve cryptography (ECC) is a widely adopted cryptographic technique known for its efficiency and strong security guarantees. However, ECC-based GKA protocols often rely on expensive pairings, which can be computationally expensive and limit their practical deployment. This paper introduces a new approach for group key agreement using elliptic curve cryptography without involving pairing computations and addressing the scalability and efficiency challenges associated with pairing-based protocols. The proposed protocol employs scalar point multiplications over a prime field elliptic curve group, which enables secure and efficient GKA operations with less computational overheads. The proposed protocol achieves comparatively better performance over existing ECC-based GKA protocols, regarding computational efficiency, communication overhead, and security strength. The protocol is particularly suitable for resource-constrained environments, such as IoT and edge computing scenarios, where computational resources are limited, but secure group communication is crucial.
    Keywords: group key establishment; elliptic curve cryptography; ECC; pairing free cryptography.
    DOI: 10.1504/IJACT.2025.10071857
     
  • Necessity of large primes and delay commitment in efficient verifiable delay function   Order a copy of this article
    by Souvik Sur 
    Abstract: A verifiable delay function (VDF) is a function that takes a specified sequential time T to be evaluated, but can be verified in O(log T)-time. The efficient verifiable delay function (Wesolowski, EUROCRYPT 2019) is considered to be one of the finest constructions in this domain. For the security parameter , the verifier in Wesolowskis VDF challenges the prover with a prime sampled from the set of first 22 primes P2. The sequential complexity of the verifier could be halved without harming its soundness if the primes were sampled from P. We show that it is necessary to avoid the primes in P. Otherwise, we construct an efficient adversary that breaks the soundness of this VDF with probability > 1/2. We also show that it is necessary to commit the delay T before sampling the prime. Otherwise, we give another adversary to refute its soundness for the applications with flexible delay.
    Keywords: verifiable delay function; computational soundness; sequentiality; RSW assumption.
    DOI: 10.1504/IJACT.2025.10072110
     

 

Return to top