Sciweavers

23 search results - page 3 / 5
» Constructing Cryptographic Hash Functions from Fixed-Key Blo...
Sort
View
ICC
2009
IEEE
155views Communications» more  ICC 2009»
13 years 3 months ago
On Hashing with Tweakable Ciphers
Cryptographic hash functions are often built on block ciphers in order to reduce the security of the hash to that of the cipher, and to minimize the hardware size. Proven secure co...
Raphael Chung-Wei Phan, Jean-Philippe Aumasson
ASIACRYPT
2004
Springer
13 years 11 months ago
Higher Order Universal One-Way Hash Functions
Universal One-Way Hash Functions (UOWHFs) are families of cryptographic hash functions for which first a target input is chosen and subsequently a key which selects a member from ...
Deukjo Hong, Bart Preneel, Sangjin Lee
ACISP
2009
Springer
13 years 9 months ago
Efficiency Bounds for Adversary Constructions in Black-Box Reductions
Abstract. We establish a framework for bounding the efficiency of cryptographic reductions in terms of their security transfer. While efficiency bounds for the reductions have been...
Ahto Buldas, Aivo Jürgenson, Margus Niitsoo
COCO
2007
Springer
111views Algorithms» more  COCO 2007»
13 years 9 months ago
Efficient Arguments without Short PCPs
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky
ASIACRYPT
2009
Springer
14 years 12 days ago
Foundations of Non-malleable Hash and One-Way Functions
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...
Alexandra Boldyreva, David Cash, Marc Fischlin, Bo...