Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Abspoel, Mark"'
Autor:
Attema, Thomas, Mancini, Emiliano, Spini, Gabriele, Abspoel, Mark, de Gier, Jan, Fehr, Serge, Veugen, Thijs, van Heesch, Maran, Worm, Daniël, De Luca, Andrea, Cramer, Ronald, Sloot, Peter M. A.
Background: Clinical decision support systems (CDSS) are a category of health information technologies that can assist clinicians to choose optimal treatments. These support systems are based on clinical trials and expert knowledge; however, the amou
Externí odkaz:
http://arxiv.org/abs/1810.01107
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030920746
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – ASIACRYPT 2021
ASIACRYPT 2021
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – ASIACRYPT 2021
ASIACRYPT 2021
In 2016, Guruswami and Wootters showed Shamir’s secret-sharing scheme defined over an extension field has a regenerating property. Namely, we can compress each share to an element of the base field by applying a linear form, such that the secret is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a2d9b1fe7980fc18e93c69b03c9c348f
https://doi.org/10.1007/978-3-030-92075-3_8
https://doi.org/10.1007/978-3-030-92075-3_8
Autor:
Abspoel, Mark, Cramer, Ronald, Damgård, Ivan, Escudero, Daniel, Rambaud, Matthieu, Xing, Chaoping, Yuan, Chen
Publikováno v:
Abspoel, M, Cramer, R, Damgård, I, Escudero, D, Rambaud, M, Xing, C & Yuan, C 2020, Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over Z/pkZ . in S Moriai & H Wang (eds), Advances in Cryptology – ASIACRYPT 2020 . vol. III, Springer, Cham, Lecture Notes in Computer Science, vol. 12493, pp. 151-180, 26th International Conference on the Theory and Application of Cryptology and Information Security, Daejeon, Korea, Republic of, 07/12/2020 . https://doi.org/10.1007/978-3-030-64840-4_6
We study information-theoretic multiparty computation (MPC) protocols over rings Z/ pkZ that have good asymptotic communication complexity for a large number of players. An important ingredient for such protocols is arithmetic secret sharing, i.e., l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::f87cc9bb8d27aac075c8f3f05afbbe02
https://ir.cwi.nl/pub/30433
https://ir.cwi.nl/pub/30433
Autor:
Abspoel, Mark, Cramer, Ronald, Damgård, Ivan, Escudero, Daniel, Rambaud, Matthieu, Xing, Chaoping, Yuan, Chen
Publikováno v:
Abspoel, M, Cramer, R, Damgård, I, Escudero, D, Rambaud, M, Xing, C & Yuan, C 2020, ' Asymptotically Good Multiplicative LSSS over Galois Rings and Applications to MPC over textdollartextbackslashmathbb Z/pktextbackslashmathbb Z textdollar ', Lecture Notes in Computer Science, bind 12493, s. 151-180 .
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=pure_au_____::8ec321e391f8a0c17260043780a805e4
https://pure.au.dk/portal/da/publications/asymptotically-good-multiplicative-lsss-over-galois-rings-and-applications-to-mpc-over-textdollartextbackslashmathbb-zpktextbackslashmathbb-z-textdollar(42167403-4014-468e-b7b3-a97306abce6f).html
https://pure.au.dk/portal/da/publications/asymptotically-good-multiplicative-lsss-over-galois-rings-and-applications-to-mpc-over-textdollartextbackslashmathbb-zpktextbackslashmathbb-z-textdollar(42167403-4014-468e-b7b3-a97306abce6f).html
At CRYPTO 2018, Cramer et al. introduced a secret-sharing based protocol called SPD2k that allows for secure multiparty computation (MPC) in the dishonest majority setting over the ring of integers modulo 2k, thus solving a long-standing open questio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::d17801e3a0358ba0baa5f358d60447b8
https://ir.cwi.nl/pub/29216
https://ir.cwi.nl/pub/29216
Publikováno v:
Topics in Cryptology – CT-RSA 2019 ISBN: 9783030126117
CT-RSA
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Topics in Cryptology – CT-RSA 2019
Topics in Cryptology – CT-RSA 2019-The Cryptographers’ Track at the RSA Conference 2019, Proceedings, 453-472
STARTPAGE=453;ENDPAGE=472;TITLE=Topics in Cryptology – CT-RSA 2019-The Cryptographers’ Track at the RSA Conference 2019, Proceedings
Topics in Cryptology – CT-RSA 2019-The Cryptographers' Track at the RSA Conference 2019, San Francisco, CA, USA, March 4–8, 2019, Proceedings
CT-RSA
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Topics in Cryptology – CT-RSA 2019
Topics in Cryptology – CT-RSA 2019-The Cryptographers’ Track at the RSA Conference 2019, Proceedings, 453-472
STARTPAGE=453;ENDPAGE=472;TITLE=Topics in Cryptology – CT-RSA 2019-The Cryptographers’ Track at the RSA Conference 2019, Proceedings
Topics in Cryptology – CT-RSA 2019-The Cryptographers' Track at the RSA Conference 2019, San Francisco, CA, USA, March 4–8, 2019, Proceedings
In 1994, Feige, Kilian, and Naor proposed a simple protocol for secure 3-way comparison of integers a and b from the range [0, 2]. Their observation is that for (Formula Presented), the Legendre symbol (Formula Presented) coincides with the sign of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::66bb041b629c3d65632441b3216d4fbf
https://doi.org/10.1007/978-3-030-12612-4_23
https://doi.org/10.1007/978-3-030-12612-4_23
Autor:
Abspoel, Mark, Cramer, Ronald, Damgård, Ivan Bjerre, Escudero Ospina, Daniel Esteban, Yuan, Chen
Publikováno v:
Abspoel, M, Cramer, R, Damgård, I B, Escudero Ospina, D E & Yuan, C 2019, Efficient Information-Theoretic Secure Multiparty Computation over Z/p^k Z via Galois Rings . in D Hofheinz & A Rosen (eds), Theory of Cryptography : Proceedings . vol. Part 1, Springer, Cham, Lecture Notes in Computer Science, vol. 11891, pp. 471-501, Theory of Cryptography Conference, 17th International Conference, Nurnberg, Germany, 01/12/2019 . https://doi.org/10.1007/978-3-030-36030-6_19
At CRYPTO 2018, Cramer et al. introduced a secret-sharing based protocol called SPDZ2k that allows for secure multiparty computation (MPC) in the dishonest majority setting over the ring of integers modulo 2^k, thus solving a long-standing open quest
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::dfe7a12d5dcead9ec178243cd99949bc
https://pure.au.dk/ws/files/173212221/2019_872.pdf
https://pure.au.dk/ws/files/173212221/2019_872.pdf
Autor:
Gabriele Spini, Emiliano Mancini, Thomas Attema, Mark Abspoel, Jan de Gier, Serge Fehr, Thijs Veugen, Maran van Heesch, Daniël Worm, Andrea De Luca, Ronald Cramer, Peter M.A. Sloot
Publikováno v:
Journal of Medical Systems, 46(12):84. SPRINGER
Journal of Medical Systems, 46(12), 84.1-84.11
Journal of Medical Systems, 46(12), 84.1-84.11
Background HIV treatment prescription is a complex process. Clinical decision support systems (CDSS) are a category of health information technologies that can assist clinicians to choose optimal treatments based on clinical trials and expert knowled