73 search results - page 4 / 15 » An Improved Construction for Universal Re-encryption |
CRYPTO
2000
Springer
13 years 11 months ago
2000
Springer
The best known constructions for arrays with low bias are those from [1] and the exponential sum method based on the WeilCarlitz-Uchiyama bound. They all yield essentially the same...
FSE
2007
Springer
14 years 1 months ago
2007
Springer
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...
EUROCRYPT
2008
Springer
13 years 9 months ago
2008
Springer
The Universal Composability framework was introduced by Canetti to study the security of protocols which are concurrently executed with other protocols in a network environment. U...
ASWEC
2008
IEEE
14 years 2 months ago
2008
IEEE
The past ten years have seen a radical shift in business application software development. Rather than developing software from scratch using a conventional programming language, ...
DAGSTUHL
2007
13 years 9 months ago
2007
This paper proposes a construction for collision resistant 2n-bit hash functions, based on n-bit block ciphers with 2n-bit keys. The construction is analysed in the ideal cipher mo...