Universally Composable Quantum Multi-party Computation
From MaRDI portal
Publication:3563852
DOI10.1007/978-3-642-13190-5_25zbMath1280.94096arXiv0910.2912OpenAlexW2119541381WikidataQ62038949 ScholiaQ62038949MaRDI QIDQ3563852
Publication date: 1 June 2010
Published in: Advances in Cryptology – EUROCRYPT 2010 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0910.2912
Related Items
On the concurrent composition of quantum zero-knowledge, Round efficient secure multiparty quantum computation with identifiable abort, Composable and finite computational security of quantum message transmission, Computational Security of Quantum Encryption, Efficient Simulation for Quantum Message Authentication, Improvements on: ``Multi-party quantum key agreement protocol with Bell states and single particles, Categorical composable cryptography: extended version, A new framework for quantum oblivious transfer, Categorical composable cryptography, Quantum Bell states-based anonymous voting with anonymity trace, Quantum solution to a class of two-party private summation problems, Security limitations of classical-client delegated quantum computing, A protocol for the secure two-party quantum scalar product, Quantum cryptography beyond quantum key distribution, Secure quantum computation with classical communication, Quantum Cryptography: Key Distribution and Beyond, Secure two-party computation in a quantum world, Robustness and device independence of verifiable blind quantum computing, Everlasting multi-party computation, Dispelling myths on superposition attacks: formal security model and attack analyses, Oblivious transfer is in MiniQCrypt, Adaptive Versus Non-Adaptive Strategies in the Quantum Setting with Applications, Secure two-party integer comparison protocol without any third party, Quantum Authentication with Key Recycling, Quantum Key Recycling with 8-state encoding (The Quantum One-Time Pad is more interesting than we thought), Quantum private comparison with a malicious third party
