Yusuke Kawamoto

Dr. Yusuke Kawamoto

orcid

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2012 in Lecture Notes in Computer Science
Verified
Book Chapter
Closed access
PDF file
RBRomain Bardou
Romain Bardou
RFRiccardo Focardi
Riccardo Focardi
YKYusuke Kawamoto
Yusuke Kawamoto
LSLorenzo Simionato
Lorenzo Simionato
GSGraham Steel
Graham Steel
JTJoe-Kai Tsay
Joe-Kai Tsay

1 January 2013
Verified
Book Chapter
Closed access
PDF file
TCTom Chothia
Tom Chothia
YKYusuke Kawamoto
Yusuke Kawamoto
CNChris Novakovic
Chris Novakovic

1 January 2014
Verified
Book Chapter
Closed access
PDF file
TCTom Chothia
Tom Chothia
YKYusuke Kawamoto
Yusuke Kawamoto
CNChris Novakovic
Chris Novakovic


1 June 2013
Verified
Conference Paper
Closed access
TCTom Chothia
Tom Chothia
YKYusuke Kawamoto
Yusuke Kawamoto
CNChris Novakovic
Chris Novakovic
DPDavid Parker
David Parker
The outputs of a program that processes secret data may reveal information about the values of these secrets. This paper develops an information leakage model that can measure the leakage between arbitrary points in a probabilistic program. Our aim is to create a model of information leakage that makes it convenient to measure specific leaks, and provide a tool that may be used to investigate a program's information security. To make our leakage model precise, we base our work on a simple probabilistic, imperative language in which secret values may be specified at any point in the program; other points in the program may then be marked as potential sites of information leakage. We extend our leakage model to address both non-terminating programs (with potentially infinite numbers of secret and observable values) and user input. Finally, we show how statistical approximation techniques can be used to estimate our leakage measure in real-world Java programs.

8 October 2018 in Formal Aspects of Computing
Verified
Journal Article
Open access
PDF file
FBFabrizio Biondi
Fabrizio Biondi
YKYusuke Kawamoto
Yusuke Kawamoto
ALAxel Legay
Axel Legay
LTLouis-Marie Traonouez
Louis-Marie Traonouez
Analysis of a probabilistic system often requires to learn the joint probability distribution of its random variables. The computation of the exact distribution is usually an exhaustiveprecise analysison all executions of the system. To avoid the high computational cost of such an exhaustive search,statistical analysishas been studied to efficiently obtain approximate estimates by analyzing only a small but representative subset of the system’s behavior. In this paper we propose ahybrid statistical estimation methodthat combines precise and statistical analyses to estimate mutual information, Shannon entropy, and conditional entropy, together with their confidence intervals. We show how to combine the analyses on different components of a discrete system with different accuracy to obtain an estimate for the whole system. The new method performs weighted statistical analysis with different sample sizes over different components and dynamically finds their optimal sample sizes. Moreover, it can reduce sample sizes by using prior knowledge about systems and a newabstraction-then-samplingtechnique based on qualitative analysis. To apply the method to the source code of a system, we show how to decompose the code into components and to determine the analysis method for each component by overviewing the implementation of those techniques in the HyLeak tool. We demonstrate with case studies that the new method outperforms the state of the art in quantifying information leakage.