In this paper, we compare the performance of descriptors computed for local interest
regions, as, for example, extracted by the Harris-Affine detector [Mikolajczyk, K and Schmid …

We introduce the notion of a dynamic accumulator. An accumulator scheme allows one to
hash a large set of inputs into one short value, such that there is a short proof that a given …

This paper presents efficient off-line anonymous e-cash schemes where a user can
withdraw a wallet containing 2 ℓ coins each of which she can spend unlinkably. Our first …

Based on the notion of accumulators, we propose a new cryptographic scheme called
universal accumulators. This scheme enables one to commit to a set of values using a short …

We argue that threshold trust is not an option in most of the real-life electronic auctions. We
then propose two new cryptographic Vickrey auction schemes that involve, apart from the …

We show how to prove in honest verifier zero-knowledge the correctness of a shuffe of
homomorphic encryptions (or homomorphic commitments.) A shuffe consists in a …

In an electronic cash (e-cash) system, a user can withdraw coins from the bank, and then
spend each coin anonymously and unlinkably. For some applications, it is desirable to set a …

Constructing practical and provably secure group signature schemes has been a very active
research topic in recent years. A group signature can be viewed as a digital signature with …

We propose a distributed key generation protocol for the threshold Paillier cryptosystem.
Often in the multiparty computation based on the threshold Paillier cryptosystem, the …

We propose a practical abuse-resilient transaction escrow scheme with applications to
privacy-preserving audit and monitoring of electronic transactions. Our scheme ensures …