Skip to content

Verifiable dynamic quantum secure multi-party multiplication protocol based on homomorphic encryption

Sep 2026 · Quantum Information Processing · Vol 25 · 0 citations · 32 references
Computer Science

TL;DR

This paper proposes a dynamic quantum secure multi-party multiplication protocol with verifiable result integrity, based on homomorphic encryption, that can resist a series of typical external and internal attacks.

View source

Similar papers

Preprint Oct 2026

Collusion-Secure Semi-Quantum Secret Sharing Scheme using a Quantum Third Party

The security of a secret sharing protocol is compromised if one or more dishonest participants can reconstruct the secret by deviating from the prescribed protocol, particularly when such malicious behavior remains undetected. Semi-Quantum Secret Sharing (SQSS) is a variant of secret sharing in which the participants p...

Santanu Majhi, Nirupam Basak · 0 citations

Design and Analysis of Four-State Quantum Public-Key Encryption Scheme

This paper analyzes the four-state QPKE scheme of Liu et al. and shows that its ciphertext structure leaks information about computational-basis plaintexts, and proposes sQPKE, a simple quantum public-key encryption scheme that uses only elementary operations.

Rahul Kumar, Vikas Srivastava · 0 citations
Sep 2026

A quantum secure novel identity-based signcryption scheme based on group ring

This study proposes a novel signcryption scheme based on the algebraic structure of the group ring and proves its provable security, and shows that the security of the scheme relies on the intractability of two hard problems, i.e., bilinear Diffie–Hellman inversion in group ring and bilinear strong Diffie–Hellman assum...

Sunil Kumar, Gaurav Mittal, Arvind Yadav · 0 citations
Conference Open access Sep 2026

Quantum Cyber Guardian for Securing Personal Data and Digital Communication

Quantum computing poses a growing threat to conventional cryptographic schemes, particularly those based on Rivest-Shamir-Adleman (RSA) and Elliptic Curve Cryptography (ECC). These methods rely on computationally hard problems - such as integer factorization and discrete logarithm computation - that classical machines...

J. Visumathi, J. Sandhiya · 0 citations
Preprint Sep 2026

On The Simplest Quantum-Secure Block Cipher

Pseudorandom permutations are ubiquitous in theoretical and applied cryptography. PRPs that offer security even against adversaries making quantum queries are of increasing interest, and used in applications ranging from constructing pseudorandom unitaries to separating SZK from BQP. A successful framework for construc...

G. Alagic, Joseph Carolan, Christian Majenz et al. · 0 citations
Preprint Oct 2026

Composable Device-Independent Quantum Digital Signatures

Extending device-independent (DI) quantum cryptography to composably support all fundamental information security objectives is crucial for secure quantum networks. Achieving this goal requires composable quantum digital signatures (QDSs), which support integrity, authenticity, and nonrepudiation when integrated into q...

Jing Bian, Bing-Hong Li, Xu-Yang Lu et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.