Rate-1 quantum fully homomorphic encryption

DOI10.1007/978-3-030-90459-3_6MaRDI QIDQ2695630zbMATH OpenOpenAlexFDO

Authors 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

learning with errors problemsecure function evaluation

Mathematics Subject Classification ID

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

Recommendations

• Quantum FHE (almost) as secure as classical
• Classical homomorphic encryption for quantum circuits
• Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity

Cites work

• \(i\)-hop homomorphic encryption and rerandomizable Yao circuits
• Actively secure two-party evaluation of any quantum operation
• Advances in Cryptology – CRYPTO 2004
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Efficient oblivious transfer protocols
• Fully homomorphic encryption using ideal lattices
• scientific article; zbMATH DE number 1722674 (Why is no real title available?)
• Lattice-based FHE as secure as PKE
• Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
• Maliciously circuit-private FHE
• Oblivious transfer and polynomial evaluation
• On lattices, learning with errors, random linear codes, and cryptography
• On the round complexity of secure quantum computation
• Packing messages and optimizing bootstrapping in GSW-FHE
• Post-quantum zero knowledge in constant rounds
• Pseudorandomness of ring-LWE for any ring and modulus
• Quantum FHE (almost) as secure as classical
• Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
• Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
• Spooky Encryption and Its Applications
• Trapdoor hash functions and their applications
• Two-message statistically sender-private OT from LWE
• Universal Blind Quantum Computation

Cited in

(5)

• Constant-round blind classical verification of quantum sampling
• On the communication complexity of secure function evaluation with long output
• Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity
• Rate-limited secure function evaluation: definitions and constructions
• Fully-homomorphic encryption from lattice isomorphism

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2695630)