Fast private set intersection from polynomial multiplication triples

DOI10.1007/978-981-96-5566-3_9MaRDI QIDQ6877467zbMATH OpenFDO

Authors Kai Chen, Yongqiang Li, Ya Han, Mingsheng Wang

Publication date 8 January 2026

Full work available at URL https://doi.org/10.1007/978-981-96-5566-3_9

zbMATH Keywords

private set intersectionhomomorphic encryptionpolynomial multiplication triples

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• scientific article; zbMATH DE number 176564 (Why is no real title available?)
• scientific article; zbMATH DE number 2151179 (Why is no real title available?)
• scientific article; zbMATH DE number 1418291 (Why is no real title available?)
• (Leveled) fully homomorphic encryption without bootstrapping
• A note on the implementation of the number theoretic transform
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Actively secure 1-out-of-N OT extension with application to private set intersection
• Advances in Cryptology - CRYPTO 2003
• Advances in Cryptology - EUROCRYPT 2004
• An Algorithm for the Machine Calculation of Complex Fourier Series
• An algebraic approach to maliciously secure private set intersection
• Efficient circuit-based PSI with linear communication
• Expected Length of the Longest Probe Sequence in Hash Code Searching
• Fast modular transforms
• Faster integer multiplication
• Fully homomorphic SIMD operations
• Homomorphic evaluation of the AES circuit
• Improved private set intersection against malicious adversaries
• Oblivious key-value stores and amplification for private set intersection
• On ideal lattices and learning with errors over rings
• On the power of commutativity in cryptography
• PSI from PaXoS: fast, malicious private set intersection
• Packed ciphertexts in LWE-based homomorphic encryption
• Privacy-Preserving Set Operations
• Private set intersection in the internet setting from lightweight oblivious PRF
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• SpOT-light: lightweight private set intersection from sparse OT extension
• Speeding up the number theoretic transform for faster ideal lattice-based cryptography
• Theory of Cryptography
• Two-sided malicious security for private intersection-sum with cardinality
• VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE
• \textsf{Catalic}: delegated PSI cardinality with applications to contact tracing

This page was built for publication: Fast private set intersection from polynomial multiplication triples

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6877467)