多接收多重認(rèn)證碼的有關(guān)邊界和構(gòu)造
bounds and construction for multiple authentication codes with multi-receiver
-
摘要: 該文討論了在一個(gè)發(fā)送者、多個(gè)接收者、多重認(rèn)證碼中、內(nèi)部欺騙者的聯(lián)合實(shí)施模仿攻擊和替代攻擊成功概率的下界。說(shuō)明了對(duì)多接收多重認(rèn)證門限體制,要使它達(dá)到某一安全水平,發(fā)送者和各接收者必須掌握的最小密鑰量,并給出一種具體構(gòu)造方法。
-
關(guān)鍵詞:
- 多接收多重認(rèn)證碼; 密鑰; 門限體制
Abstract: This paper discusses the bounds on the probability of success in impersonation and substitution attack by malicious groups of receivers for multiple authentication codes with multi-receiver, and gives out the least-size of the secret key space that the sender and the receivers must have in hand to ensure the multiple authertication codes with multi-receiver being under security level and presents also its construting method. -
馬文平,王新梅,多發(fā)送認(rèn)證碼的幾個(gè)新構(gòu)造方法,電子學(xué)報(bào),2000,28(4),117-119.[2]R. Safvi-Naini, H. Wang, Multi-receiver authentication codes: models, bounds, constructions and extensions, Information and Computation, 1999, 151(1), 148-172.[3]Wakaha Ogata, Kaoru Kurosawa, Optimum secret sharing scheme secure against cheating, Advances in Cryptology-EUROCRYPT96, Lecture Notes in Computer Science, Springer-Verlag Heidelberg, 1996, Vol.1070, 200 211.[4]M. Atici.[J].D. R. Stinson, Universal hashing and multiple authentication. Advances in CryptologyCRYPTO96, Lecture Notes in Computer Science, New York, Springer, vol.110.1996,:-[5]Y. Desmedt.[J].Society and group oriented cryptography: A new concept, Advances in CryptologyCrypto87, Lecture Notes in Computer Science, Springer-Verlag, vol.57.1991,:- -