Research on efficient and scalable private set intersection cardinality schemes
To address the issue of high computational overhead in existing two-party private set intersection cardinality (PSI-CA) protocols, an efficient two-party PSI-CA protocol was proposed. Oblivious key-value store (OKVS) and oblivious key-sharing pseudorandom function (OKS-PRF) were leveraged by this pr...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2025-05-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/thesisDetails#10.11959/j.issn.1000-436x.2025085 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!