We investigate methods for providing easy-to-check proofs of computational effort. Originally
intended for discouraging spam, the concept has wide applicability as a method for …

This paper describes an extremely efficient squaring operation in the so-called 'cyclotomic
subgroup'of F_q^6^*, for q≡16. Our result arises from considering the Weil restriction of …

Abstract k-times anonymous authentication (k-TAA) schemes allow members of a group to
be anonymously authenticated by application providers for a bounded number of times. k …

Anonymity has received increasing attention in the literature due to the users' awareness of
their privacy nowadays. Anonymity provides protection for users to enjoy network services …

We propose new squaring formulae for cyclotomic subgroups of the multiplicative group of
certain finite fields. Our formulae use a compressed representation of elements having the …

The security and performance of pairing based cryptography has provoked a large volume
of research, in part because of the exciting new cryptographic schemes that it underpins. We …

A time-based inductive learning approach to security audit trail analysis is presented. The
approach uses a time-based inductive engine to generate rule-based sequential patterns …

Abstract In 2003, Boneh, Gentry, Lynn and Shacham (BGLS) devised the first provably-
secure aggregate signature scheme. Their scheme uses bilinear pairings and their security …

The value ot the late pairing on an elliptic curve over a finite field may be viewed as an
element of an algebraic torus. Using this simple observation, we transfer techniques recently …

These are the proceedings of Crypto 2005, the 25th Annual International Cr-tology
Conference. The conference was sponsored by the International Assoc-tion for Cryptologic …