Skip Content
You are currently on the new version of our website. Access the old version .

Cryptography, Volume 9, Issue 1

2025 March - 20 articles

Cover Story: Fully Homomorphic Encryption (FHE) represents a revolutionary advancement in cryptography, enabling computations on encrypted data without prior decryption. This paper examines the Gentry–Sahai–Waters (GSW) FHE scheme, addressing two critical limitations: restricted message data ranges and excessive ciphertext size. We propose significant improvements through Chinese Remainder Theorem-based message decomposition, expanding input ranges to the entire plaintext space. Additionally, we implement an intuitive approximation method for decryption and adapt PVW-like compression techniques to reduce memory overhead. These enhancements make the GSW scheme more practical and efficient for real-world secure computation applications, overcoming key barriers to widespread FHE adoption in privacy-preserving data processing environments. View this paper
  • Issues are regarded as officially published after their release is announced to the table of contents alert mailing list .
  • You may sign up for email alerts to receive table of contents of newly released issues.
  • PDF is the official format for papers published in both, html and pdf forms. To view the papers in pdf format, click on the "PDF Full-text" link, and use the free Adobe Reader to open them.

Articles (20)

  • Article
  • Open Access
1 Citations
1,823 Views
27 Pages

Popular technologies such as blockchain and zero-knowledge proof, which have already entered the enterprise space, heavily use cryptography as the core of their protocol stack. One of the most used systems in this regard is Elliptic Curve Cryptograph...

  • Article
  • Open Access
1 Citations
3,777 Views
18 Pages

CRYSTALS-Kyber has been standardized as a general public-key post-quantum algorithm under the name of ML-KEM after NIST released its first three final post-quantum standards in August 2024. The resilience of post-quantum cryptography to side-channel...

  • Article
  • Open Access
1 Citations
1,241 Views
22 Pages

Authenticated encryption with associated data (AEAD) schemes based on stream ciphers, such as ASCON and MORUS, typically use nonlinear feedback shift registers (NFSRs) and linear feedback shift registers (LFSRs) to generate variable-length key stream...

  • Review
  • Open Access
9 Citations
7,983 Views
16 Pages

With the rise in applications of artificial intelligence (AI) across various sectors, security concerns have become paramount. Traditional AI systems often lack robust security measures, making them vulnerable to adversarial attacks, data breaches, a...

  • Feature Paper
  • Article
  • Open Access
1,848 Views
26 Pages

The formal study of computer malware was initiated in the seminal work of Fred Cohen in the mid-80s, who applied elements of Computation Theory in the investigation of the theoretical limits of using the Turing Machine formal model of computation in...

  • Article
  • Open Access
1 Citations
1,806 Views
18 Pages

Field-programmable gate arrays (FPGAs) are widely used in cloud servers as an acceleration solution for compute-intensive tasks. Cloud FPGAs are typically multi-tenant, enabling resource sharing among multiple users but are vulnerable to power side-c...

  • Article
  • Open Access
2 Citations
1,613 Views
28 Pages

This paper explores advancements in the Gentry-Sahai-Waters (GSW) fully homomorphic encryption scheme (FHE), addressing challenges related to message data range limitations and ciphertext size constraints. We leverage the well-known parallelizing tec...

  • Article
  • Open Access
1 Citations
2,412 Views
20 Pages

Private information retrieval (PIR) enables a client to retrieve a specific element from a server’s database without disclosing the index that was queried. This work introduces three improvements to the efficient single-server PIR protocol Spir...

  • Article
  • Open Access
1,958 Views
42 Pages

DGMT: A Fully Dynamic Group Signature from Symmetric-Key Primitives

  • Mojtaba Fadavi,
  • Sabyasachi Karati,
  • Aylar Erfanian and
  • Reihaneh Safavi-Naini

A group signature scheme allows a user to sign a message anonymously on behalf of a group and provides accountability by using an opening authority who can “open” a signature and reveal the signer’s identity. Group signature schemes...

  • Article
  • Open Access
3 Citations
2,661 Views
14 Pages

Design and Implementation of a Quantum-Assisted Digital Signature

  • Marta Irene García-Cid,
  • Rodrigo Martín,
  • David Domingo,
  • Vicente Martín and
  • Laura Ortiz

We propose a new quantum-assisted digital signature (Q-DS) protocol based on the composite of truly random symmetric keys generated by quantum key distribution with secure standardized hash functions, which allows for high parameterization to provide...

  • Article
  • Open Access
1,434 Views
17 Pages

Chebyshev polynomials define a rather canonical chaotic cryptosystem and some strong attacks have been designed to that cryptosystem. We report the numerical experiments performed with multiple precision arithmetic using conventional software as gmp...

  • Article
  • Open Access
3 Citations
5,475 Views
24 Pages

In recent years, with the development of blockchain technology and increased awareness of personal privacy, Self-Sovereign Identity (SSI) has become a hot topic. SSI gives customers more autonomy over their personal information, allowing them to cont...

  • Feature Paper
  • Review
  • Open Access
3 Citations
4,148 Views
26 Pages

Anonymous credential (AC) systems are privacy-preserving authentication mech-anisms that allow users to prove that they have valid credentials anonymously. These systems provide a powerful tool for several practical applications, such as anonymous pa...

  • Article
  • Open Access
1,980 Views
23 Pages

Lightweight Scheme for Secure Signaling and Data Exchanges in Intelligent Precision Agriculture

  • Thekaa Ali Kadhim,
  • Zaid Ameen Abduljabbar,
  • Hamid Ali Abed AL-Asadi,
  • Vincent Omollo Nyangaresi,
  • Zahraa Abdullah Ali and
  • Iman Qays Abduljaleel

Intelligent precision agriculture incorporates a number of Internet of Things (IoT) devices and drones to supervise agricultural activities and surroundings. The collected data are then forwarded to processing centers to facilitate crucial decisions....

  • Article
  • Open Access
2 Citations
2,013 Views
23 Pages

Protecting Dynamically Obfuscated Scan Chain Architecture from DOSCrack with Trivium Pseudo-Random Number Generation

  • Jiaming Wu,
  • Olivia Dizon-Paradis,
  • Sazadur Rahman,
  • Damon L. Woodard and
  • Domenic Forte

Design-for-test/debug (DfT/D) introduces scan chain testing to increase testability and fault coverage by inserting scan flip-flops. However, these scan chains are also known to be a liability for security primitives. In previous research, the dynami...

  • Article
  • Open Access
1 Citations
1,945 Views
26 Pages

Leveraging Neural Trojan Side-Channels for Output Exfiltration

  • Vincent Meyers,
  • Michael Hefenbrock,
  • Dennis Gnad and
  • Mehdi Tahoori

Neural networks have become pivotal in advancing applications across various domains, including healthcare, finance, surveillance, and autonomous systems. To achieve low latency and high efficiency, field-programmable gate arrays (FPGAs) are increasi...

  • Article
  • Open Access
1,278 Views
22 Pages

To reduce bandwidth usage in communications, absolute moment block truncation coding is employed to compress cover images. Confidential data are embedded into compressed images using reversible data-hiding technology for purposes such as image manage...

  • Review
  • Open Access
2 Citations
6,887 Views
21 Pages

Elliptic Curve Cryptography with Machine Learning

  • Jihane Jebrane,
  • Akram Chhaybi,
  • Saiida Lazaar and
  • Abderrahmane Nitaj

Elliptic Curve Cryptography (ECC) is a technology based on the arithmetic of elliptic curves used to build strong and efficient cryptosystems and infrastructures. Several ECC systems, such as the Diffie–Hellman key exchange and the Elliptic Cur...

  • Article
  • Open Access
2 Citations
1,741 Views
18 Pages

An RSA generalization using complex integers was introduced by Elkamchouchi, Elshenawy and Shaban in 2002. This scheme was further extended by Cotan and Teșeleanu to Galois fields of order n1. In this generalized framework, the key equation...

  • Article
  • Open Access
1 Citations
1,691 Views
18 Pages

Secure secret-sharing Single-Source Shortest Distance (SSSD) protocols, based on secure multiparty computation (SMC), offer a promising solution for securely distributing and managing sensitive information among multiple parties. However, formal secu...

Get Alerted

Add your email address to receive forthcoming issues of this journal.

XFacebookLinkedIn
Cryptography - ISSN 2410-387X