Polymath: Low-Latency MPC via Secure Polynomial Evaluations and Its Applications
While the practicality of secure multi-party computation (MPC) has been extensively analyzed and improved over the past decade, we are hitting the limits of efficiency with the traditional approaches of representing the computed functionalities as generic arithmetic or Boolean circuits. This work fo...
Guardado en:
Autores principales: | Lu Donghang, Yu Albert, Kate Aniket, Maji Hemanta |
---|---|
Formato: | article |
Lenguaje: | EN |
Publicado: |
Sciendo
2022
|
Materias: | |
Acceso en línea: | https://doaj.org/article/063828fcc93e4380a595dfcfa822cf12 |
Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
-
Differentially private partition selection
por: Desfontaines Damien, et al.
Publicado: (2022) -
Multiparty Reach and Frequency Histogram: Private, Secure, and Practical
por: Ghazi Badih, et al.
Publicado: (2022) -
The Effectiveness of Adaptation Methods in Improving User Engagement and Privacy Protection on Social Network Sites
por: Namara Moses, et al.
Publicado: (2022) -
Toward Uncensorable, Anonymous and Private Access Over Satoshi Blockchains
por: Recabarren Ruben, et al.
Publicado: (2022) -
Polaris: Transparent Succinct Zero-Knowledge Arguments for R1CS with Efficient Verifier
por: Fu Shihui, et al.
Publicado: (2022)