Efficient Almost Secure 1-Round Message Transmission Schemes for 3t+1 Channels
スポンサーリンク
概要
- 論文の詳細を見る
In the model, a sender S wants to send a message to a receiver R secretly and reliably in r-round. They do not share any information like keys, but there are n independent communication channels between S and R, and an adversary A can observe and/or substitute the data which goes through some channels (but not all). In this paper, we propose almost secure (1-round, 3t+1 -channel) MTSs which have following two properties where t is the number of channels A can observe and/or forge. (1) The running time of message decryption algorithm is polynomial in n. (2) Communication cost is smaller than the previous MTSs, if the message is large to some degree.
- (社)電子情報通信学会の論文
- 2010-01-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