New hash functions and their use in authentication and set equality
Reads0
Chats0
TLDR
Several new classes of hash functions with certain desirable properties are exhibited, and two novel applications for hashing which make use of these functions are introduced, including a provably secure authentication technique for sending messages over insecure lines and the application of testing sets for equality.About:
This article is published in Journal of Computer and System Sciences.The article was published on 1981-06-01 and is currently open access. It has received 1586 citations till now. The article focuses on the topics: Hash function & Universal hashing.read more
Citations
More filters
Book
Handbook of Applied Cryptography
TL;DR: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols.
Journal ArticleDOI
Quantum cryptography
TL;DR: A protocol for coin-tossing by exchange of quantum messages is presented, which is secure against traditional kinds of cheating, even by an opponent with unlimited computing power, but ironically can be subverted by use of a still subtler quantum phenomenon, the Einstein-Podolsky-Rosen paradox.
Journal ArticleDOI
The security of practical quantum key distribution
Valerio Scarani,Helle Bechmann-Pasquinucci,Nicolas J. Cerf,Miloslav Dušek,Norbert Lütkenhaus,Momtchil Peev +5 more
TL;DR: Essential theoretical tools that have been developed to assess the security of the main experimental platforms are presented (discrete- variable, continuous-variable, and distributed-phase-reference protocols).
Journal ArticleDOI
Secret key agreement by public discussion from common information
TL;DR: It is shown that such a secret key agreement is possible for a scenario in which all three parties receive the output of a binary symmetric source over independent binary asymmetric channels, even when the enemy's channel is superior to the other two channels.
Book ChapterDOI
Keying Hash Functions for Message Authentication
TL;DR: Two new, simple, and practical constructions of message authentication schemes based on a cryptographic hash function, NMAC and HMAC, are proven to be secure as long as the underlying hash function has some reasonable cryptographic strengths.
References
More filters
Journal ArticleDOI
New Directions in Cryptography
TL;DR: This paper suggests ways to solve currently open problems in cryptography, and discusses how the theories of communication and computation are beginning to provide the tools to solve cryptographic problems of long standing.
Journal ArticleDOI
Universal classes of hash functions
TL;DR: An input independent average linear time algorithm for storage and retrieval on keys that makes a random choice of hash function from a suitable class of hash functions.
Proceedings ArticleDOI
Some complexity questions related to distributive computing(Preliminary Report)
TL;DR: The quantity of interest, which measures the information exchange necessary for computing f, is the minimum number of bits exchanged in any algorithm.
Journal ArticleDOI
Extendible hashing—a fast access method for dynamic files
TL;DR: This work studies, by analysis and simulation, the performance of extendible hashing and indicates that it provides an attractive alternative to other access methods, such as balanced trees.
Journal ArticleDOI
Codes which detect deception
TL;DR: If the key can take K values, then an optimal strategy for B secures him a probability of an undetected substitution ≪ K−1, and several encoding functions Φ(.,.) are given, some of which achieve this bound.