88 lines
3.9 KiB
BibTeX
88 lines
3.9 KiB
BibTeX
@misc{moritz2018raydistributedframeworkemerging,
|
|
title = {Ray: A Distributed Framework for Emerging AI Applications},
|
|
author = {Philipp Moritz and Robert Nishihara and Stephanie Wang and Alexey
|
|
Tumanov and Richard Liaw and Eric Liang and Melih Elibol and Zongheng
|
|
Yang and William Paul and Michael I. Jordan and Ion Stoica},
|
|
year = {2018},
|
|
eprint = {1712.05889},
|
|
archivePrefix = {arXiv},
|
|
primaryClass = {cs.DC},
|
|
url = {https://arxiv.org/abs/1712.05889},
|
|
}
|
|
|
|
@inproceedings{Ma2023,
|
|
author = {Junming Ma and Yancheng Zheng and Jun Feng and Derun Zhao and Haoqi
|
|
Wu and Wenjing Fang and Jin Tan and Chaofan Yu and Benyu Zhang and
|
|
Lei Wang},
|
|
title = {{SecretFlow-SPU}: A Performant and {User-Friendly} Framework for {
|
|
Privacy-Preserving} Machine Learning},
|
|
booktitle = {2023 USENIX Annual Technical Conference (USENIX ATC 23)},
|
|
year = {2023},
|
|
isbn = {978-1-939133-35-9},
|
|
address = {Boston, MA},
|
|
pages = {17--33},
|
|
url = {https://www.usenix.org/conference/atc23/presentation/ma},
|
|
publisher = {USENIX Association},
|
|
month = jul,
|
|
}
|
|
|
|
@inproceedings{mp-spdz,
|
|
author = {Marcel Keller},
|
|
title = {{MP-SPDZ}: A Versatile Framework for Multi-Party Computation},
|
|
booktitle = {Proceedings of the 2020 ACM SIGSAC Conference on Computer and
|
|
Communications Security},
|
|
year = {2020},
|
|
doi = {10.1145/3372297.3417872},
|
|
url = {https://doi.org/10.1145/3372297.3417872},
|
|
}
|
|
|
|
@inproceedings{Dam2009,
|
|
author = "Damg{\aa}rd, Ivan and Geisler, Martin and Kr{\o}igaard, Mikkel and
|
|
Nielsen, Jesper Buus",
|
|
editor = "Jarecki, Stanis{\l}aw and Tsudik, Gene",
|
|
title = "Asynchronous Multiparty Computation: Theory and Implementation",
|
|
booktitle = "Public Key Cryptography -- PKC 2009",
|
|
year = "2009",
|
|
publisher = "Springer Berlin Heidelberg",
|
|
address = "Berlin, Heidelberg",
|
|
pages = "160--179",
|
|
abstract = "We propose an asynchronous protocol for general multiparty
|
|
computation. The protocol has perfect security and communication
|
|
complexity {\$}{\backslash}mathcal{\{}O{\}}(n^2|C|k){\$}, where n
|
|
is the number of parties, |C| is the size of the arithmetic circuit
|
|
being computed, and k is the size of elements in the underlying
|
|
field. The protocol guarantees termination if the adversary allows
|
|
a preprocessing phase to terminate, in which no information is
|
|
released. The communication complexity of this protocol is the same
|
|
as that of a passively secure solution up to a constant factor. It
|
|
is secure against an adaptive and active adversary corrupting less
|
|
than n/3 players. We also present a software framework for
|
|
implementation of asynchronous protocols called VIFF (Virtual Ideal
|
|
Functionality Framework), which allows automatic parallelization of
|
|
primitive operations such as secure multiplications, without having
|
|
to resort to complicated multithreading. Benchmarking of a VIFF
|
|
implementation of our protocol confirms that it is applicable to
|
|
practical non-trivial secure computations.",
|
|
isbn = "978-3-642-00468-1",
|
|
}
|
|
|
|
@misc{hbMPC,
|
|
author = {Donghang Lu and Thomas Yurek and Samarth Kulshreshtha and Rahul
|
|
Govind and Rahul Mahadev and Aniket Kate and Andrew Miller},
|
|
title = {{HoneyBadgerMPC} and {AsynchroMix}: Practical {AsynchronousMPC} and
|
|
its Application to Anonymous Communication},
|
|
howpublished = {Cryptology {ePrint} Archive, Paper 2019/883},
|
|
year = {2019},
|
|
url = {https://eprint.iacr.org/2019/883},
|
|
}
|
|
|
|
@misc{Dumbo-MPC,
|
|
author = {Yuan Su and Yuan Lu and Jiliang Li and Yuyi Wang and Chengyi Dong
|
|
and Qiang Tang},
|
|
title = {Dumbo-{MPC}: Efficient Fully Asynchronous {MPC} with Optimal
|
|
Resilience},
|
|
howpublished = {Cryptology {ePrint} Archive, Paper 2024/1705},
|
|
year = {2024},
|
|
url = {https://eprint.iacr.org/2024/1705},
|
|
}
|