Improvement on the Cheater Identifiable Threshold Scheme(Special Section on Fundamentals of Information and Communications)

スポンサーリンク

概要

• 論文の詳細を見る

• Kurosawa, Obana, and Ogata proposed a (k, n) threshold scheme such that t cheaters can be identified, where t?(k-1)/3. Their scheme is superior to previous schemes with respect to the number of participants for identifying cheaters and the size of a share. In this paper, we improve the detectability of their scheme. By using erasure decoding and the authentication code, we show that cheaters less than k/2 can be identified. Although the size of a share is larger than that of their scheme, it is independent of n.

• 一般社団法人電子情報通信学会の論文
• 2001-04-01

著者

• TANAKA Hatsukazu

  the Faculty of Engineering, Kobe University

• Kuwakado Hidenori

  The Faculty Of Engineering Kobe University

• Tanaka Hatsukazu

  The Faculty Of Engineering Kobe University

関連論文

• Efficient Relative Time-Stamping Scheme Based on the Ternary Link(Information Security)(Information Theory and Its Applications)
• Message Authentication for Stream(Special Section on Cryptography and Information Security)
• A New Digital Watermarking Scheme Applying Locally the Wavelet Transform
• A Code Construction for M-Choose-T Communication over the Multiple-Access Adder Channel
• Equivalent Keys in RC6-32/20/176(Special Section on Information Theory and Its Applications)
• Improvement on the Cheater Identifiable Threshold Scheme(Special Section on Fundamentals of Information and Communications)
• New Algorithm for Finding Preimages in a Reduced Version of the MD4 Compression Function(Special Section on Cryptography and Information Security)

スポンサーリンク