Rate-1 quantum fully homomorphic encryption

DOI10.1007/978-3-030-90459-3_6OpenAlexW3211895050MaRDI QIDQ2695630

Orestis Chardouvelis, Nico Döttling, Giulio Malavolta

Publication date: 31 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-90459-3_6

zbMATH Keywords

secure function evaluationlearning with errors problem

Mathematics Subject Classification ID

Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (1)

Constant-round blind classical verification of quantum sampling

Cites Work

• Unnamed Item
• Unnamed Item
• Quantum FHE (almost) as secure as classical
• Two-message statistically sender-private OT from LWE
• On the round complexity of secure quantum computation
• Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
• Trapdoor hash functions and their applications
• Oblivious transfer and polynomial evaluation
• Quantum Homomorphic Encryption for Polynomial-Sized Circuits
• Spooky Encryption and Its Applications
• Maliciously Circuit-Private FHE
• Actively Secure Two-Party Evaluation of Any Quantum Operation
• Packing Messages and Optimizing Bootstrapping in GSW-FHE
• Lattice-based FHE as secure as PKE
• Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
• i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits
• Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
• Pseudorandomness of ring-LWE for any ring and modulus
• Post-quantum zero knowledge in constant rounds
• Universal Blind Quantum Computation
• Fully homomorphic encryption using ideal lattices
• Advances in Cryptology – CRYPTO 2004
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Rate-1 quantum fully homomorphic encryption