Pages that link to "Item:Q2119031"
From MaRDI portal
The following pages link to PSI from PaXoS: fast, malicious private set intersection (Q2119031):
Displaying 28 items.
- VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE (Q2056777) (← links)
- Multi-party threshold private set intersection with sublinear communication (Q2061962) (← links)
- Private set operations from oblivious switching (Q2061976) (← links)
- Efficient and tight oblivious transfer from PKE with tight multi-user security (Q2096634) (← links)
- Two-sided malicious security for private intersection-sum with cardinality (Q2102051) (← links)
- Private set intersection in the internet setting from lightweight oblivious PRF (Q2102052) (← links)
- Oblivious key-value stores and amplification for private set intersection (Q2128570) (← links)
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes (Q2129008) (← links)
- Polynomial representation is tricky: maliciously secure private set intersection revisited (Q2148772) (← links)
- Adaptively code-correlation robustness functions and its applications to private set intersection (Q2682918) (← links)
- \textsf{Catalic}: delegated PSI cardinality with applications to contact tracing (Q2691609) (← links)
- Amortizing rate-1 OT and applications to PIR and PSI (Q2697889) (← links)
- VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets (Q5857774) (← links)
- Hiding the input-size in multi-party private set intersection (Q6048707) (← links)
- Structure-aware private set intersection, with applications to fuzzy matching (Q6097267) (← links)
- Practical and malicious private set intersection with improved efficiency (Q6122611) (← links)
- Finding one common item, privately (Q6134834) (← links)
- MyOPE: malicious security for oblivious polynomial evaluation (Q6134853) (← links)
- SoftSpokenOT: quieter OT extension from small-field silent VOLE in the Minicrypt model (Q6155273) (← links)
- Private join and compute from PIR with default (Q6157534) (← links)
- Maliciously Secure Multi-party PSI with Lower Bandwidth and Faster Computation (Q6487351) (← links)
- Linear Complexity Private Set Intersection for Secure Two-Party Protocols (Q6488032) (← links)
- Predicate private set intersection with linear complexity (Q6535113) (← links)
- Element distinctness and bounded input size in private set intersection and related protocols (Q6547968) (← links)
- Scalable multi-party private set union from multi-query secret-shared private membership test (Q6595683) (← links)
- Practically efficient private set intersection from trusted hardware with side-channels (Q6604877) (← links)
- Private computations on set intersection (Q6613361) (← links)
- Computation efficient structure-aware PSI from incremental function secret sharing (Q6653032) (← links)
