Author:
Bradley Tatiana,Faber Sky,Tsudik Gene
Publisher
Springer International Publishing
Reference34 articles.
1. Lecture Notes in Computer Science;G Ateniese,2011
2. Bellare, M., Rogaway, P.: Random oracles are practical: a paradigm for designing efficient protocols. In: ACM Conference on Computer and Communications Security, pp. 62–73. ACM (1993)
3. Lecture Notes in Computer Science;D Boneh,2004
4. Lecture Notes in Computer Science;D Boneh,2004
5. Bradley, T., Faber, S., Tsudik, G.: Bounded size-hiding private set intersection. IACR Cryptology ePrint Archive, Report 2016/657 (2016). http://eprint.iacr.org/2016/657
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Element Distinctness and Bounded Input Size in Private Set Intersection and Related Protocols;Lecture Notes in Computer Science;2024
2. Hiding the input-size in multi-party private set intersection;Designs, Codes and Cryptography;2023-05-24
3. Private Set Intersection for Viewing History with Efficient Data Matching;Communications in Computer and Information Science;2022
4. Compact and Malicious Private Set Intersection for Small Sets;Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security;2021-11-12
5. Can You Find The One for Me?;Proceedings of the 2018 Workshop on Privacy in the Electronic Society;2018-01-15