Linear-time 2-party secure merge from additively homomorphic encryption
From MaRDI portal
(Redirected from Publication:6168324)
Cites work
- Advances in Cryptology - EUROCRYPT 2004
- Combining private set intersection with secure two-party computation
- Distributed Oblivious RAM for Secure Two-Party Computation
- Efficient circuit-based PSI via cuckoo hashing
- Efficient circuit-based PSI with linear communication
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
- Fast secure computation of set intersection
- Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
- Faster packed homomorphic operations and efficient circuit bootstrapping for TFHE
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- How to simulate it -- a tutorial on the simulation proof technique
- scientific article; zbMATH DE number 1099195 (Why is no real title available?)
- scientific article; zbMATH DE number 7706039 (Why is no real title available?)
- Improved private set intersection against malicious adversaries
- More is less: perfectly secure oblivious algorithms in the multi-server setting
- New protocols for secure equality test and comparison
- Practically efficient multi-party sorting protocols from comparison sort algorithms
- Privacy-Preserving Set Operations
- Private database access with HE-over-ORAM architecture
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Software protection and simulation on oblivious RAMs
- Sorting in \(c \log n\) parallel steps
- SpOT-light: lightweight private set intersection from sparse OT extension
- Theory of Cryptography
This page was built for publication: Linear-time 2-party secure merge from additively homomorphic encryption
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6168324)
