Sciweavers

21 search results - page 2 / 5
» Strongly History-Independent Hashing with Applications
Sort
View
PKC
2007
Springer
129views Cryptology» more  PKC 2007»
14 years 1 months ago
Two-Tier Signatures, Strongly Unforgeable Signatures, and Fiat-Shamir Without Random Oracles
We provide a positive result about the Fiat-Shamir (FS) transform in the standard model, showing how to use it to convert threemove identification protocols into two-tier signatur...
Mihir Bellare, Sarah Shoup
AFRICACRYPT
2008
Springer
13 years 9 months ago
How (Not) to Efficiently Dither Blockcipher-Based Hash Functions?
Abstract. In the context of iterated hash functions, "dithering" designates the technique of adding an iteration-dependent input to the compression function in order to d...
Jean-Philippe Aumasson, Raphael C.-W. Phan
ICISC
2007
77views Cryptology» more  ICISC 2007»
13 years 8 months ago
Improving Upon the TET Mode of Operation
Naor and Reingold had proposed the construction of a strong pseudo-random permutation (SPRP) by using a layer of ECB encryption between two layers of invertible block-wise universa...
Palash Sarkar
IPL
2006
110views more  IPL 2006»
13 years 7 months ago
Variationally universal hashing
The strongest well-known measure for the quality of a universal hash-function family H is its being -strongly universal, which measures, for randomly chosen h H, one's inabi...
Ted Krovetz, Phillip Rogaway
COMPSYSTECH
2010
13 years 7 months ago
An approach for node identification and key management in sensor grids
Security of sensor grids is important especially for surveillance, military and medical applications. The paper addresses methods for two security features. First, an approach for ...
Iliya Georgiev