Efficient Almost Secure 1-Round Message Transmission Schemes for 3t+1 Channels
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E93-A No.1 pp.126-135
- Publication Date
- 2010/01/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.E93.A.126
- Type of Manuscript
- Special Section PAPER (Special Section on Cryptography and Information Security)
- Category
- Secure Protocol
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Toshinori ARAKI, Wakaha OGATA, "Efficient Almost Secure 1-Round Message Transmission Schemes for 3t+1 Channels" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 1, pp. 126-135, January 2010, doi: 10.1587/transfun.E93.A.126.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.126/_p
Copy
@ARTICLE{e93-a_1_126,
author={Toshinori ARAKI, Wakaha OGATA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Efficient Almost Secure 1-Round Message Transmission Schemes for 3t+1 Channels},
year={2010},
volume={E93-A},
number={1},
pages={126-135},
abstract={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.},
keywords={},
doi={10.1587/transfun.E93.A.126},
ISSN={1745-1337},
month={January},}
Copy
TY - JOUR
TI - Efficient Almost Secure 1-Round Message Transmission Schemes for 3t+1 Channels
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 126
EP - 135
AU - Toshinori ARAKI
AU - Wakaha OGATA
PY - 2010
DO - 10.1587/transfun.E93.A.126
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E93-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2010
AB - 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.
ER -
English
