Quantum computers promise to efficiently solve not only problems believed to be intractable
for classical computers, but also problems for which verifying the solution is also considered …

In this paper, we present several methods to improve the evaluation of homomorphic
functions in TFHE, both for fully and for leveled homomorphic encryption. We propose two …

Quantum homomorphic encryption has obvious superiority in privacy protection. In this
paper, we propose an improved multiparty quantum private comparison protocol based on …

The problem of reliably certifying the outcome of a computation performed by a quantum
device is rapidly gaining relevance. We present two protocols for a classical verifier to …

Quantum copy protection, introduced by Aaronson, enables giving out a quantum program-
description that cannot be meaningfully duplicated. Despite over a decade of study, copy …

We show how to obfuscate pseudo-deterministic quantum circuits, assuming the quantum
hardness of learning with errors (QLWE) and post-quantum virtual black-box (VBB) …

The functionality of classically-instructed remotely prepared random secret qubits was
introduced in (Cojocaru et al. 2018) as a way to enable classical parties to participate in …

Existing classical ciphertext retrieval schemes are mainly developed according to the
homomorphic encryption that is a cryptographic technique based on computational …

Quantum homomorphic encryption (QHE) allows computation on encrypted data by
employing the principles of quantum mechanics. Usually, only one evaluator is chosen to …

Quantum homomorphic encryption provides the ability to perform calculations on encrypted
data without decrypting them. The number of evaluators in most previous schemes is 1, and …