ASIACRYPT
2001
Springer
14 years 1 months ago
2001
Springer
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
ASIACRYPT
2001
Springer
14 years 1 months ago
2001
Springer
We study a class of problems called Modular Inverse Hidden Number Problems (MIHNPs). The basic problem in this class is the following: Given many pairs xi, msbk (α + xi)−1 mod p...
ASIACRYPT
2001
Springer
14 years 1 months ago
2001
Springer
We consider a novel security requirement of encryption schemes that we call “key-privacy” or “anonymity”. It asks that an eavesdropper in possession of a ciphertext not be ...
ASIACRYPT
2001
Springer
14 years 1 months ago
2001
Springer
ASIACRYPT
2001
Springer
14 years 1 months ago
2001
Springer
A fair blind signature scheme allows the trustee to revoke blindness so that it provides authenticity and anonymity to honest users while preventing malicious users from abusing th...
ASIACRYPT
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. McEliece is one of the oldest known public key cryptosystems. Though it was less widely studied than RSA, it is remarkable that all known attacks are still exponential. I...
FSE
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. The CBC-MAC or cipher block chaining message authentication code, is a well-known method to generate message authentication codes. Unfortunately, it is not forgery-secure...
EUROCRYPT
2009
Springer
14 years 1 months ago
2009
Springer
FSE
2010
Springer
14 years 1 months ago
2010
Springer
We answer the question of Reyhanitabar et al. from FSE’09 of constructing a domain extension scheme for enhanced target collisionresistant (eTCR) hash functions with sublinear ke...
FSE
2010
Springer
14 years 1 months ago
2010
Springer
In this paper, we improve the recent rebound and start-from-the-middle attacks on AES-like permutations. Our new cryptanalysis technique uses the fact that one can view two rounds ...