2010年1月
Efficient Almost Secure 1-Round Message Transmission Schemes for 3t+1 Channels
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
- ,
- 巻
- E93A
- 号
- 1
- 開始ページ
- 126
- 終了ページ
- 135
- 記述言語
- 英語
- 掲載種別
- DOI
- 10.1587/transfun.E93.A.126
- 出版者・発行元
- IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG
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 it 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 it. (2) Communication cost is smaller than the previous MTSs, if the message is large to some degree.
- リンク情報
- ID情報
-
- DOI : 10.1587/transfun.E93.A.126
- ISSN : 0916-8508
- eISSN : 1745-1337
- Web of Science ID : WOS:000274505900014