Sciweavers

78 search results - page 8 / 16
» (Convertible) Undeniable Signatures Without Random Oracles
Sort
View
140
Voted
EUROCRYPT
2003
Springer
15 years 5 months ago
Extracting Group Signatures from Traitor Tracing Schemes
Abstract. Digital Signatures emerge naturally from Public-Key Encryption based on trapdoor permutations, and the “duality” of the two primitives was noted as early as Diffie-He...
Aggelos Kiayias, Moti Yung
94
Voted
EUROCRYPT
1994
Springer
15 years 4 months ago
Designated Confirmer Signatures
Abstract. We construct the first O(1)-size designated confirmer signatures (DCS) with security in the state-of-the-art model of Camenisch and Michels, Eurocrypt 2000, without rando...
David Chaum
CANS
2009
Springer
276views Cryptology» more  CANS 2009»
14 years 10 months ago
Group Signatures with Verifier-Local Revocation and Backward Unlinkability in the Standard Model
Group signatures allow users to anonymously sign messages in the name of a group. Membership revocation has always been a critical issue in such systems. In 2004, Boneh and Shacham...
Benoît Libert, Damien Vergnaud
SACRYPT
1998
Springer
15 years 4 months ago
Computational Alternatives to Random Number Generators
In this paper, we present a simple method for generating random-based signatures when random number generators are either unavailable or of suspected quality (malicious or accident...
David M'Raïhi, David Naccache, David Pointche...
89
Voted
IJNSEC
2008
112views more  IJNSEC 2008»
15 years 11 days ago
A New and Efficient Signature on Commitment Values
We present a new short signature scheme based on a variant of the Boneh-Boyen's short signatures schemes. Our short signature scheme is secure without requiring the random or...
Fangguo Zhang, Xiaofeng Chen, Yi Mu, Willy Susilo