Polynomial representation is tricky: maliciously secure private set intersection revisited

DOI10.1007/978-3-030-88428-4_35zbMath1498.94050OpenAlexW3201965566MaRDI QIDQ2148772

Aydin Abadi, Thomas Zacharias, Steven J. Murdoch

Publication date: 24 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-88428-4_35

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Privacy of data (68P27)

Related Items (3)

Multi-party updatable delegated private set intersection ⋮ Hiding the input-size in multi-party private set intersection ⋮ Improved private set intersection for sets with small entries

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient scalable multiparty private set-intersection via garbled Bloom filters
• Private set intersection in the internet setting from lightweight oblivious PRF
• PSI from PaXoS: fast, malicious private set intersection
• An algebraic approach to maliciously secure private set intersection
• The communication complexity of threshold private set intersection
• Maliciously secure oblivious linear function evaluation with constant overhead
• \textsf{Catalic}: delegated PSI cardinality with applications to contact tracing
• Private Database Queries Using Somewhat Homomorphic Encryption
• How to share a secret
• Polynomial Codes Over Certain Finite Fields
• Private Intersection of Certified Sets
• Advances in Cryptology - EUROCRYPT 2004
• Privacy-Preserving Set Operations
• Scalable Multi-party Private Set-Intersection
• VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets

This page was built for publication: Polynomial representation is tricky: maliciously secure private set intersection revisited