Quantum secure two-party computation for set intersection with rational players
From MaRDI portal
Publication:1993844
DOI10.1007/S11128-018-1968-9zbMath1448.81287arXiv1801.08319OpenAlexW3098166311WikidataQ129629033 ScholiaQ129629033MaRDI QIDQ1993844
Publication date: 5 November 2018
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.08319
2-person games (91A05) Quantum computation (81P68) Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Quantum cryptography (quantum-theoretic aspects) (81P94) Equilibrium refinements (91A11) Quantum games (91A81)
Related Items (3)
Feasible private set intersection in quantum domain ⋮ A novel quantum private set intersection scheme with a semi-honest third party ⋮ An improved quantum private set intersection protocol based on Hadamard gates
Cites Work
- Unnamed Item
- Unnamed Item
- An efficient quantum scheme for private set intersection
- Efficient set operations in the presence of malicious adversaries
- Efficient robust private set intersection
- Probability inequalities for the sum in sampling without replacement
- Utility dependence in correct and fair rational secret sharing
- Fair Computation with Rational Players
- Towards a Game Theoretic View of Secure Computation
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- New directions in cryptography
- Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
- Advances in Cryptology - EUROCRYPT 2004
- A single quantum cannot be cloned
- Complete Fairness in Secure Two-Party Computation
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Quantum Information Theory
This page was built for publication: Quantum secure two-party computation for set intersection with rational players
