共 50 条
- [41] Efficient two party and multi party computation against covert adversaries [J]. ADVANCES IN CRYPTOLOGY - EUROCRYPT 2008, 2008, 4965 : 289 - +
- [43] Efficient Set Operations in the Presence of Malicious Adversaries [J]. PUBLIC KEY CRYPTOGRAPHY - PKC 2010, PROCEEDINGS, 2010, 6056 : 312 - +
- [44] General adversaries in unconditional multi-party computation [J]. ADVANCES IN CRYPTOLOGY - ASIACRYPT'99, PROCEEDINGS, 1999, 1716 : 232 - 246
- [45] Privacy-Preserving Multi-Party Bartering Secure Against Active Adversaries [J]. 2017 15TH ANNUAL CONFERENCE ON PRIVACY, SECURITY AND TRUST (PST), 2017, : 205 - 214
- [46] Two Cloud-assisted Over-threshold Multi-party Private Set Intersection Calculation Protocol [J]. Ruan Jian Xue Bao/Journal of Software, 2023, 34 (11): : 5442 - 5456
- [47] Large-Scale Multi-party Counting Set Intersection Using a Space Efficient Global Synopsis [J]. DATABASE SYSTEMS FOR ADVANCED APPLICATIONS, DASFAA 2015, PT II, 2015, 9050 : 329 - 345
- [48] Automatic Proofs of Privacy of Secure Multi-Party Computation Protocols Against Active Adversaries [J]. 2015 IEEE 28TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM CSF 2015, 2015, : 75 - 89
- [49] Revisiting the Efficiency of Perfectly Secure Asynchronous Multi-party Computation Against General Adversaries [J]. PROGRESS IN CRYPTOLOGY, INDOCRYPT 2022, 2022, 13774 : 223 - 248
- [50] Nearly Optimal Protocols for Computing Multi-party Private Set Union [J]. 2022 IEEE/ACM 30TH INTERNATIONAL SYMPOSIUM ON QUALITY OF SERVICE (IWQOS), 2022,