Efficient Secret Sharing Schemes Based on Authorized Subsets(<Special Section>Cryptography and Information Security)
スポンサーリンク
概要
- 論文の詳細を見る
We propose efficient secret sharing schemes realizing general access structures. Our proposed schemes are perfect secret sharing schemes and include Shamir's (k, n) -threshold schemes as a special case. Furthermore, we show that a verifiable secret sharing scheme for general access structures is realized by one of the proposed schemes.
- 社団法人電子情報通信学会の論文
- 2005-01-01
著者
-
MATSUMOTO Ryutaroh
the Department of Information Processing, Tokyo Institute of Technology
-
Uyematsu T
The Dept. Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Uyematsu Tomohiko
The Department Of Commumcations And Integrated Systems Tokyo Institute Of Technology
-
TOCHIKUBO Kouya
the Dept. of Communications and Integrated Systems, Tokyo Institute of Technology
-
Matsumoto R
The Dept. Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Matsumoto Ryutaroh
The Department Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Tochikubo K
The Dept. Of Communications And Integrated Systems Tokyo Institute Of Technology:the Systems Integra
関連論文
- Simple Estimation for the Dimension of Subfield Subcodes of AG Codes
- An Improved Bound for the Dimension of Subfield Subcodes
- Efficient Secret Sharing Schemes Based on Authorized Subsets(Cryptography and Information Security)
- Secret Key Capacity for Ergodic Correlated Sources(Information Theory)
- One-Point Algebraic Geometric Codes from Artin-Schreier Extensions of Hermitian Function Fields (Special Section on Information Theory and Its Applications)
- A Simple Parallel Algorithm for the Ziv-Lempel Encoding
- An Efficient Universal Coding Algorithm for Noiseless Channel with Symbols of Unequal Cost
- Proposal of an Automatic Signature Scheme Using a Compiler (Special Section on Cryptography and Information Security)
- Reliability Functions for Concatenated Codes Employing Modular Codes with Maximum Likelihood Decoding
- Permutation Cipher Scheme Using Polynomials over a Field
- Two Algorithms for Random Number Generation Implemented by Using Arithmetic of Limited Precision(Information Security)(Information Theory and Its Applications)
- Fast Encoding of Algebraic Geometry Codes(Special Section on Information Theory and Its Applications)
- On the Universality of Channel Decoders Constructed from Source Encoders for Finite-State Channels(Special Section on Information Theory and Its Applications)
- Secret Sharing Schemes Based on Linear Codes Can Be Precisely Characterized by the Relative Generalized Hamming Weight