Some new results on nonperfect secret sharing schemes
スポンサーリンク
概要
- 論文の詳細を見る
秘密分散共有法においては、各プレーヤーP_iの保持すべきshareの集合V_iの大きさが小さい方か望ましい。ここで、Sを秘密sの集合としたとき、|V_i|<|S|となる為には秘密分散共有法は非完全方式でなければならないことが知られている。ただし、秘密sに関する何らかの情報はもれるが、sを復元することはできない部分集合を許す方式を非完全方式という。筆者らは既に、非完全方式における|V_i|の大きさの下限を求めている。一方、非完全方式が存在する為にアクセス構造が満たすべき必要十分条件は、|S|が合成数の場合に対してのみ、筆者らによって示されている。本論文では、この条件が任意の整数|S|に対し成り立つことを示す。また、|V_i|と洩れる情報量との間にトレードオフか存在することも示す。
- 社団法人電子情報通信学会の論文
- 1995-12-15
著者
-
KUROSAWA Kaoru
Department of Computer and Information Sciences, Ibaraki University
-
Ogata Wakaha
Department Of Computer Engineering Faculty Of Engineering Himeji Institute Of Technology
-
Ogata Wakaha
Faculty Of Engineering Tokyo Institute Of Technology
-
Kurosawa Kaoru
Department Of Computer And Information Sciences Ibaraki University
-
Ogata Wakaha
Faculty Of Engineering Himeji Institute Of Technology
-
Ogata Wakaha
Himeji Institute Of Technology
-
Kurosawa Kaoru
Department Of Electrical And Electronic Engineering Faculty Of Engineering Tokyo Institute Of Techno
-
Kurosawa Kaoru
Department Of Behavioral Sciences Faculty Of Letters Chiba University
関連論文
- On the Security of a MAC by Mitchell(Symmetric Key Cryptography)(Cryptography and Information Security)
- Analysis on Secret Sharing Schemes with Non-Graphical Access Structures (Special Section on Cryptography and Information Security)
- Electronic Ticket Scheme for ITS(Special Section on Cryptography and Information Security)
- TMAC: Two-Key CBC MAC (Symmetric Cipher) (Cryptography and Information Security)
- TMAC : Two-Key CBC MAC
- Comments on the Security Proofs of Some Signature Schemes Based on Factorization(Information Security)
- Combinatorial Bounds and Design of Broadcast Authentication (Special Section on Discrete Mathematics and Its Applications)
- 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)
- Forgery Attacks on Time-Stamp, Signed PDF and X.509 Certificate
- On the Correctness of Security Proofs for the 3GPP Confidentiality and Integrity Algorithms(Discrete Mathematics and Its Applications)
- How to Design Efficient Multiple-Use 1-out-n Oblivious Transfer (Protocol) (Cryptography and Information Security)
- Hoe to Improve Interpolation Attack(Symmetric Key Cryptography)(Cryptography and Information Security)
- On the Pseudorandomness of KASUMI Type Permutations(Discrete Mathematics and Its Applications)
- Inclusion Relations of Boolean Functions Satisfying PC(l) of Order k(Special Section on Cryptography and Information Security)
- 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
- A.C. Characteristics of the Electroviscous Effect
- Transient Pressure-Drop Fluctuatins in Electroviscous Effect
- Electroviscous Effect in Liquid Crystals
- The Electroviscous Effect in the MBBA Liquid Crystal
- Provably Secure On-Line Secret Sharing Scheme
- On Claw Free Families (Special Section on Cryptography and Information Security)
- Almost Secure (1-Round, n-Channel) Message Transmission Scheme
- New bound for affine resolvable designs and its application to authentication codes
- On Parallel Hash Functions Based on Block-Ciphers (Symmetric Cipher) (Cryptography and Information Security)
- Square Hash with a Small Key Size (Symmetric Cipher) (Cryptography and Information Security)
- k-Resilient Identity-Based Encryption in the Standard Model(Public Key Cryptography, Cryptography and Information Security)
- On the Universal Hash Functions in Luby-Rackott Cipher (Symmetric Cipher) (Cryptography and Information Security)
- 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)
- On the Universal Hash Functions in Luby-Rackoff Cipher
- Birthday Paradox for Multi-Collisions
- Practical and Proven Zero-Knowledge Constant Round Variants of GQ and Schnorr (Special Section on Cryptography and Information Security)
- A Simple and Efficient Secret Sharing Scheme Secure against Cheating
- Process interactionism, process analysis, and self process : An extension of Kurt Lewin's approach to personality psychology
- How to Design Efficient Multiple-Use 1-out-n Oblivious Transfer
- Square Hash with a Small Key Size
- Relation between Verifiable Random Functions and Convertible Undeniable Signatures, and New Constructions