Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Ulrich Kühne

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Karine Heydemann

> Home > Persons > Ulrich Kühne

Publications

2020
[c38]
- view
  authority control:
- export record
  dblp key:
  - conf/cosade/DangerFGHKSTP20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cosade/DangerFGHKSTP20
Jean-Luc Danger, Adrien Facon, Sylvain Guilley, Karine Heydemann, Ulrich Kühne, Abdelmalek Si-Merabet, Michaël Timbert, Baptiste Pecatte:
Processor Anchor to Increase the Robustness Against Fault Injection and Cyber Attacks. COSADE 2020: 254-274
2019
[e4]
- view
- export record
  dblp key:
  - conf/proofs/2019
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/proofs/2019
Karine Heydemann, Ulrich Kühne, Letitia Li:
Proceedings of 8th International Workshop on Security Proofs for Embedded Systems, PROOFS 2019, colocated with CHES 2018, Atlanta, GA, USA, August 24, 2019. Kalpa Publications in Computing 11, EasyChair 2019 [contents]
2018
[c35]
- view
  authority control:
- export record
  dblp key:
  - conf/dsd/DangerFGHKMT18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/dsd/DangerFGHKMT18
Jean-Luc Danger, Adrien Facon, Sylvain Guilley, Karine Heydemann, Ulrich Kühne, Abdelmalek Si-Merabet, Michaël Timbert:
CCFI-Cache: A Transparent and Flexible Hardware Protection for Code and Control-Flow Integrity. DSD 2018: 529-536

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.