Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Martim Francisco

dblp:397/3341 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2024
—ORCID · none

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

Computer networks · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Software-defined and programmable networks · 77% Internet architecture and protocols · 23%
Network and information security
1 paper
Cryptographic primitives and cryptanalysis · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software-defined and programmable networks
programmable data plane
0.812024
P4chaskey: an Efficient Mac Algorithm for Pisa Switches · ICNP 2024
Cryptographic primitives and cryptanalysis
message authentication codes
0.812024
P4chaskey: an Efficient Mac Algorithm for Pisa Switches · ICNP 2024
Internet architecture and protocols
network security
0.212024
P4chaskey: an Efficient Mac Algorithm for Pisa Switches · ICNP 2024

Methods — techniques the papers use, named apart from their topics

p4 language · 1.5chaskey algorithm · 1.5
YearPublicationVenuePosition
2024 P4chaskey: an Efficient Mac Algorithm for Pisa Switches
abstract
Cryptographic primitives are of paramount importance to guarantee security properties in communication networks. The associated computational complexity of cryptography standards makes it prohibitive to execute these primitives at line rate in the network core. Existing implementations of cryptographic MAC algorithms in$\mathbf{P 4}$for programmable switches impose a severe performance penalty due to packet recirculation, which may not be tolerable at those network speeds. In this paper, we propose the first data plane design in$\mathbf{P 4}$of the Chaskey algorithm, a widely used secure and lightweight cryptographic MAC algorithm, tailored for the PISA switch architecture. Our P4Chaskey is the first solution to compute MACs using 128-bit keys without packet recirculation, guaranteeing line rate Terabit speeds. As state-of-the-art solutions require recirculations for the same key size (reducing throughput performance) or offer weaker security (smaller keys), P4CHASKEY is now, to our knowledge, the most efficient MAC design for the target switch architecture.
Martim Francisco, Bernardo Ferreira, Fernando M. V. Ramos, Eduard Marin, Salvatore Signorello
ICNP1