You are here

Miao Ying

Researcher's full information

Articles
  • ID-based series-parallel multisignature schemes for multi-messages from bilinear maps
    L. Wang Z. Cao E. Okamoto Y. Miao and T. Okamoto
    The International Workshop on Coding and Cryptography – WCC’2005, Lecture Notes in Computer Science/3969/pp.291-303, 2006
  • Authorization-limited transformation-free proxy cryptosystems and their security analyses
    Wang LH; Cao ZF; Okamoto T; Miao Y; Okamoto E
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES/E89A(1)/pp.106-114, 2006-01
  • How to Verify the Threshold t of Shamir's (t, n)-Threshold Scheme(Security Infrastructure, Research on Computer Security Characterized in the Context of Social Responsibilities)
    TSO RAYLIN; MIAO YING; OKAMOTO TAKESHI; OKAMOTO EIJI
    Transactions of Information Processing Society of Japan/46(8)/pp.1824-1833, 2005-08
  • A Share-Correctable Protocol for the Shamir Threshold Scheme and Its Application to Participant Enrollment(Security Infrastructure, Research on Computer Security Characterized in the Context of Social Responsibilities)
    TSO RAYLIN; MIAO YING; OKAMOTO TAKESHI; OKAMOTO EIJI
    Transactions of Information Processing Society of Japan/46(8)/pp.1880-1888, 2005-08
  • Combinatorial constructions for optimal splitting authentication codes
    Ge GN; Miao Y; Wang LH
    SIAM JOURNAL ON DISCRETE MATHEMATICS/18(4)/pp.663-678, 2005-01
  • Optimal frequency hopping sequences: A combinatorial approach
    Fuji-Hara R; Y. Miao; Mishima M
    IEEE TRANSACTIONS ON INFORMATION THEORY/50(10)/pp.2408-2420, 2004-10
  • A new algorithm for searching a consistent set of shares in a threshold scheme with cheaters
    R. Tso Y. Miao and E. Okamoto
    Proceedings of the 6th Annual International Conference on Information Security and Cryptology – ICISC 2003, Lecture Notes in Computer Science/pp.377-385, 2004
  • Transformation-free proxy cryptosystems and their applications to electronic commerce
    L. Wang; Z. Cao; E. Okamoto; Y. Miao; T. Okamoto
    Proc. of 3rd International Conference on Information Security/p.92-98, 2004-01
  • Combinatorial constructions of optimal optical orthogonal codes with weight 4
    Y. Chang; R. Fuji-Hara; Y. Miao
    IEEE Transactions on Information Theory/49/p.1283-1292, 2003-03
  • A combinatorial characterization of regular anonymous perfect threshold schemes
    Y. Miao
    Information Processing Letters/85/p.131-135, 2003-01
  • Constructions for optimal optical orthogonal codes
    Y. Chang; Y. Miao
    Discrete Mathematics/261/p.127-139, 2003-01
  • A note on geometric structures of linear ordered orthogonal arrays and (T,M,S)-nets of low strength
    R. Fuji-Hara; Y. Miao
    Designs, Codes and Cryptography/26/p.257-263, 2002-06
  • General constructions for double group divisible designs and double frames
    Y. Chang; Y. Miao
    Designs, Codes and Cryptography/26/p.155-168, 2002-06
  • Complete sets of disjoint difference families and their applications
    R. Fuji-Hara; Y. Miao; S. Shinohara
    Journal of Statistical Planning and Inference/106/p.87-103, 2002-01
  • Frames with block size four and index three
    S. Furino; S. Kageyama; A. C. H. Ling; Y. Miao; J. Yin
    Journal of Statistical Planning and Inference/106/p.117-124, 2002-01
  • Balanced nested designs and n-ary designs
    R. Fuji-Hara; S. Kuriki; Y. Miao; S. Shinohara
    Journal of Statistical Planning and Inference/106/p.57-67, 2002-01
  • Balanced nested designs and balanced arrays
    R. Fuji-Hara; S. Kageyama; S. Kuriki; Y. Miao; S. Shinohara
    Discrete Mathematics/259/p.91-119, 2002-01
  • (C \oplus G,k,lambda) difference families
    C. Lam; Y. Miao
    Designs, Codes, and Cryptography/24/p.291-304, 2001-12
  • Resolvable BIBDs with block size 7 and index 6
    R. J. R. Abel; M. Greig; Y. Miao; L. Zhu
    Discrete Mathematics/226/p.1-20, 2001-01
  • Directed B(K,1;v) with K = {4,5} and {4,6} related to deletion/insertion-correcting codes
    R. Fuji-Hara; Y. Miao; J. Wang; J. Yin
    Journal of Combinatorial Designs/9/p.147-156, 2001-01
  • Cyclically resolvable cyclic Steiner 2-systems S(2,4,52)
    C. Lam; Y. Miao; M. Mishima
    Journal of Statistical Planning and Inference/95/p.245-256, 2001-01
  • Existence of nested designs with block size five
    S. Kageyama; Y. Miao
    Journal of Statistical Planning and Inference/94/p.249-254, 2001-01
  • Optimal (9v,4,1) optical orthogonal codes
    R. Fuji-Hara; Y. Miao; J. Yin
    SIAM Journal on Discrete Mathematics/14/p.256-266, 2001-01
  • Constructions for rotational near resolvable block designs
    R. J. R. Abel; M. Buratti; M. Greig; Y. Miao
    Journal of Combinatorial Designs/9/p.157-181, 2001-01
  • Optical orthogonal codes: their bounds and new optimal constructions
    R. Fuji-Hara; Y. Miao
    IEEE Transactions on Information Theory/46/p.2396-2406, 2000-11