Quantum private set intersection cardinality and its application to anonymous authentication
From MaRDI portal
Publication:2282131
DOI10.1016/j.ins.2016.07.071zbMath1428.81071OpenAlexW2488997828MaRDI QIDQ2282131
Yi Mu, Hong Zhong, Jie Cui, Shun Zhang, Run-hua Shi
Publication date: 6 January 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://ro.uow.edu.au/cgi/viewcontent.cgi?article=6729&context=eispapers
Quantum computation (81P68) Authentication, digital signatures and secret sharing (94A62) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum cryptography (quantum-theoretic aspects) (81P94)
Related Items (16)
A generic quantum protocol for one-sided secure two-party classical computations ⋮ Quantum multi-party private set union protocol based on least common multiple and Shor’s algorithm ⋮ Efficient private set intersection cardinality protocol in the reverse unbalanced setting ⋮ Quantum secure multi-party private set intersection cardinality ⋮ Quantum protocol for privacy preserving Hamming distance problem of DNA sequences ⋮ A novel quantum scheme for secure two-party distance computation ⋮ Quantum protocols for private set intersection cardinality and union cardinality based on entanglement swapping ⋮ High-dimensional quantum threshold anonymous identity authentication scheme ⋮ Decoherence can help quantum cryptographic security ⋮ Restricted \((k,n)\)-threshold quantum secret sharing scheme based on local distinguishability of orthogonal multiqudit entangled states ⋮ Semi-quantum key agreement and private comparison protocols using Bell states ⋮ Secure and efficient multiparty private set intersection cardinality ⋮ Strong privacy-preserving two-party scalar product quantum protocol ⋮ Quantum protocol for millionaire problem ⋮ Secure two-party integer comparison protocol without any third party ⋮ Measurement-device-independent quantum secure multiparty summation
Cites Work
- Unnamed Item
- Unnamed Item
- Quantum counting: algorithm and error distribution
- Secure multiparty computation of solid geometric problems and their applications
- Certificate-free \textit{ad hoc} anonymous authentication
- Quantum state secure transmission in network communications
- A communication-efficient private matching scheme in client-server model
- Preserving privacy for free: efficient and provably secure two-factor authentication scheme with user anonymity
- Secure and efficient private set intersection cardinality using Bloom filter
- Quantum Computation and Quantum Information
- Private Intersection of Certified Sets
- Advances in Cryptology - EUROCRYPT 2004
- Privacy-Preserving Set Operations
- Counting by quantum eigenvalue estimation
This page was built for publication: Quantum private set intersection cardinality and its application to anonymous authentication
