Secure Multi-party Shuffling-Reference-Cited by-同舟云学术

Secure Multi-party Shuffling

Published:2015 Issue: Volume: Page:459-473
ISSN:0302-9743
Container-title:Structural Information and Communication Complexity
language:
Short-container-title:

Author:

Movahedi Mahnush,Saia Jared,Zamani Mahdi

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-25258-2_32

Reference34 articles.

1. Extended version of this paper. http://cs.unm.edu/~zamani/papers/sirocco15

2. Lecture Notes in Computer Science;B. Adida,2007

3. Ajtai, M., Komlós, J., Szemerédi, E.: An 0(nlogn) sorting network. In: Proceedings of STOC 1983, pp. 1–9. ACM, New York (1983)

4. Ajtai, M., Komlós, J., Szemerédi, E.: Sorting in clogn parallel steps. Combinatorica 3(1), 1–19 (1983)

5. Asharov, G., Lindell, Y.: A full proof of the BGW protocol for perfectly-secure multiparty computation. Cryptology ePrint Archive, Report 2011/136 (2011)

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

1. Revisiting Privacy-Preserving Min and K-Th Min Protocols for Mobile Sensing;IEEE Transactions on Dependable and Secure Computing;2024

2. Amplification by Shuffling without Shuffling;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15

3. Spreading the Privacy Blanket:;Applied Cryptography and Network Security;2022

4. (∈, δ)-Indistinguishable Mixing for Cryptocurrencies;Proceedings on Privacy Enhancing Technologies;2021-11-20

5. Oblivious Linear Group Actions and Applications;Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security;2021-11-12