Manuela Flores

dblp:204/4013 · DBLP profile ↗
← Back
9ranked-venue papers
0as first author
8since 2021 · last 2026
0000-0001-5676-6900ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 5 · 5 since 2021Security and privacy · 3 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
YearPublicationVenuePosition
2026 Anonymous Hierarchical Key Assignment Schemes
Roberta Cimorelli Belfiore, Alfredo De Santis, Anna Lisa Ferrara, Manuela Flores, Barbara Masucci
DBSec4
2026 Transformations between Minimally f-free Words
Marcella Anselmo, Giusi Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, Sabrina Mantaci
DLT3
2025 A Family of Partial Cubes with Minimal Fibonacci Dimension
Marcella Anselmo, Giusi Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, Sabrina Mantaci
CPM3
2025 Density of k-ary words with 0, 1, 2 - error overlaps
Marcella Anselmo, Manuela Flores, Maria Madonia
Theor. Comput. Sci.2
2024 Isometric Sets of Words and Generalizations of the Fibonacci Cubes
Marcella Anselmo, Giusi Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, Sabrina Mantaci
CiE3
2024 Provably-Secure One-Message Unilateral Entity Authentication Schemes
abstract
Aone-message unilateral entity authentication schemeallows one party, called theprover, to authenticate himself, i.e., to prove his identity, to another party, called theverifier, by sending a singleauthentication message. We consider schemes where the prover and the verifier do not share any secret information, such as a password, in advance. We propose thefirst theoretical characterizationfor one-message unilateral entity authentication schemes, by formalizing the security requirements for such schemes with respect to different kinds ofpassiveandactiveadversarial behaviours. In particular, we consider bothstaticandadaptiveadversaries for each kind of attack (passive/active). Afterwards, we explore the relationships between the security notions resulting from different adversarial behaviours for one-message unilateral entity authentication schemes. Finally, we propose three different constructions for one-message unilateral entity authentication schemes and we analyze their security with respect to the different definitions introduced in this paper.
Alfredo De Santis, Anna Lisa Ferrara, Manuela Flores, Barbara Masucci
IEEE Trans. Dependable Secur. Comput.3
2023 Isometric Words Based on Swap and Mismatch Distance
Marcella Anselmo, Giusi Castiglione, Manuela Flores, Dora Giammarresi, Maria Madonia, Sabrina Mantaci
DLT3
2022 On k-ary n-cubes and isometric words
Marcella Anselmo, Manuela Flores, Maria Madonia
Theor. Comput. Sci.2
2017 One-Message Unilateral Entity Authentication Schemes
abstract
A one-message unilateral entity authentication scheme allows one party, called the prover, to authenticate himself, i.e., to prove his identity, to another party, called the verifier, by sending a single authentication message.
Alfredo De Santis, Manuela Flores, Barbara Masucci
ARES2