A message recognition protocol based on standard assumptions

Authors:
Atefeh Mashatan;Serge Vaudenay
Affiliations:
The Security and Cryptography Laboratory, EPFL, Lausanne, Switzerland;The Security and Cryptography Laboratory, EPFL, Lausanne, Switzerland
Venue:
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Year:
2010

Citing 15
Cited 0

One-way functions and pseudorandom generators

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Universal one-way hash functions and their cryptographic applications

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the existence of pseudorandom generators

SIAM Journal on Computing
A new family of authentication protocols

ACM SIGOPS Operating Systems Review
Password authentication with insecure communication

Communications of the ACM
Ariadne: a secure on-demand routing protocol for ad hoc networks

Proceedings of the 8th annual international conference on Mobile computing and networking
Multiround Unconditionally Secure Authentication

Designs, Codes and Cryptography
A Certified Digital Signature

CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
The Resurrecting Duckling: Security Issues for Ad-hoc Wireless Networks

Proceedings of the 7th International Workshop on Security Protocols
Recognition in a Low-Power Environment

ICDCSW '05 Proceedings of the Second International Workshop on Wireless Ad Hoc Networking - Volume 09
Concrete Security for Entity Recognition: The Jane Doe Protocol

INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
A New Message Recognition Protocol for Ad Hoc Pervasive Networks

CANS '08 Proceedings of the 7th International Conference on Cryptology and Network Security
Interactive two-channel message authentication based on Interactive-Collision Resistant hash functions

International Journal of Information Security
A New Message Recognition Protocol with Self-recoverability for Ad Hoc Pervasive Networks

ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Secure communications over insecure channels based on short authenticated strings

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 pseudorandom function F and prove its security based on new assumptions. Then, we show that these new assumptions are equivalent to the standard notions of preimage resistance, second preimage resistance, and existential unforgeability given that F is a pseudorandom function.