Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Jaron Skovsted Gundersen"'
Autor:
Qiongxiu Li, Jaron Skovsted Gundersen, Katrine Tjell, Rafal Wisniewski, Mads Grasboll Christensen
Publikováno v:
Li, Q, Gundersen, J S, Tjell, K, Wisniewski, R & Christensen, M G 2022, Privacy-preserving distributed expectation maximization for gaussian mixture model using subspace perturbation . in 2022 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2022-Proceedings . IEEE Signal Processing Society, ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing-Proceedings, vol. 2022-May, pp. 4263-4267, 47th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2022, Virtual, Online, Singapore, 23/05/2022 . https://doi.org/10.1109/ICASSP43922.2022.9746144
Privacy has become a major concern in machine learning. In fact, the federated learning is motivated by the privacy concern as it does not allow to transmit the private data but only intermediate updates. However, federated learning does not always g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c78d4c722a189f427da1cc594b51c7a5
Publikováno v:
Li, Q, Gundersen, J S, Heusdens, R & Christensen, M G 2021, ' Privacy-Preserving Distributed Processing: Metrics, Bounds and Algorithms ', I E E E Transactions on Information Forensics and Security, vol. 16, 9316966, pp. 2090-2103 . https://doi.org/10.1109/TIFS.2021.3050064
IEEE Transactions on Information Forensics and Security, 16
IEEE Transactions on Information Forensics and Security, 16
Privacy-preserving distributed processing has recently attracted considerable attention. It aims to design solutions for conducting signal processing tasks over networks in a decentralized fashion without violating privacy. Many algorithms can be ado
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::309460a85dda8efb73b9bc3e7456e55c
Publikováno v:
Theory of Cryptography ISBN: 9783030643775
TCC (2)
TCC (2)
We present a new secure multiparty computation protocol in the preprocessing model that allows for the evaluation of a number of instances of a boolean circuit in parallel, with a small online communication complexity per instance of 10 bits per part
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::09ceb65e8c642b02b3156c700bad0b7c
https://doi.org/10.1007/978-3-030-64378-2_23
https://doi.org/10.1007/978-3-030-64378-2_23
Publikováno v:
UVaDOC. Repositorio Documental de la Universidad de Valladolid
instname
Cascudo, I, Gundersen, J S & Ruano, D 2019, ' Improved Bounds on the Threshold Gap in Ramp Secret Sharing ', I E E E Transactions on Information Theory, vol. 65, no. 7, 8654006, pp. 4620-4633 . https://doi.org/10.1109/TIT.2019.2902151
instname
Cascudo, I, Gundersen, J S & Ruano, D 2019, ' Improved Bounds on the Threshold Gap in Ramp Secret Sharing ', I E E E Transactions on Information Theory, vol. 65, no. 7, 8654006, pp. 4620-4633 . https://doi.org/10.1109/TIT.2019.2902151
Producción Científica
In this paper we consider linear secret sharing schemes over a finite field Fq, where the secret is a vector in Fℓq and each of the n shares is a single element of Fq. We obtain lower bounds on the so-called threshold g
In this paper we consider linear secret sharing schemes over a finite field Fq, where the secret is a vector in Fℓq and each of the n shares is a single element of Fq. We obtain lower bounds on the so-called threshold g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e1312a43097c146ca8ab6dea41d59237
http://uvadoc.uva.es/handle/10324/35988
http://uvadoc.uva.es/handle/10324/35988
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319981123
SCN
SCN
We consider recent constructions of 1-out-of-N OT-extension from Kolesnikov and Kumaresan (CRYPTO 2013) and from Orru et al. (CT-RSA 2017), based on binary error-correcting codes. We generalize their constructions such that q-ary codes can be used fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9dce32d951df823cba665019bee49e9c
https://doi.org/10.1007/978-3-319-98113-0_18
https://doi.org/10.1007/978-3-319-98113-0_18
Publikováno v:
Aalborg University
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::5ee6ac4badfcfb38e86863c8fe5ebc63
https://vbn.aau.dk/en/publications/6dd4552b-e8cf-409d-99c3-efa5aa6efb24
https://vbn.aau.dk/en/publications/6dd4552b-e8cf-409d-99c3-efa5aa6efb24