Updatable private set intersection from symmetric-key techniques

DOI10.1007/978-3-032-25317-0_13MaRDI QIDQ7299804zbMATH OpenFDO

Authors Junxin Liu, Peihan Miao, Mike Rosulek, Xinyi Shi, Jifeng Wang

Publication date 20 July 2026

Full work available at URL https://doi.org/10.1007/978-3-032-25317-0_13

Mathematics Subject Classification ID

Cryptography (94A60)

Cites work

• 3-party secure computation for RAMs: optimal and concretely efficient
• Advances in Cryptology - CRYPTO 2003
• Cuckoo hashing in cryptography: optimal parameters, robustness and applications
• Efficient circuit-based PSI with linear communication
• scientific article; zbMATH DE number 1256767 (Why is no real title available?)
• Improved private set intersection against malicious adversaries
• Oblivious key-value stores and amplification for private set intersection
• Oblivious RAM with worst-case logarithmic overhead
• Private set intersection in the internet setting from lightweight oblivious PRF
• PSI from PaXoS: fast, malicious private set intersection
• Simple and efficient two-server ORAM
• SpOT-light: lightweight private set intersection from sparse OT extension
• Universally composable security: a new paradigm for cryptographic protocols
• Updatable private set intersection revisited: extended functionalities, deletion, and worst-case complexity
• VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE

This page was built for publication: Updatable private set intersection from symmetric-key techniques

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