Secure two-party computation in a quantum world
From MaRDI portal
Publication:2229292
DOI10.1007/978-3-030-57808-4_23OpenAlexW3023853934MaRDI QIDQ2229292
Publication date: 23 February 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-57808-4_23
oblivious transferhomomorphic encryptionsecure two-party computationpost-quantum securityYao's GC protocol
Related Items (4)
Round-optimal oblivious transfer and MPC from computational CSIDH ⋮ Secure two-party computation in a quantum world ⋮ Dispelling myths on superposition attacks: formal security model and attack analyses ⋮ Efficient and tight oblivious transfer from PKE with tight multi-user security
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A proof of security of Yao's protocol for two-party computation
- Two-message statistically sender-private OT from LWE
- Revisiting TESLA in the quantum random oracle model
- Sponges resist leakage: the case of authenticated encryption
- Secure two-party computation in a quantum world
- More efficient oblivious transfer extensions
- Fast garbling of circuits under standard assumptions
- Algorithms in HElib
- On the Security of the “Free-XOR” Technique
- Two Halves Make a Whole
- Quantum Computation and Quantum Information
- Towards Quantum-Resistant Cryptosystems from Supersingular Elliptic Curve Isogenies
- Improved Garbled Circuit: Free XOR Gates and Applications
- Post-Quantum Cryptography
- Universally Composable Quantum Multi-party Computation
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Rainbow, a New Multivariable Polynomial Signature Scheme
- Secure Two-Party Computation Is Practical
- Advances in Cryptology - CRYPTO 2003
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
- Oblivious Transfer Based on the McEliece Assumptions
This page was built for publication: Secure two-party computation in a quantum world
