8 search results - page 2 / 2 » The Composite Discrete Logarithm and Secure Authentication |
TIT
2010
13 years 5 days ago
2010
This paper considers the construction and analysis of pseudo-random functions (PRFs) with specific reference to modes of operations of a block cipher. In the context of message aut...
EUROCRYPT
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...
ACISP
2003
Springer
13 years 9 months ago
2003
Springer
In some practical circumstances, the ability of a signer should be restricted. In group signature schemes, a group member may be allowed to generate signatures up to a certain numb...