Secure two-party computation in a quantum world
From MaRDI portal
Recommendations
- Secure multi-party computation with a quantum manner
- Secure two-party computation based on blind quantum computation
- Susceptible Two-Party Quantum Computations
- Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
- Quantum security computation on shared secrets
- A novel quantum solution to secure two-party distance computation
- A novel quantum scheme for secure two-party distance computation
- Secure two-party computation is practical
- On the power of two-party quantum cryptography
- Actively secure two-party evaluation of any quantum operation
Cites work
- scientific article; zbMATH DE number 1722674 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 799789 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- A proof of security of Yao's protocol for two-party computation
- Advances in Cryptology - CRYPTO 2003
- Algorithms in HElib
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Efficient oblivious transfer protocols
- Fast garbling of circuits under standard assumptions
- Improved Garbled Circuit: Free XOR Gates and Applications
- More efficient oblivious transfer extensions
- Oblivious Transfer Based on the McEliece Assumptions
- On the security of the ``Free-XOR technique
- Post-Quantum Cryptography
- Quantum computation and quantum information. 10th anniversary edition
- Rainbow, a New Multivariable Polynomial Signature Scheme
- Revisiting TESLA in the quantum random oracle model
- Secure two-party computation in a quantum world
- Secure two-party computation is practical
- Sponges resist leakage: the case of authenticated encryption
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
- Two-message statistically sender-private OT from LWE
- Universally composable quantum multi-party computation
Cited in
(9)- Dispelling myths on superposition attacks: formal security model and attack analyses
- Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
- Composable oblivious pseudo-random functions via garbled circuits
- On concurrent multi-party quantum computation
- Efficient and tight oblivious transfer from PKE with tight multi-user security
- Round-optimal oblivious transfer and MPC from computational CSIDH
- Secure two-party computation in a quantum world
- A generic quantum protocol for one-sided secure two-party classical computations
- A protocol for the secure two-party quantum scalar product
This page was built for publication: Secure two-party computation in a quantum world
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229292)
