A Holistic Approach to Enhanced Security and Privacy in Digital Health Passports

Autor: Frederiksen, Tore Kasper

As governments around the world decide to deploy digital health passports as a tool to curb the spread of Covid-19, it becomes increasingly important to consider how these can be constructed with privacy-by-design. In this paper we discuss the privac

Externí odkaz: http://arxiv.org/abs/2105.13910

Committed MPC:Maliciously Secure Multiparty Computation from Homomorphic Commitments

Autor: Frederiksen, Tore Kasper, Pinkas, Benny, Yanai, Avishai

Publikováno v: Frederiksen, T K, Pinkas, B & Yanai, A 2018, Committed MPC : Maliciously Secure Multiparty Computation from Homomorphic Commitments . in M Abdalla & R Dahab (eds), Public-Key Cryptography – PKC 2018 : 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Rio de Janeiro, Brazil, March 25-29, 2018, Proceedings, Part I . Springer, Lecture Notes in Computer Science, vol. 10769, pp. 587-619, 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, PKC 2018, Rio de Janeiro, Brazil, 25/03/2018 . https://doi.org/10.1007/978-3-319-76578-5_20

We present a new multiparty computation protocol secure against a static and malicious dishonest majority. Unlike most previous protocols that were based on working on MAC-ed secret shares, our approach is based on computations on homomorphic commitm

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=pure_au_____::1fdd07464df8e6098e640548c967aa80
https://pure.au.dk/portal/da/publications/committed-mpc(f1cae4d9-ed8c-4544-ac00-5335f43bc2b1).html

On the Complexity of Additively Homomorphic UC Commitments

Autor: Trifiletti, Roberto, Nielsen, Jesper Buus, Frederiksen, Tore Kasper, Jakobsen, Thomas P.

Publikováno v: Trifiletti, R, Nielsen, J B, Frederiksen, T K & Jakobsen, T P 2016, On the Complexity of Additively Homomorphic UC Commitments . in E Kushilevitz & T Malkin (eds), Theory of Cryptography-13th International Conference, TCC 2016-A . vol. 9562, Springer VS, Springer Berlin Heidelberg, Lecture Notes in Computer Science, vol. 9562, pp. 542-565, Theory of Cryptography Conference, Tel Aviv, Israel, 10/01/2016 . https://doi.org/10.1007/978-3-662-49096-9

We present a new constant round additively homomorphic commitment scheme with (amortized) computational and communication complexity linear in the size of the string committed to. Our scheme is based on the non-homomorphic commitment scheme of Cascud

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=pure_au_____::026c4e775673ed282fd0d8436c274416
https://pure.au.dk/portal/da/publications/on-the-complexity-of-additively-homomorphic-uc-commitments(98bd26e6-af3c-484b-a3f1-e1dc154c7aba).html

The Hitchhiker’s Guide to Garbled Circuits:Garbled Circuits and their Applications to Maliciously Secure Two-Party Protocols

Autor: Frederiksen, Tore Kasper

Publikováno v: Frederiksen, T K 2015, The Hitchhiker’s Guide to Garbled Circuits : Garbled Circuits and their Applications to Maliciously Secure Two-Party Protocols . Department of Computer Science, Aarhus University .

I de seneste par år er forkludrede kredsløb blevet hævet fra bare at være en komponent i Yao’s protokol til sikre to-parts beregninger, til at være et kryptografisk primitiv i sig selv. I denne afhandling videreudvikler vi området af forkludr

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::e887d3e17fe21835be0f28045f86a34e
https://pure.au.dk/portal/da/publications/the-hitchhikers-guide-to-garbled-circuits(b7809e91-947e-4dd9-94e6-6eac17068bc6).html

Faster Maliciously Secure Two-Party Computation Using the GPU

Autor: Frederiksen, Tore Kasper, Jakobsen, Thomas Pelle, Nielsen, Jesper Buus

Publikováno v: Frederiksen, T K, Jakobsen, T P & Nielsen, J B 2014, Faster Maliciously Secure Two-Party Computation Using the GPU . in M Abdalla & R D Prisco (eds), Security and Cryptography for Networks : 9th International Conference, SCN 2014, Amalfi, Italy, September 3-5, 2014. Proceedings . Springer, Lecture Notes in Computer Science, vol. 8642, pp. 358-379, Amalfi, Italy, 03/09/2014 . https://doi.org/10.1007/978-3-319-10879-7_21

To avoid data races, concurrent operations should either be at distinct times or on distinct data. Atomicity is the abstraction that an operation takes effect at a single, discrete instant in time, with linearisability being a well-known correctness

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=pure_au_____::f1935dd307093f051780c7f1d2d19262
https://pure.au.dk/portal/da/publications/faster-maliciously-secure-twoparty-computation-using-the-gpu(d7444e81-c0cd-4535-9f76-1cb11c53a54d).html