A fair and efficient solution to the socialist millionaires' problem
From MaRDI portal
Publication:5939234
DOI10.1016/S0166-218X(00)00342-5zbMath0978.68062DBLPjournals/dam/BoudotST01OpenAlexW2172042295WikidataQ60174463 ScholiaQ60174463MaRDI QIDQ5939234
Fabrice Boudot, Berry Schoenmakers, Jacques Traoré
Publication date: 30 October 2001
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00342-5
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Decision theory for games (91A35)
Related Items (38)
Efficient set intersection with simulation-based security ⋮ Multiparty Proximity Testing with Dishonest Majority from Equality Testing ⋮ An efficient quantum private comparison of equality over collective-noise channels ⋮ Private comparison protocol for multiple semi-quantum users based on Bell states ⋮ Dynamic multi-party quantum private comparison protocol with single photons in both polarization and spatial-mode degrees of freedom ⋮ Electronic jury voting protocols ⋮ Multi-party quantum private comparison based on the entanglement swapping of \(d\)-level cat states and \(d\)-level Bell states ⋮ An efficient protocol for the secure multi-party quantum summation ⋮ Semi-quantum private comparison based on Bell states ⋮ The complete new solutions to the blind millionaires' problem in \(d\)-dimensional quantum system ⋮ Quantum private comparison protocol based on four-particle GHZ states ⋮ Cryptanalysis and improvement in semi-quantum private comparison based on Bell states ⋮ Efficient multiparty quantum private comparison protocol based on single photons and rotation encryption ⋮ New quantum private comparison protocol using EPR pairs ⋮ A protocol for the quantum private comparison of equality with \(\chi \)-type state ⋮ A novel quantum identity authentication protocol without entanglement and preserving pre-shared key information ⋮ Quantum private comparison using genuine four-particle entangled states ⋮ Quantum private comparison protocol based on entanglement swapping of \(d\)-level Bell states ⋮ Comment on quantum private comparison protocols with a semi-honest third party ⋮ Efficient quantum private comparison employing single photons and collective detection ⋮ Multi-user private comparison protocol using GHZ class states ⋮ Secure quantum private comparison of equality based on asymmetric \(W\) state ⋮ Orthogonal-state-based and semi-quantum protocols for quantum private comparison in noisy environment ⋮ Multi-party quantum private comparison protocol using \(d\)-dimensional basis states without entanglement swapping ⋮ Quantum private comparison of equality protocol without a third party ⋮ Cryptanalysis and improvement of several quantum private comparison protocols ⋮ Multi-party quantum private comparison protocol with \(n\)-level entangled states ⋮ Multi-party quantum private comparison based on entanglement swapping of Bell entangled states within \(d\)-level quantum system ⋮ Multi-party quantum private comparison of size relation with \(d\)-level single-particle states ⋮ Proving possession of arbitrary secrets while not giving them away: New protocols and a proof in GNY logic ⋮ Cryptanalysis of the quantum private comparison protocol based on the entanglement swapping between three-particle W-class state and Bell state ⋮ Fair Threshold Decryption with Semi-Trusted Third Parties ⋮ Universally Composable Private Proximity Testing ⋮ Efficient quantum private comparison based on entanglement swapping of Bell states ⋮ Circular multi-party quantum private comparison with \(n\)-level single-particle states ⋮ Cryptanalysis and improvement of the quantum private comparison protocol with semi-honest third party ⋮ Robust semi-quantum private comparison protocols against collective noises with decoherence-free states ⋮ Comment on ``Efficient and feasible quantum private comparison of equality against the collective amplitude damping noise
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic encryption
- Efficient signature generation by smart cards
- Security Proofs for Signature Schemes
- Proving Without Knowing: On Oblivious, Agnostic and Blindfolded Provers
- A public key cryptosystem and a signature scheme based on discrete logarithms
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
This page was built for publication: A fair and efficient solution to the socialist millionaires' problem
