Optimal Multiple Assignments Based on Integer Programming in Secret Sharing Schemes with General Access Structures(Protocols,<Special Section>Cryptography and Information Security)

スポンサーリンク

概要

• 論文の詳細を見る

• It is known that for any general access structure, a secret sharing scheme (SSS) can be constructed from an (m,m)-threshold scheme by using the so-called cumulative map or from a (t,m)-threshold SSS by a modified cumulative map. However, such constructed SSSs are not efficient generally. In this paper, a new method is proposed to construct a SSS from a (t,m)-threshold scheme for any given general access structure. In the proposed method, integer programming is used to derive the optimal (t,m)-threshold scheme and the optimal distribution of the shares to minimize the average or maximum size of the distributed shares to participants. From the optimality, it can always attain lower coding rate than the cumulative maps because the cumulative maps cannot attain the optimal distribution in many cases. The same method is also applied to construct SSSs for incomplete access structures and/or ramp access structures.

• 社団法人電子情報通信学会の論文
• 2007-01-01

著者

• Ogawa Hirohisa

  C4 Technology Inc.

• Yamamoto Hirosuke

  Graduate School Of Frontier Sciences University Of Tokyo

• Yamamoto Hirosuke

  Graduate School Of Engineering The University Of Tokyo

• IWAMOTO Mitsugu

  Graduate School of Information Systems, University of Electro-Communications

• Iwamoto Mitsugu

  Graduate School Of Information Systems University Of Electro-communications

関連論文

• Coding Theorems for Secret-Key Authentication Systems
• Optimal Multiple Assignments Based on Integer Programming in Secret Sharing Schemes with General Access Structures(Protocols,Cryptography and Information Security)
• Visual Secret Sharing Schemes for Multiple Secret Images Allowing the Rotation of Shares(Discrete Mathematics and Its Applications)

スポンサーリンク