Heap . . . Hop! Heap Is Also Vulnerable

Abstract : Several logical attacks against Java based smart card have been published recently. Most of them are based on the hypothesis that the type verification was not performed, thus allowing to obtain dynamically a type confusion. To mitigate such attacks, typed stack have been introduced on recent smart card. We propose here a new attack path for performing a type confusion even in presence of a typed stack. Then we propose using a Fault Tree Analysis a way to design efficiently counter measure in a top down approach. These counter measures are then evaluated on a Java Card virtual machine
Type de document :
Communication dans un congrès
Cardis 2014, Nov 2014, Paris, France. Volume 8968 2015, Lecture Notes in Computer Science 〈10.1007/978-3-319-16763-3_2〉
Liste complète des métadonnées

Littérature citée [19 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01250610
Contributeur : Jean-Louis Lanet <>
Soumis le : mardi 5 janvier 2016 - 09:29:40
Dernière modification le : mercredi 16 mai 2018 - 11:24:11
Document(s) archivé(s) le : jeudi 7 avril 2016 - 14:59:06

Fichier

CardisHeapHop.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Guillaume Bouffard, Michael Lackner, Jean-Louis Lanet, Johannes Loinig. Heap . . . Hop! Heap Is Also Vulnerable. Cardis 2014, Nov 2014, Paris, France. Volume 8968 2015, Lecture Notes in Computer Science 〈10.1007/978-3-319-16763-3_2〉. 〈hal-01250610〉

Partager

Métriques

Consultations de la notice

248

Téléchargements de fichiers

108