Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries

DOI10.1007/978-3-642-14623-7_37zbMath1283.81047arXiv1009.2096OpenAlexW3105857502MaRDI QIDQ3582784

Jesper Buus Nielsen, Louis Salvail, Frédéric Dupuis

Publication date: 24 August 2010

Published in: Advances in Cryptology – CRYPTO 2010 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1009.2096

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items

On the round complexity of secure quantum computation, One-way functions imply secure computation in a quantum world, Computational Security of Quantum Encryption, Secure two-party computation based on blind quantum computation, A protocol for the secure two-party quantum scalar product, Quantum cryptography beyond quantum key distribution, Rate-1 quantum fully homomorphic encryption, Symmetric quantum fully homomorphic encryption with perfect security, Quantum fully homomorphic encryption scheme based on universal quantum circuit, Secure multi-party quantum computation based on blind quantum computation, Quantum private information retrieval has linear communication complexity, Secure multi-party quantum computation with a dishonest majority, Efficient simulation of random states and random unitaries, Post-quantum multi-party computation, Oblivious transfer is in MiniQCrypt, Quantum Homomorphic Encryption for Polynomial-Sized Circuits