Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

32

JCT
2011

favoriteEmaildiscussreport

106views more JCT 2011»

Bounds for separating hash families

13 years 5 months ago

Bounds for separating hash families

Download www.exp-math.uni-essen.de

This paper aims to present a new upper bound on the size of separating hash families. This bound improves previously known bounds for separating hash families of general type. Key words. Separating hash family, perfect hash family, frameproof code, w-IPP code.

Marjan Bazrafshan, Tran van Trung

Real-time Traffic

Hash Families | Hash Family | JCT 2011 | Perfect Hash Family |

claim paper

Related Content

» Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families

» A bound on the size of separating hash families

» The Parazoa Family Generalizing the Sponge Hash Functions

» On generalized separating hash families

» Balls and Bins Smaller Hash Families and Faster Evaluation

» Lower bounds on locality sensitive hashing

» The PHOTON Family of Lightweight Hash Functions

» Why simple hash functions work exploiting the entropy in a data stream

» Iteration Bound Analysis and Throughput Optimum Architecture of SHA256 384 512 for Hardwar...

Post Info
More Details (n/a)

Added	14 May 2011
Updated	14 May 2011
Type	Journal
Year	2011
Where	JCT
Authors	Marjan Bazrafshan, Tran van Trung

Comments (0)