Analysis on Secret Sharing Schemes with Non-Graphical Access Structures (Special Section on Cryptography and Information Security)

スポンサーリンク

概要

• 論文の詳細を見る

• Lower bounds on the size of shares |V_i| which are more tight than |V_i| ≧ |S|, where |S| is the size of the secret, are known only for some graphical access structures. This paper shows lower bounds on |V_i| greater than |S| for some non-graphical access structures Γ. We first prove that if {P_1, P_i}∈Γ^- for any P_i ∈P^^^ = {P_2, . . . , P_n} and Γ^^^ = 2^P^^^ ∩Γ is the access structure of a (k, n-1)-threshold scheme on P^^^, then max__i log|V_i| ≧ n+k-3/<n-1>log|s| for P_i ∈ {P_1, P_2, . . . , P_n}. Next, we show that max_i log|V_i| ≧1.5 log |S| holds for a wider class of access structures.

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

著者

• 黒沢 馨

  The Authors Are With The Department Of Communication And Integrated Systems Tokyo Institute Of Techn

• 黒沢 馨

  Tokyo Institute Of Technology

• OKADA Koji

  Faculty of Engineering, Tokyo Institute of Technology

• OGATA Wakaha

  Faculty of Engineering, Himeji Institute of Technology

• SAKANO Keiichi

  Matsushita Electric Industrial Co., LTD

• KUROSAWA Kaoru

  Faculty of Engineering, Tokyo Institute of Technology

• Okada K

  Faculty Of Engineering Tokyo Institute Of Technology

• Ogata Wakaha

  Department Of Computer Engineering Faculty Of Engineering Himeji Institute Of Technology

• Ogata Wakaha

  Faculty Of Engineering Tokyo Institute Of Technology

• Sakano Keiichi

  Matsushita Electric Industrial Co. Ltd

• Okada Koji

  Faculty Of Engineering Nagoya Unibersity

• Ogata Wakaha

  Faculty Of Engineering Himeji Institute Of Technology

• Ogata Wakaha

  Himeji Institute Of Technology

• Kurosawa Kaoru

  Faculty Of Engineering Tokyo Institute Of Technology

関連論文

• 秘密分散共有法とその応用
• 秘密分散共有法 (特集 ネツトワ-クシステムと暗号--電子化社会の危機管理)
• Analysis on Secret Sharing Schemes with Non-Graphical Access Structures (Special Section on Cryptography and Information Security)
• 不正者に対して最も安全な秘密分散共有法
• 1995 IEEE International Symposium on Circuits and Systems
• ゼロ知識証明とマルチパーティプロトコル (<小特集>ゼロ知識証明とその応用)
• Electronic Ticket Scheme for ITS(Special Section on Cryptography and Information Security)
• Observation of Parallel and Perpendicular Propagations of Ion Sound Waves in a Linear Turbulently Heated Plasma
• Comments on the Security Proofs of Some Signature Schemes Based on Factorization(Information Security)
• New Identity-Based Blind Signature and Blind Decryption Scheme in the Standard Model
• Collision-Based Power Attack for RSA with Small Public Exponent
• A Network Game Based on Fair Random Numbers(Cyberworlds)
• A Scheme for Partial Disclosure of Transaction Log(Application)(Cryptography and Information Security)
• Attack on Yagisawa Cryptosystem (Special Section on Cryptography and Information Security)
• Forgery Attacks on Time-Stamp, Signed PDF and X.509 Certificate
• Towards Secure and Fast Hash Functions (Special Section on Cryptography and Information Security)
• Towards Secure and Fast Hash Functions
• Security of the Five-Round KASUMI Type Permutation
• On the Pseudorandomness of KASUMI Type Permutations(Discrete Mathematics and Its Applications)
• General Conversion for Obtaining Strongly Existentially Unforgeable Signatures
• On Some Variations of Kurosawa-Desmedt Public-Key Encryption Scheme(Cryptography and Information Security)
• Efficient Divisible Voting Scheme(Application)(Cryptography and Information Security)
• Some new results on nonperfect secret sharing schemes
• Efficient Almost Secure 1-Round Message Transmission Schemes for 3t+1 Channels
• k out of n Oblivious Transfer without Random Oracles (Protocol) (Cryptography and Information Security)
• 4-Move Perfect ZKIP for Some Promise Problems
• Relationship between Standard Model Plaintext Awareness and Message Hiding
• Provably Secure On-Line Secret Sharing Scheme
• On Claw Free Families (Special Section on Cryptography and Information Security)
• New ElGamal Type Threshold Digital Signature Scheme (Special Section on Cryptography and Information Security)
• Authentication Codes Based on Association Schemes
• Matching Oblivious Transfer : How to Exchange Valuable Data(Special Section on Cryptography and Information Security)
• k out of n Oblivious Transfer without Random Oracles
• On the Practical Secret Sharing Scheme : Special Section on Cryptography and Information Security
• Reshufflable and Laziness Tolerant Mental Card Game Protocol (Special Section on Cryptography and Information Security)
• A Key Distribution Protocol for Mobile Communication Systems
• A Simple and Efficient Secret Sharing Scheme Secure against Cheating

もっと見る 閉じる

スポンサーリンク