Quantum solution to a class of two-party private summation problems
From MaRDI portal
Publication:1700369
DOI10.1007/s11128-017-1676-xzbMath1387.81193OpenAlexW2742132190MaRDI QIDQ1700369
Publication date: 5 March 2018
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-017-1676-x
Quantum computation (81P68) Cryptography (94A60) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (14)
Three-party secure semiquantum summation without entanglement among quantum user and classical users ⋮ Multi-party quantum summation within a \(d\)-level quantum system ⋮ Improvements on: ``Secure multi-party quantum summation based on quantum Fourier transform ⋮ Quantum secure multi-party summation based on entanglement swapping ⋮ Quantum secure multi-party private set intersection cardinality ⋮ A verifiable \((k,n)\)-threshold quantum secure multiparty summation protocol ⋮ Quantum summation using \(d\)-level entanglement swapping ⋮ Quantum secure multiparty summation based on the phase shifting operation of \(d\)-level quantum system and its application ⋮ Secure three-party semi-quantum summation using single photons ⋮ Secure multi-party quantum summation based on quantum Fourier transform ⋮ Cryptanalysis of secure multiparty quantum summation ⋮ Secure device-independent quantum bit-wise XOR summation based on a pseudo-telepathy game ⋮ Two-party secure semiquantum summation against the collective-dephasing noise ⋮ Measurement-device-independent quantum secure multiparty summation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum counting: algorithm and error distribution
- Quantum cryptography: public key distribution and coin tossing
- A communication-efficient private matching scheme in client-server model
- A proof of security of Yao's protocol for two-party computation
- Modern cryptology. A tutorial
- Secure and efficient private set intersection cardinality using Bloom filter
- Quantum Private Queries
- Universally Composable Quantum Multi-party Computation
- Secure multi-party quantum computation
- Advances in Cryptology - EUROCRYPT 2004
- Quantum cryptanalysis of hash and claw-free functions
- Counting by quantum eigenvalue estimation
This page was built for publication: Quantum solution to a class of two-party private summation problems