Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Kazuo Sakiyama

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 Yuichi Komano

> Home > Persons > Kazuo Sakiyama

Publications

2022
[c79]
- view
  authority control:
- export record
  dblp key:
  - conf/secitc/KomanoIOS22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/secitc/KomanoIOS22
Yuichi Komano, Mitsugu Iwamoto, Kazuo Ohta, Kazuo Sakiyama:
Lightweight Authentication Using Noisy Key Derived from Physically Unclonable Function. SecITC 2022: 203-221
2019
[j29]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/scn/KomanoOSIV19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/scn/KomanoOSIV19
Yuichi Komano, Kazuo Ohta, Kazuo Sakiyama, Mitsugu Iwamoto, Ingrid Verbauwhede:
Single-Round Pattern Matching Key Generation Using Physically Unclonable Function. Secur. Commun. Networks 2019: 1719585:1-1719585:13 (2019)
2009
[c22]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/icics/LiSKKO09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icics/LiSKKO09
Yang Li, Kazuo Sakiyama, Shin-ichi Kawamura, Yuichi Komano, Kazuo Ohta:
Security Evaluation of a DPA-Resistant S-Box Based on the Fourier Transform. ICICS 2009: 3-16

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.