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.


Editor(s):
Zhou, J.
Yung, Moti
Published in:
Lecture Notes in Computer Science, LNCS 6123, 384-401
Presented at:
Applied Cryptography and Network Security (ACNS '10), Beijing, China, June 22-25 2010
Year:
2010
Publisher:
Berlin Heidelberg 2010, Springer
ISSN:
0302-9743
Keywords:
Laboratories:




 Record created 2010-05-07, last modified 2018-03-17

Publisher's version:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)