ACISP
2005
Springer
13 years 6 months ago
2005
Springer
Abstract. In this article we introduce redundant trinomials to represent elements of finite fields of characteristic 2. This paper develops applications to cryptography, especial...
ACISP
2005
Springer
13 years 10 months ago
2005
Springer
We present the first group signature scheme with provable security and signature size O(λ) bits where the group manager, the group members, and the Open Authority (OA) are all id...
ACISP
2005
Springer
13 years 10 months ago
2005
Springer
ACISP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. Multivariate public-key cryptosystems (sometimes polynomial-based PKC’s or just multivariates) handle polynomials of many variables over relatively small fields instea...
ACISP
2005
Springer
13 years 10 months ago
2005
Springer
Anonymous credentials are an important privacy-enhancing technique that allows users to convince a service provider of their legitimacy for service accesses in an anonymous manner....
ACISP
2005
Springer
13 years 10 months ago
2005
Springer
The limited flexibility of the Internet to support mobility has motivated many researchers to look for alternative architectures. One such effort that combines security and multi...
ACISP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. RFID tags are tiny, inexpensive, inductively powered computers that are going to replace bar codes on many products, but which have many other uses as well. For example, ...
ACISP
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. The PCBC block cipher mode of operation has many variants, of which one, due to Meyer and Matyas, dates back over 20 years. Whilst a particularly simple variant of PCBC h...
ACISP
2005
Springer
13 years 10 months ago
2005
Springer
While it is known that wireless networks experience unauthorised connections, little is known about the nature or frequency of the connections. This study seeks to investigate the ...
ACISP
2005
Springer
13 years 10 months ago
2005
Springer
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...