Art

J-GLOBAL ID：201002292733297631   Reference number：10A0271319

Efficient Almost Secure 1-Round Message Transmission Schemes for 3t+1 Channels

3t+1チャンネルのための効率的なほとんどセキュアな1ラウンドのメッセージ送信方式

Author (3)： ARAKI Toshinori (Tokyo Inst. of Technol., Tokyo, JPN) ,  ARAKI Toshinori (NEC, Kawasaki-shi, JPN) ,  OGATA Wakaha (Tokyo Inst. of Technol., Tokyo, JPN)
Material： IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (Institute of Electronics, Information and Communication Engineers)  (IEICE Trans Fundam Electron Commun Comput Sci (Inst Electron Inf Commun Eng))
Volume： E93-A  Issue： 1  Page： 126-135  Publication year： Jan. 01, 2010 
JST Material Number： F0699C  ISSN： 0916-8508  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： ENGLISH (EN)

Thesaurus term： channel ,  *message transmission ,  transmission system (communication) ,  *cryptography key ,  *communication channel ,  observation ,  displacement (replacement) ,  polynomial ,  cost ,  cryptanalysis
Semi thesaurus term： decipher ,  communication cost

JST classification (1)： Code theory  (ND02030R)

Reference (18)：

• [1] E.R. Berlekamp, Algebraic Coding Theory, ch. 7, McGraw-Hill, New York, 1968.
• [2] G.R. Blakley, “Safeguarding cryptographic keys, ” Proc. AFIPS 1979, National Computer Conference, vol.48, pp.313-317, 1979.
• [3] G.R. Blakley and C. Meadows, “Security of ramp schemes, ” CRYPTO 1984. LNCS, vol.196, pp.242-268, 1984.
• [4] B. Chor, S. Goldwasser, S. Micali, and B. Awerbuch, “Verifiable secret sharing and achieving simultaneity in the presence of faults (extended abstract), ” FOCS 1985, pp.383-395, 1985.
• [5] R. Cramer, I. Damgard, and S. Fehr, “On the cost of reconstructing a secret, or VSS with optimal reconstruction phase, ” CRYPTO 2001, LNCS, vol.2139, pp.503-523, 2001.

Terms in the title (3)： チャンネル ,  メッセージ ,  送信方式