A multi-valued quantum fully homomorphic encryption scheme

Zhang, Yuanjing; Shang, Tao; Liu, Jianwei

doi:10.1007/s11128-021-03051-x

Cited by 12 publications

(7 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…. , m t ) for any efficiently computable function f [43]- [45]. The main difference between HE and PKEET is that the proxy is not allowed to learn any information about the involved plaintexts in HE, while is able to learn the information that the encrypted plaintexts are equal or not in PKEET.…”

Section: A Related Workmentioning

confidence: 99%

Efficient All-or-Nothing Public Key Encryption With Authenticated Equality Test

Zhao

Zeng

2021

IEEE Access

View full text Add to dashboard Cite

Public key encryption with equality test (PKEET for short) is a new cryptographic primitive which allows a proxy to check whether two ciphertexts encrypted under different public keys are of the same plaintext. PKEET has become a prospective candidate for various application scenarios, such as data management on encrypted databases, personal health record systems, spam filtering in encrypted email systems. In this paper, we propose an efficient all-or-nothing public key encryption scheme with authenticated equality test (AoN-PKEAET for short). In comparison with the existing PKEET schemes, the proposed scheme provides a new feature of ciphertext authentication before the plaintext equality test. It ensures that no misjudgement occurs when testing the equality between ciphertexts. Specially, the Test algorithm in the proposed scheme first authenticates the compared ciphertexts and the equality test is fulfilled only if the ciphertexts are authenticated as valid. With this new feature, the Test algorithm cannot output 0 (which means that the encrypted messages are different) when the two input ciphertexts are of an identical message, or it cannot output 1 (which means that the encrypted messages are identical) when the two input ciphertexts are of different messages. Under a redefined security model for AoN-PKEAET, we give the detailed security proof of the proposed scheme.

show abstract

Section: A Related Workmentioning

confidence: 99%

Efficient All-or-Nothing Public Key Encryption With Authenticated Equality Test

Zhao

Zeng

2021

IEEE Access

View full text Add to dashboard Cite

show abstract

“…Considering that the existing d-dimensional QHE protocol [28] only involves singleparticle quantum gate operations and is not applicable to arbitrary quantum gates. It cannot satisfy the needs of the QNC protocol proposed in Sec.…”

Section: Quantum Network Coding Protocol Based On Quantum Full Homomo...mentioning

confidence: 99%

“…In this section, a QFHE protocol with d-dimensional universal quantum gates is constructed, which is a a four-tuple of quantum algorithms (key generation, encryption, evaluation, decryption) [28,29]. The client generates encryption keys and decryption keys using the key generation algorithm.…”

Section: Quantum Full Homomorphic Encryption Protocolmentioning

confidence: 99%

“…In this section, we first give the security definition that the fully mixed state guarantees the security of the QNC scheme [28,29]. Then, on that basis, the security of the proposed QNC protocol is proved.…”

Section: Securitymentioning

confidence: 99%

“…28) of the encryption algorithm is a fully mixed state, therefore the attacker can only intercept or detect the fully mixed quantum states. As a result, the attacker cannot obtain any valued information about {m 11 , m 12 , m 21 , m 22 } from the intercepted quantum states.…”

mentioning

confidence: 99%

See 2 more Smart Citations

School Mathematics Textbooks in China

Wang¹

2015

East China Normal University Scientific Reports

View full text Add to dashboard Cite

Let µ and ν be two probability measures on R d , where µ(dx) = e −V (x) dx R d e −V (x) dx for some V ∈ C 1 (R d ). Explicit sufficient conditions on V and ν are presented such that µ * ν satisfies the log-Sobolev, Poincaré and super Poincaré inequalities. In particular, if V (x) = λ|x| 2 for some λ > 0 and ν(e λθ|•| 2 ) < ∞ for some θ > 1, then µ * ν satisfies the log-Sobolev inequality. This improves and extends the recent results on the log-Sobolev inequality derived in [20] for convolutions of the Gaussian measure and compactly supported probability measures. On the other hand, it is well known that the log-Sobolev inequality for µ * ν implies ν(e ε|•| 2 ) < ∞ for some ε > 0. RésuméDes conditions explicites suffisantes sur V et ν sont présentées telles que µ * ν satisfait des inégalités de Sobolev logarithmique, de Poincaré et de super-Poincaré. En particulier, si V (x) = λ|x| 2 pour quelque λ > 0 et ν(e λθ|•| 2 ) < ∞ avec θ > 1, alors µ * ν satisfait l'inégalité de Sobolev logarithmique. Cela améliore et étend des résultats récents sur l'inégalité de Sobolev logarithmique obtenus dans [20] pour des convolutions de la mesure de Gauss et des mesures de probabilité à support compact. D'autre part, il est bien connu que l'inégalité de Sobolev logarithmique pour µ * ν implique ν(e ε|•| 2 ) < ∞ pour quelque ε > 0.

show abstract

Quantum Point Obfuscation

Shang

2024

Quantum Nonlinear Function Obfuscation Theory and Application

View full text Add to dashboard Cite

A multi-valued quantum fully homomorphic encryption scheme

Cited by 12 publications

References 18 publications

Efficient All-or-Nothing Public Key Encryption With Authenticated Equality Test

Efficient All-or-Nothing Public Key Encryption With Authenticated Equality Test

School Mathematics Textbooks in China

Quantum Point Obfuscation

Contact Info

Product

Resources

About