Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Quantum Secure Protocols for Multiparty Computations (2312.16318v2)

Published 26 Dec 2023 in quant-ph and cs.CR

Abstract: Secure multiparty computation (MPC) schemes allow two or more parties to conjointly compute a function on their private input sets while revealing nothing but the output. Existing state-of-the-art number-theoretic-based designs face the threat of attacks through quantum algorithms. In this context, we present secure MPC protocols that can withstand quantum attacks. We first present the design and analysis of an information-theoretic secure oblivious linear evaluation (OLE), namely ${\sf qOLE}$ in the quantum domain, and show that our ${\sf qOLE}$ is safe from external attacks. In addition, our scheme satisfies all the security requirements of a secure OLE. We further utilize ${\sf qOLE}$ as a building block to construct a quantum-safe multiparty private set intersection (MPSI) protocol.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (40)
  1. O. R. Michael and M. Rabin, “How to exchange secrets by oblivious transfer,” Technical report, Aiken Computation Laboratory. Harvard University, Tech. Rep., 1981.
  2. J. Kilian, “Founding crytpography on oblivious transfer,” in Proceedings of the twentieth annual ACM symposium on Theory of computing, 1988, pp. 20–31.
  3. M. Naor and B. Pinkas, “Oblivious polynomial evaluation,” SIAM Journal on Computing, vol. 35, no. 5, pp. 1254–1281, 2006.
  4. I. Damgård, V. Pastro, N. Smart, and S. Zakarias, “Multiparty computation from somewhat homomorphic encryption,” in Annual Cryptology Conference.   Springer, 2012, pp. 643–662.
  5. B. Applebaum, Y. Ishai, and E. Kushilevitz, “How to garble arithmetic circuits,” SIAM Journal on Computing, vol. 43, no. 2, pp. 905–929, 2014.
  6. L. Cianciullo and H. Ghodosi, “Efficient information theoretic multi-party computation from oblivious linear evaluation,” in IFIP International Conference on Information Security Theory and Practice.   Springer, 2018, pp. 78–90.
  7. A. B. Efraim, O. Nissenbaum, E. Omri, and A. Paskin-Cherniavsky, “Psimple: Practical multiparty maliciously-secure private set intersection,” Cryptology ePrint Archive, Report 2021/122, 2021. https://eprint. iacr. org, Tech. Rep., 2021.
  8. R. A. Mahdavi, T. Humphries, B. Kacsmar, S. Krastnikov, N. Lukas, J. A. Premkumar, M. Shafieinejad, S. Oya, F. Kerschbaum, and E.-O. Blass, “Practical over-threshold multi-party private set intersection,” in Annual Computer Security Applications Conference, 2020, pp. 772–783.
  9. R. Inbar, E. Omri, and B. Pinkas, “Efficient scalable multiparty private set-intersection via garbled bloom filters,” in International Conference on Security and Cryptography for Networks.   Springer, 2018, pp. 235–252.
  10. A. Abadi, S. Terzis, and C. Dong, “Feather: lightweight multi-party updatable delegated private set intersection,” 2020.
  11. S. Badrinarayanan, P. Miao, S. Raghuraman, and P. Rindal, “Multi-party threshold private set intersection with sublinear communication,” in IACR International Conference on Public-Key Cryptography.   Springer, 2021, pp. 349–379.
  12. A. Bay, Z. Erkin, M. Alishahi, and J. Vos, “Multi-party private set intersection protocols for practical applications,” in 18th International Conference on Security and Cryptography, SECRYPT 2021.   SciTePress, 2021, pp. 515–522.
  13. E. Zhang, F.-H. Liu, Q. Lai, G. Jin, and Y. Li, “Efficient multi-party private set intersection against malicious adversaries,” in Proceedings of the 2019 ACM SIGSAC Conference on Cloud Computing Security Workshop, 2019, pp. 93–104.
  14. V. Kolesnikov, N. Matania, B. Pinkas, M. Rosulek, and N. Trieu, “Practical multi-party private set intersection from symmetric-key techniques,” in Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017, pp. 1257–1272.
  15. R. L. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems,” Communications of the ACM, vol. 21, no. 2, pp. 120–126, 1978.
  16. D. W. Kravitz, “Digital signature algorithm,” Jul. 27 1993, uS Patent 5,231,668.
  17. N. Koblitz, “Elliptic curve cryptosystems,” Mathematics of computation, vol. 48, no. 177, pp. 203–209, 1987.
  18. P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM review, vol. 41, no. 2, pp. 303–332, 1999.
  19. V. Srivastava, A. Baksi, and S. K. Debnath, “An overview of hash based signatures,” Cryptology ePrint Archive, 2023.
  20. D. Micciancio and O. Regev, “Lattice-based cryptography,” in Post-quantum cryptography.   Springer, 2009, pp. 147–191.
  21. J. Ding and A. Petzoldt, “Current state of multivariate cryptography,” IEEE Security & Privacy, vol. 15, no. 4, pp. 28–36, 2017.
  22. R.-h. Shi, Y. Mu, H. Zhong, J. Cui, and S. Zhang, “An efficient quantum scheme for private set intersection,” Quantum Information Processing, vol. 15, no. 1, pp. 363–371, 2016.
  23. X. Cheng, R. Guo, and Y. Chen, “Cryptanalysis and improvement of a quantum private set intersection protocol,” Quantum Information Processing, vol. 16, no. 2, pp. 1–8, 2017.
  24. R.-h. Shi, Y. Mu, H. Zhong, and S. Zhang, “Quantum oblivious set-member decision protocol,” Physical Review A, vol. 92, no. 2, p. 022309, 2015.
  25. A. Maitra, “Quantum secure two-party computation for set intersection with rational players,” Quantum Information Processing, vol. 17, no. 8, pp. 1–21, 2018.
  26. S. K. Debnath, K. Dey, N. Kundu, and T. Choudhury, “Feasible private set intersection in quantum domain,” Quantum Information Processing, vol. 20, no. 1, pp. 1–11, 2021.
  27. S. K. Debnath, V. Srivastava, T. Mohanty, N. Kundu, and K. Sakurai, “Quantum secure privacy preserving technique to obtain the intersection of two datasets for contact tracing,” Journal of Information Security and Applications, vol. 66, p. 103127, 2022.
  28. W. Liu and H.-W. Yin, “A novel quantum protocol for private set intersection,” International Journal of Theoretical Physics, vol. 60, no. 6, pp. 2074–2083, 2021.
  29. W.-J. Liu, W.-B. Li, and H.-B. Wang, “An improved quantum private set intersection protocol based on hadamard gates,” International Journal of Theoretical Physics, vol. 61, no. 3, pp. 1–11, 2022.
  30. W. Liu and H.-W. Yin, “A quantum protocol for private substitution problem,” Quantum Information Processing, vol. 20, no. 5, pp. 1–11, 2021.
  31. Y. Wang, P. Hu, and Q. Xu, “Quantum protocols for private set intersection cardinality and union cardinality based on entanglement swapping,” International Journal of Theoretical Physics, vol. 60, no. 9, pp. 3514–3528, 2021.
  32. R.-H. Shi and Y.-F. Li, “Quantum private set intersection cardinality protocol with application to privacy-preserving condition query,” IEEE Transactions on Circuits and Systems I: Regular Papers, 2022.
  33. B. Liu, M. Zhang, and R. Shi, “Quantum secure multi-party private set intersection cardinality,” International Journal of Theoretical Physics, vol. 59, no. 7, pp. 1992–2007, 2020.
  34. R.-H. Shi, “Quantum multiparty privacy set intersection cardinality,” IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 68, no. 4, pp. 1203–1207, 2020.
  35. T. Mohanty, V. Srivastava, S. K. Debnath, A. K. Das, and B. Sikdar, “Quantum secure threshold private set intersection protocol for iot-enabled privacy preserving ride-sharing application,” IEEE Internet of Things Journal, 2023.
  36. M. Imran, “Secure multiparty quantum computations for greatest common divisor and private set intersection,” arXiv preprint arXiv:2303.17196, 2023.
  37. R.-h. Shi and X.-q. Fang, “Edge-assisted quantum protocol for secure multiparty logical and and its applications,” iScience, 2023.
  38. M. B. Santos, P. Mateus, and C. Vlachou, “Quantum universally composable oblivious linear evaluation,” 2022.
  39. P. O. Boykin and V. Roychowdhury, “Optimal encryption of quantum bits,” Physical review A, vol. 67, no. 4, p. 042317, 2003.
  40. C. H. Bennett and G. Brassard, “Quantum cryptography: Public key distribution and coin tossing,” arXiv preprint arXiv:2003.06557, 2020.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now