Pages that link to "Item:Q2014617"
From MaRDI portal
The following pages link to An efficient toolkit for computing private set operations (Q2014617):
Displaying 11 items.
- Efficient scalable multiparty private set-intersection via garbled Bloom filters (Q1796793) (← links)
- Secure and efficient multiparty private set intersection cardinality (Q2025374) (← links)
- Private set operations from oblivious switching (Q2061976) (← links)
- Privacy-preserving disjunctive normal form operations on distributed sets (Q2510150) (← links)
- Privacy-preserving mixed set operations (Q2663573) (← links)
- Efficient Concurrent Covert Computation of String Equality and Set Intersection (Q2799012) (← links)
- Constant-round privacy preserving multiset union (Q2872170) (← links)
- Hiding the input-size in multi-party private set intersection (Q6048707) (← links)
- Linear Complexity Private Set Intersection for Secure Two-Party Protocols (Q6488032) (← links)
- Enabling privacy-preserving non-interactive computation for Hamming distance (Q6544595) (← links)
- Scalable multi-party private set union from multi-query secret-shared private membership test (Q6595683) (← links)
