Sciweavers

62 search results - page 9 / 13
» Provable anonymity
Sort
View
CTRSA
2005
Springer
221views Cryptology» more  CTRSA 2005»
14 years 1 months ago
Accumulators from Bilinear Pairings and Applications
We propose a dynamic accumulator scheme from bilinear pairings, whose security is based on the Strong Diffie-Hellman assumption. We show applications of this accumulator in constru...
Lan Nguyen
CTRSA
2004
Springer
120views Cryptology» more  CTRSA 2004»
14 years 1 months ago
Identity Based Undeniable Signatures
Abstract. In this paper, we give a first example of identity based undeniable signature using pairings over elliptic curves. We extend to the identity based setting the security m...
Benoît Libert, Jean-Jacques Quisquater
EUROPAR
2010
Springer
13 years 8 months ago
Value-Based Sequential Consistency for Set Objects in Dynamic Distributed Systems
This paper introduces a set object, namely a shared object that allows processes to add and remove values as well as take a snapshot of its content. A new consistency condition su...
Roberto Baldoni, Silvia Bonomi, Michel Raynal
IFIP
2010
Springer
13 years 2 months ago
Modeling Identity-Related Properties and Their Privacy Strength
In the last years several attempts to define identity-related properties such as identifiability, pseudonymity and anonymity have been made to analyze the privacy offered by inform...
Meilof Veeningen, Benne de Weger, Nicola Zannone
JOC
2000
181views more  JOC 2000»
13 years 7 months ago
Security Arguments for Digital Signatures and Blind Signatures
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...
David Pointcheval, Jacques Stern