1, 2, 3, Fork: Counter Mode Variants based on a Generalized Forkcipher

Autor: Elena Andreeva, Amit Singh Bhati, Bart Preneel, Damian Vizár

Publikováno v: IACR Transactions on Symmetric Cryptology, Vol 2021, Iss 3 (2021)

A multi-forkcipher (MFC) is a generalization of the forkcipher (FC) primitive introduced by Andreeva et al. at ASIACRYPT’19. An MFC is a tweakable cipher that computes s output blocks for a single input block, with s arbitrary but fixed. We define

Externí odkaz: https://doaj.org/article/feb215e729a54757b5fc9cd80e0f53bf

Linking Online Misuse-Resistant Authenticated Encryption and Blockwise Attack Models

Autor: Guillaume Endignoux, Damian Vizár

Publikováno v: IACR Transactions on Symmetric Cryptology, Pp 125-144 (2017)

Real-world applications of authenticated encryption often require the encryption to be computable online, e.g. to compute the ith block of ciphertext after having processed the first i blocks of plaintext. A significant line of research was dedicated

Externí odkaz: https://doaj.org/article/97c08c7de83f4e789a7b3065f512ce9d

Cryptanalysis of Enhanced More

Autor: Serge Vaudenay, Damian Vizár

Publikováno v: Tatra Mountains Mathematical Publications. 73:163-178

Fully homomorphic encryption (FHE) has been among the most popular research topics of the last decade. While the bootstrapping-based, public key cryptosystems that follow Gentry’s original design are getting more and more efficient, their performan

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::271d810de85a05b18ca076eb71a7dc79
https://doi.org/10.2478/tmmp-2019-0012

Forkcipher: A New Primitive for Authenticated Encryption of Very Short Messages

Autor: Reza Reyhanitabar, Antoon Purnal, Elena Andreeva, Arnab Roy, Virginie Lallemand, Damian Vizár

Publikováno v: ASIACRYPT 2019-25th Annual International Conference on the Theory and Application of Cryptology and Information Security
ASIACRYPT 2019-25th Annual International Conference on the Theory and Application of Cryptology and Information Security, Dec 2019, Kobe, Japan. pp.153-182, ⟨10.1007/978-3-030-34621-8_6⟩
Advances in Cryptology – ASIACRYPT 2019-25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8–12, 2019, Proceedings, Part II
Lecture Notes in Computer Science ISBN: 9783030346201
ASIACRYPT (2)
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Advances in Cryptology – ASIACRYPT 2019

Highly efficient encryption and authentication of short messages is an essential requirement for enabling security in constrained scenarios such as the CAN FD in automotive systems (max. message size 64 bytes), massive IoT, critical communication dom

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5947de08c9027c84428a0c2189a1909c
https://hal.inria.fr/hal-02388234/file/2019-1004_.pdf

Cryptanalysis of chosen symmetric homomorphic schemes

Autor: Serge Vaudenay, Damian Vizár

Publikováno v: Studia Scientiarum Mathematicarum Hungarica. 52:288-306

Since Gentry’s breakthrough result was introduced in the year 2009, the homomorphic encryption has become a very popular topic. The main contribution of Gentry’s thesis [5] was, that it has proven, that it actually is possible to design a fully h

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::35c79bd155b564960c819e55cb457f2c
https://doi.org/10.1556/012.2015.52.2.1311