Quantum homomorphic encryption for polynomial-sized circuits

DOI10.1007/978-3-662-53015-3_1MaRDI QIDQ6828846zbMATH OpenFDO

Authors Yfke Dulek, Christian Schaffner, Florian Speelman

Publication date 9 November 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-53015-3_1

zbMATH Keywords

garden-hose modelhomomorphic encryptionquantum cryptographyquantum teleportation

Mathematics Subject Classification ID

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

Cited in

(7)

• Authenticated sublinear quantum private information retrieval
• Publicly verifiable quantum homomorphic encryption based on quantum remote control
• Cloud-based semi-quantum money
• Error-correctable efficient quantum homomorphic encryption using Calderbank-Shor-Steane codes
• Communication memento: memoryless communication complexity
• Fully-homomorphic encryption from lattice isomorphism
• Quantum scheme for private set intersection and union cardinality based on quantum homomorphic encryption

This page was built for publication: Quantum homomorphic encryption for polynomial-sized circuits

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