Department of Complexity Science and Engineering, Graduate School of Frontier Sciences, The University of Tokyo

List of Papers

1. M. Iwamoto, H.Koga, H.Yamamoto, "Coding theorems for a (2,2)-threshold scheme with detectability of impersonation attacks," IEEE Trans. on Infrom. Theory, vol.58, No.9, pp.6194-6206, Sept. 2012
2. M.Iwamoto, H.Yamamoto, and H. Ogawa, "Optimal multiple assignments based on integer programming in secret sharing with general access structures," IEICE Trans. on Fundamentals, vol.E90-A, no.1, pp.101-112, Jan. 2007
3. M.Iwamoto and H.Yamamoto, "Strongly Secure Ramp Secret Sharing Schemes for General Access Structures," Information Processing Letters, vol.97, issue 2, pp.52-57, Jan. 2006
4. H.Yamamoto, "Coding theorem for secret sharing communication systems with two Gaussian wiretap channels", IEEE Trans. on Inform. Theory, vol.37, no.3, pp.634-638, Sep. 1991
5. H.Yamamoto, "Coding theorem for secret sharing communication systems with two noisy channels", IEEE Trans. on Inform. Theory, vol.35, no.3, pp.572-578, May 1989
6. H.Yamamoto, "On secret sharing communication systems with two or three channels", IEEE Trans. on Inform. Theory, vol.IT-32, no.3, pp.387-393, May 1986
7. H.Yamamoto, " "Secret sharing system using (k,L,n) threshold scheme (in Japanese)", Trans. of the IECE of Japan, vol.J68-A, no.9, pp.945-952, Sep. 1985, [English translation : Electronics and Communications in Japan, Part I, vol.69, no.9, pp.46-54, (Scripta Technica, Inc.), Sep. 1986]