Sciweavers

11 search results - page 1 / 3
» On the Possibility of Constructing Meaningful Hash Collision...
Sort
View
ACISP
2005
Springer
13 years 10 months ago
On the Possibility of Constructing Meaningful Hash Collisions for Public Keys
It is sometimes argued (as in [6]) that finding meaningful hash collisions might prove difficult. We show that at least one of the arguments involved is wrong, by showing that for...
Arjen K. Lenstra, Benne de Weger
TISSEC
2010
115views more  TISSEC 2010»
12 years 11 months ago
A Simple and Generic Construction of Authenticated Encryption with Associated Data
We revisit the problem of constructing a protocol for performing authenticated encryption with associated data (AEAD). A technique is described which combines a collision resistant...
Palash Sarkar
ACISP
2007
Springer
13 years 11 months ago
Non-interactive Manual Channel Message Authentication Based on eTCR Hash Functions
We present a new non-interactive message authentication protocol in manual channel model (NIMAP, for short) using the weakest assumption on the manual channel (i.e. assuming the st...
Mohammad Reza Reyhanitabar, Shuhong Wang, Reihaneh...
IACR
2011
149views more  IACR 2011»
12 years 4 months ago
Public Key Encryption for the Forgetful
We investigate public key encryption that allows the originator of a ciphertext to retrieve a “forgotten” plaintext from the ciphertext. This type of public key encryption wit...
Puwen Wei, Yuliang Zheng, Xiaoyun Wang
SACRYPT
2009
Springer
155views Cryptology» more  SACRYPT 2009»
13 years 11 months ago
Practical Collisions for SHAMATA-256
In this paper, we present a collision attack on the SHA-3 submission SHAMATA. SHAMATA is a stream cipher-like hash function design with components of the AES, and it is one of the ...
Sebastiaan Indesteege, Florian Mendel, Bart Prenee...