A Message Recognition Protocol Based on Standard Assumptions
We look at the problem of designing Message Recognition Protocols (MRP) and note that all proposals available in the literature have relied on security proofs which hold in the random oracle model or are based on non-standard assumptions. Incorporating random coins, we propose a new MRP using a pseu dorandom function F and prove its security based on new assumptions. Then, we show that these new assumptions are equivalent to the stan dard notions of preimage resistance, second preimage resistance, and existential unforgeability given that F is a pseudorandom function.
Cryptographic Protocols Authentication Recognition Pseudorandom Functions Pervasive Networks Ad Hoc Networks
Atefeh Mashatan Serge Vaudenay
The Security and Cryptography Laboratory (LASEC), EPFL CH-1015 Lausanne, Switzerland
国际会议
8th International Conference,ACNS 2010(第八届国际应用密码与网络安全大会)
北京
英文
384-401
2010-06-22(万方平台首次上网日期,不代表论文的发表时间)