A Simple and Efficient Secret Sharing Scheme Secure against Cheating

スポンサーリンク

概要

• 論文の詳細を見る

• In (k,n) threshold scheme, Tompa and Woll considered a problem of cheaters who try to make another participant reconstruct an invalid secret. Later, some models of such cheating were formalized and lower bounds of the size of share were shown in the situation of fixing the maximum successful cheating probability to ε. Some efficient schemes in which size of share is equal to the lower bound were also proposed. Let |S| be the field size of the secret. Under the assumption that cheaters do not know the distributed secret, these sizes of share of previous schemes which can work for ε > 1/|S| are somewhat larger than the bound. In this paper, we show the bound for this case is really tight by constructing a new scheme. When distributing uniform secret, the bit length of share in the proposed scheme is only 1 bit longer than the known bound. Further, we show a tighter bound of the size of share in case of ε < 1/|S|.

• （社）電子情報通信学会の論文
• 2011-06-01

著者

• OGATA Wakaha

  Tokyo Institute of Technology

• Ogata Wakaha

  Tokyo Inst. Of Technol. Tokyo Jpn

• Ogata Wakaha

  Department Of Computer Engineering Faculty Of Engineering Himeji Institute Of Technology

• Ogata Wakaha

  Faculty Of Engineering Tokyo Institute Of Technology

• ARAKI Toshinori

  Tokyo Institute of Technology

• Ogata Wakaha

  Faculty Of Engineering Himeji Institute Of Technology

• Ogata Wakaha

  Himeji Institute Of Technology

• Araki Toshinori

  Tokyo Inst. Of Technol.

関連論文

• Collision-Based Power Attack for RSA with Small Public Exponent
• New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
• New Identity-Based Blind Signature and Blind Decryption Scheme in the Standard Model
• 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)
• Provably Secure On-Line Secret Sharing Scheme
• Comments on the Security Proofs of Some Signature Schemes Based on Factorization(Information Security)
• New RSA-Based (Selectively) Convertible Undeniable Signature Schemes
• New Identity-Based Blind Signature and Blind Decryption Scheme in the Standard Model
• Collision-Based Power Attack for RSA with Small Public Exponent
• Forgery Attacks on Time-Stamp, Signed PDF and X.509 Certificate
• 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 General Model of Structured Multisignatures with Message Flexibility(Signatures,Cryptography and Information Security)
• Provably Secure On-Line Secret Sharing Scheme
• On Claw Free Families (Special Section on 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)
• A Simple and Efficient Secret Sharing Scheme Secure against Cheating
• Undeniable and Unpretendable Signatures

もっと見る 閉じる

スポンサーリンク