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.

Alain Pannetrat

dblp:41/2102 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 2013
—ORCID · none

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

Security and privacy · 3 · 1 first-authorComputer networks · 1 · 1 first-author

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.

Network and information security
2 papers
Network security · 60% Cryptographic protocols and secure computation · 22% Authentication and access control · 11%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › key management › key distribution
group key distribution
0.011999
Scalable Multicast Security in Dynamic Groups · CCS 1999
Network security › secure communication › secure group communication
secure multicast
0.011999
Scalable Multicast Security in Dynamic Groups · CCS 1999
Authentication and access control › authentication
message authentication
0.012003
Efficient Multicast Packet Authentication · NDSS 2003
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption
elgamal encryption
0.011999
Scalable Multicast Security in Dynamic Groups · CCS 1999

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

authentication · 0.0multi-exponent RSA · 0.0elgamal encryption · 0.0
YearPublicationVenuePosition
2013 Mutant Apples: A Critical Examination of Cloud SLA Availability Definitions
abstract
The paper examines the challenges of defining and measuring availability to support real-word service comparison and dispute resolution through SLAs. We propose a rigorous and unambiguous definition of availability in cloud services. In the light of this, we show that what appear to be apples-for-apples comparisons between real-world SLAs are often based on ambiguous definitions, and even where SLAs are well defined, they differ significantly in their interpretation of availability. We show how two example real-world SLAs, would lead one service provider to report 0% availability while another would report 100% for the same system state history. On the basis of this, the paper concludes by arguing for the importance of standardising availability definitions and examines which elements need to be standardised and, just as importantly, which do not. Many of the results of this paper can be generalised to service level attributes other than availability: in general, such standard service definitions are a key element of a true commodity market in cloud resources, allowing service comparability before purchase, redress in the case of failure to deliver expected value and enhancing accountability in the supply chain.
Giles Hogben, Alain Pannetrat
CloudCom (1)2
2003 Efficient Multicast Packet Authentication
Alain Pannetrat, Refik Molva
NDSS1
2002 Authenticating real time packet streams and multicasts
abstract
We propose a new stream authentication scheme that is suitable for live packet streams distributed over a lossy channel, such as an IP-multicast group. Packets are signed together in a block and the recipient can authenticate this block if the loss rate per block is lower than a certain threshold, which can be chosen based on the characteristic of the communication channel. This scheme provides both integrity and non repudiation of origin, and in a majority of situations, it performs with less overhead in bytes per packet than previously proposed practical live stream authentication schemes.
Alain Pannetrat, Refik Molva
ISCC1
2000 Scalable multicast security with dynamic recipient groups
abstract
In this article we propose a new framework for multicast security based on distributed computation of security transforms by intermediate nodes. The involvement of intermediate nodes in the security process causes a new type of dependency between group membership and the topology of the multicast network. Thanks to this dependency, the containment of security exposures in large multicast groups is ensured. The framework also ensures both the scalability for large dynamic groups and the security of individual members. Two different key distribution protocols complying with the framework are introduced: an extension of the EIGamal encryption scheme, and one based on a multiexponent version of RSA.
Refik Molva, Alain Pannetrat
ACM Trans. Inf. Syst. Secur.2
1999 Scalable Multicast Security in Dynamic Groups
abstract
In this paper we propose a new framework for multicast security based on distributed computation of security transforms by intermediate nodes. The involvement of intermediate nodes in the security process causes a new type of dependency between group membership and the topology of the multicast network. Thanks to this dependency, the containment of security exposures in large multicast groups is assured. The framework also assures both the scalability for large dynamic groups and the security of individual members. Two different key distribution protocols complying with the framework are introduced. The first protocol is an extension of the El Gamal encryption scheme whereas the second is based on a multi-exponent version of RSA.
Refik Molva, Alain Pannetrat
CCS2