Sciweavers

787 search results - page 16 / 158
» Subversion-Resilient Signature Schemes
Sort
View
EUROCRYPT
2001
Springer
15 years 2 months ago
A Secure Three-Move Blind Signature Scheme for Polynomially Many Signatures
Abstract. Known practical blind signature schemes whose security against adaptive and parallel attacks can be proven in the random oracle model either need five data exchanges bet...
Masayuki Abe
ICICS
2007
Springer
15 years 3 months ago
(Convertible) Undeniable Signatures Without Random Oracles
We propose a convertible undeniable signature scheme without random oracles. Our construction is based on the Waters signatures proposed in Eurocrypt 2005. The security of our sche...
Tsz Hon Yuen, Man Ho Au, Joseph K. Liu, Willy Susi...
ISW
2004
Springer
15 years 3 months ago
How to Break and Repair a Universally Composable Signature Functionality
Abstract. Canetti and Rabin recently proposed a universally composable ideal functionality FSIG for digital signatures. We show that this functionality cannot be securely realized ...
Michael Backes, Dennis Hofheinz
PKC
2007
Springer
160views Cryptology» more  PKC 2007»
15 years 3 months ago
Anonymous Signatures Made Easy
Abstract. At PKC 2006, Yang, Wong, Deng and Wang proposed the notion of anonymous signature schemes where signatures do not reveal the signer’s identity, as long as some parts of...
Marc Fischlin
CTRSA
2005
Springer
221views Cryptology» more  CTRSA 2005»
15 years 3 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