UNCOVER: Development of an efficient steganalysis framework for uncovering hidden data in digital media

Autor: Vaila Leask, Rémi Cogranne, Dirk Borghys, Helena Bruyninckx

Publikováno v: 17th International Conference on Availability, Reliability and Security (ARES 2022)
17th International Conference on Availability, Reliability and Security (ARES 2022), Aug 2022, Vienna, Austria
Proceedings of the 17th International Conference on Availability, Reliability and Security

International audience; This paper presents the general goals of Horizon 2020 project UNCOVER , whose overall purpose is to close the gap between academic work and operational needs in the fields of data-hiding. While digital data-hiding is a relativ

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::88fc5984f73154de4460867ed3435dfc
https://doi.org/10.1145/3538969.3544468

Equivalence of QN–LS and BQN–LS for affine problems

Autor: Ben Lauwens, Julien Petit, Helena Bruyninckx, Robby Haelterman

Publikováno v: Journal of Computational and Applied Mathematics. 278:48-51

Previously, we studied methods to solve the coupled system of non-linear equations F ( g ) = p and S ( p ) = g . In this paper we take a closer look at two of them, the Quasi-Newton method with Least Squares Jacobian (QN-LS) and the Block Quasi-Newto

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::7df34de1ad480b937cd4c338a2b45b94
https://doi.org/10.1016/j.cam.2014.09.025

On the non-singularity of the quasi-Newton-least squares method

Autor: Julien Petit, Rob Haelterman, Helena Bruyninckx, Ben Lauwens, Jan Vierendeels

Publikováno v: Journal of Computational and Applied Mathematics. 257:129-131

We show that, for an affine problem, the approximate Jacobian of the Quasi-Newton-Least Squares method cannot become singular before the solution has been reached.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::da8a862faf59878d947031294c18ec5f
https://doi.org/10.1016/j.cam.2013.08.020

Safe cryptographic random number generation using untrusted generators

Autor: Helena Bruyninckx, Frédéric Lafitte, Dirk Van Heule

Publikováno v: ICC

The security of many cryptographic applications relies heavily on the quality of the random numbers used. Therefore, random number generation is one of the most critical primitives for cryptography. This paper focuses on true random number generators

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::d73e8cf9644683c4ebd273f8a918bef1
https://doi.org/10.1109/icc.2014.6883406