Sciweavers

208 search results - page 7 / 42
» Variationally universal hashing
Sort
View
CRYPTO
1990
Springer
58views Cryptology» more  CRYPTO 1990»
15 years 1 months ago
Structural Properties of One-way Hash Functions
We study the following two kinds of one-way hash functions: universal oneway hash functions (UOHs) and collision intractable hash functions (CIHs). The main property of the former...
Yuliang Zheng, Tsutomu Matsumoto, Hideki Imai
72
Voted
ICGA
2008
113views Optimization» more  ICGA 2008»
14 years 9 months ago
Move Generation with Perfect Hash Functions
We present two new perfect hashing schemes that can be used for efficient bitboard move generation for sliding pieces in chess-like board games without the need to use rotated bit...
Trevor I. Fenner, Mark Levene
DAGM
2004
Springer
15 years 3 months ago
Using Pattern Recognition for Self-Localization in Semiconductor Manufacturing Systems
In this paper we present a new method for self-localization on wafers using geometric hashing. The proposed technique is robust to image changes induced by process variations, as o...
Michael Lifshits, Roman Goldenberg, Ehud Rivlin, M...
PERCOM
2008
ACM
14 years 9 months ago
Providing Security and Privacy in RFID Systems Using Triggered Hash Chains
RFID technology shall increase security, e.g. by helping to prevent counterfeiting. But the technology also causes privacy issues. In this paper, after highlighting goals and prob...
Dirk Henrici, Paul Müller
FSE
2007
Springer
115views Cryptology» more  FSE 2007»
15 years 3 months ago
Improving the Security of MACs Via Randomized Message Preprocessing
Abstract. “Hash then encrypt” is an approach to message authentication, where first the message is hashed down using an ε-universal hash function, and then the resulting k-bi...
Yevgeniy Dodis, Krzysztof Pietrzak