Secure Computation of the $$k^{\mathrm {th}}$$-Ranked Element in a Star Network-Reference-Cited by-同舟云学术

Secure Computation of the $$k^{\mathrm {th}}$$-Ranked Element in a Star Network

Published:2020 Issue: Volume: Page:386-403
ISSN:0302-9743
Container-title:Financial Cryptography and Data Security
language:
Short-container-title:

Author:

Tueno Anselme,Kerschbaum Florian,Katzenbeisser Stefan,Boev Yordan,Qureshi Mubashir

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-51280-4_21

Reference33 articles.

1. Lecture Notes in Computer Science;G Aggarwal,2004

2. Bellare, M., Hoang, V.T., Rogaway, P.: Foundations of garbled circuits. In: CCS (CCS 2012), pp. 784–796 (2012)

3. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: STOC, pp. 1–10. ACM, New York (1988)

4. Lecture Notes in Computer Science;E-O Blass,2018

5. Blass, E., Kerschbaum, F.: Secure computation of the $$k^{\text{ th }}$$-ranked integer on blockchains. IACR Cryptology ePrint Arch. 2019, 276 (2019)

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Poster: Secure and Differentially Private kth Ranked Element;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15

2. CVFL: A Chain-like and Verifiable Federated Learning Scheme with Computational Efficiency Based on Lagrange Interpolation Functions;Mathematics;2023-11-04

3. Federated Analytics: A Survey;APSIPA Transactions on Signal and Information Processing;2023

4. Secure Determining of the k-th Greatest Element Among Distributed Private Values;2021 26th International Computer Conference, Computer Society of Iran (CSICC);2021-03-03

5. Efficient Secure Computation of Order-Preserving Encryption;Proceedings of the 15th ACM Asia Conference on Computer and Communications Security;2020-10-05