Sciweavers

3328 search results - page 39 / 666
» On Plateaued Functions and Their Constructions
Sort
View
EUROCRYPT
2007
Springer
14 years 3 months ago
Non-trivial Black-Box Combiners for Collision-Resistant Hash-Functions Don't Exist
A (k, )-robust combiner for collision-resistant hash-functions is a construction which from hash-functions constructs a hash-function which is collision-resistant if at least k of ...
Krzysztof Pietrzak
EUROCRYPT
2010
Springer
14 years 1 months ago
Universal One-Way Hash Functions via Inaccessible Entropy
This paper revisits the construction of Universal One-Way Hash Functions (UOWHFs) from any one-way function due to Rompel (STOC 1990). We give a simpler construction of UOWHFs, whi...
Iftach Haitner, Thomas Holenstein, Omer Reingold, ...
JSYML
2006
62views more  JSYML 2006»
13 years 8 months ago
Uniform almost everywhere domination
Abstract. We explore the interaction between Lebesgue measure and dominating functions. We show, via both a priority construction and a forcing construction, that there is a functi...
Peter Cholak, Noam Greenberg, Joseph S. Miller
CISC
2006
Springer
106views Cryptology» more  CISC 2006»
14 years 16 days ago
A General Construction of Tweakable Block Ciphers and Different Modes of Operations
This work builds on earlier work by Rogaway at Asiacrypt 2004 on tweakable block cipher (TBC) and modes of operations. Our first contribution is to generalize Rogaway's TBC co...
Debrup Chakraborty, Palash Sarkar
QSIC
2007
IEEE
14 years 3 months ago
An Incremental and FCA-Based Ontology Construction Method for Semantics-Based Component Retrieval
In semantics-based component retrieval ontology is usually employed as the semantic basis for component representation and matching. Existing methods always assume that the ontolo...
Xin Peng, Wenyun Zhao