Classical Homomorphic Encryption for Quantum Circuits (Q6139825): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: New bounds in some transference theorems in the geometry of numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Blind Quantum Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical hardness of learning with errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum FHE (almost) as secure as classical / rank
 
Normal rank
Property / cites work
 
Property / cites work: Post-quantum zero knowledge in constant rounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice-based FHE as secure as PKE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Qfactory: classically-instructed remote secret qubits preparation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3522545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Homomorphic Encryption for Polynomial-Sized Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully homomorphic encryption using ideal lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoors for hard lattices and new cryptographic constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public-key cryptosystems from the worst-case shortest vector problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decade of Lattice Cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandomness of ring-LWE for any ring and modulus / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank

Revision as of 16:19, 21 August 2024

scientific article; zbMATH DE number 7780699
Language Label Description Also known as
English
Classical Homomorphic Encryption for Quantum Circuits
scientific article; zbMATH DE number 7780699

    Statements

    Classical Homomorphic Encryption for Quantum Circuits (English)
    0 references
    0 references
    19 December 2023
    0 references
    homomorphic encryption
    0 references
    blind computing
    0 references
    learning with errors
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references