2 citations · 2 across the 4 of their papers we have counts for
4 papers
Compositional Synthesis of Leakage Resilient Programs
Arthur Blot, Masaki Yamamoto, Tachio Terauchi
A promising approach to defend against side channel attacks is to build programs that are leakage resilient, in a formal sense. One such formal notion of leakage resilience is the…
Linear Programming Relaxations for Goldreich's Generators over Non-Binary Alphabets
Ryuhei Mori, Takeshi Koshiba, Osamu Watanabe +1
Goldreich suggested candidates of one-way functions and pseudorandom generators included in . It is known that randomly generated Goldreich's generator using …
Derandomizing HSSW Algorithm for 3-SAT
Kazuhisa Makino, Suguru Tamaki, Masaki Yamamoto
We present a (full) derandomization of HSSW algorithm for 3-SAT, proposed by Hofmeister, Schöning, Schuler, and Watanabe in [STACS'02]. Thereby, we obtain an O(1.3303^n)-time deter…
An Improved Exact Algorithm for the Domatic Number Problem
Tobias Riege, Jörg Rothe, Holger Spakowski +1
The 3-domatic number problem asks whether a given graph can be partitioned intothree dominating sets. We prove that this problem can be solved by a deterministic algorithm in time…