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

Hiroshi Isozaki

dblp:87/2852 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0003-1514-1351ORCID · corroborated

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

Systems, architecture and hardware · 2Theory of computation · 1 · 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.

Network and information security
1 paper
Systems and software security · 56% Hardware security and side channels · 44%

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

TopicWeightPapersLastEvidence papers
Systems and software security › trusted computing
TCB minimization
0.112008
Flicker: an execution infrastructure for tcb minimization · EuroSys 2008
Hardware security and side channels
trusted execution environments
0.112008
Flicker: an execution infrastructure for tcb minimization · EuroSys 2008
Systems and software security › trusted computing
software attestation
0.012008
Flicker: an execution infrastructure for tcb minimization · EuroSys 2008

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

processor security extensions · 0.1
YearPublicationVenuePosition
2023 Inverse Problems for Discrete Heat Equations and Random Walks for a Class of Graphs
abstract
Abstract. We study the inverse problem of determining a finite weighted graph [Formula: see text] from the source-to-solution map on a vertex subset [Formula: see text] for heat equations on graphs, where the time variable can be either discrete or continuous. We prove that this problem is equivalent to the discrete version of the inverse interior spectral problem, provided that there does not exist a nonzero eigenfunction of the weighted graph Laplacian vanishing identically on [Formula: see text]. In particular, we consider inverse problems for discrete-time random walks on finite graphs. We show that under a novel geometric condition (called the Two-Points Condition), the graph structure and the transition matrix of the random walk can be uniquely recovered from the distributions of the first passing times on [Formula: see text], or from the observation on [Formula: see text] of one realization of the random walk.
Emilia L. K. Blåsten, Hiroshi Isozaki, Matti Lassas, Jinpeng Lu
SIAM J. Discret. Math.2
2018 Inkpack: A Secure, Data-Exposure Resistant Storage System
abstract
Removing hard drives from a data center may expose sensitive data, such as encryption keys or passwords. To prevent exposure, data centers have security policies in place to physically secure drives in the system, and securely delete data from drives that are removed. Despite advances in security technology and best practices, implementation of these security measures is often done incorrectly. We anticipate that physical security will fail, and fixing the issue after the failure is costly and ineffective.
Oceane Bel, Kenneth Chang, Daniel Bittman, Darrell D. E. Long, Hiroshi Isozaki, Ethan L. Miller
SYSTOR5
2008 Flicker: an execution infrastructure for tcb minimization
abstract
We present Flicker, an infrastructure for executing security-sensitive code in complete isolation while trusting as few as 250 lines of additional code. Flicker can also provide meaningful, fine-grained attestation of the code executed (as well as its inputs and outputs) to a remote party. Flicker guarantees these properties even if the BIOS, OS and DMA-enabled devices are all malicious. Flicker leverages new commodity processors from AMD and Intel and does not require a new OS or VMM. We demonstrate a full implementation of Flicker on an AMD platform and describe our development environment for simplifying the construction of Flicker-enabled code.
Jonathan M. McCune, Bryan Parno, Adrian Perrig, Michael K. Reiter, Hiroshi Isozaki
EuroSys5