Related papers: Quantum homomorphic encryption for circuits of low…
The trend towards delegating data processing to a remote party raises major concerns related to privacy violations for both end-users and service providers. These concerns have attracted the attention of the research community, and several…
This article proposes a comprehensive approach to implementing encryption schemes based on the automorphism group of the Hermitian function field. We utilize a three-parameter group with logarithmic representations outside the group's…
Based on quantum encryption, we present a new idea for quantum public-key cryptography (QPKC) and construct a whole theoretical framework of a QPKC system. We show that the quantum-mechanical nature renders it feasible and reasonable to use…
At present, in the face of the huge and complex data in cloud computing, the parallel computing ability of quantum computing is particularly important. Quantum principal component analysis algorithm is used as a method of quantum state…
Fully Homomorphic Encryption (FHE) provides a powerful paradigm for secure computation, but its practical adoption is severely hindered by the prohibitive computational cost of its bootstrapping procedure. The complexity of all current…
The gold-standard for security in quantum cryptographic protocols is information-theoretic security. Information-theoretic security is surely future-proof, because it makes no assumptions on the hardness of any computational problems and…
Homomorphic encryption has been an area of study in classical computing for decades. The fundamental goal of homomorphic encryption is to enable (untrusted) Oscar to perform a computation for Alice without Oscar knowing the input to the…
The concept of anamorphic encryption, first formally introduced by Persiano et al. in their influential 2022 paper titled ``Anamorphic Encryption: Private Communication Against a Dictator,'' enables embedding covert messages within…
Secure function evaluation (SFE) is the process of computing a function (or running an algorithm) on some data, while keeping the input, output and intermediate results hidden from the environment in which the function is evaluated. This…
Fully homomorphic encryption (FHE) is a powerful encryption technique that allows for computation to be performed on ciphertext without the need for decryption. FHE will thus enable privacy-preserving computation and a wide range of…
We propose the Parity Flow formalism, a method for tracking the information flow in quantum circuits. This method adds labels to quantum circuit diagrams such that the action of Clifford gates can be understood as a recoding of quantum…
We systematically construct and classify fault-tolerant logical gates implemented by constant-depth circuits for quantum codes using cohomology operations and symmetry. These logical gates are obtained from unitary operators given by…
Fully homomorphic encryption (FHE) enables an entity to perform arbitrary computation on encrypted data without decrypting the ciphertexts. An ongoing group-theoretical approach to construct an FHE scheme uses a certain "compression"…
Hamiltonian simulation is a key quantum algorithm for modeling complex systems. To implement a Hamiltonian simulation, it is typically decomposed into a list of Pauli strings, each corresponds to an RZ rotation gate with many Clifford…
We introduce a framework for the formal specification and verification of quantum circuits based on the Feynman path integral. Our formalism, built around exponential sums of polynomial functions, provides a structured and natural way of…
Fully Homomorphic Encryption (FHE) represents a paradigm shift in cryptography, enabling computation directly on encrypted data and unlocking privacy-critical computation. Despite being increasingly deployed in real platforms, the…
Cryptography is an art and science of secure communication. Here the sender and receiver are guaranteed the security through encryption of their data, with the help of a common key. Both the parties should agree on this key prior to…
Quantum fully homomorphic encryption (QFHE) promises secure delegated quantum computation but has been impeded by the prohibitive quantum resource demands of existing constructions. This paper introduces a unified framework that achieves an…
A universal quantum computing scheme, with a universal set of logical gates, is proposed based on networks of 1D quantum systems. The encoding of information is in terms of universal features of gapped phases, for which effective field…
We propose a symmetric key homomorphic encryption scheme based on the evaluation of multivariate polynomials over a finite field. The proposed scheme is somewhat homomorphic with respect to addition and multiplication. Further, we define a…