Sciweavers

324 search results - page 17 / 65
» A new signature scheme without random oracles
Sort
View
EUROCRYPT
2004
Springer
14 years 23 days ago
Sequential Aggregate Signatures from Trapdoor Permutations
An aggregate signature scheme (recently proposed by Boneh, Gentry, Lynn, and Shacham) is a method for combining n signatures from n different signers on n different messages int...
Anna Lysyanskaya, Silvio Micali, Leonid Reyzin, Ho...
CRYPTO
2001
Springer
106views Cryptology» more  CRYPTO 2001»
13 years 12 months ago
Forward-Secure Signatures with Optimal Signing and Verifying
We propose the first forward-secure signature scheme for which both signing and verifying are as efficient as for one of the most efficient ordinary signature schemes (Guillou-Qui...
Gene Itkis, Leonid Reyzin
EUROCRYPT
1998
Springer
13 years 11 months ago
Strengthened Security for Blind Signatures
Abstract. Provable security is a very nice property for cryptographic protocols. Unfortunately, in many cases, this is at the cost of a considerable loss in terms of efficiency. Mo...
David Pointcheval
SCN
2010
Springer
176views Communications» more  SCN 2010»
13 years 5 months ago
The Fiat-Shamir Transform for Group and Ring Signature Schemes
The Fiat-Shamir (FS) transform is a popular tool to produce particularly efficient digital signature schemes out of identification protocols. It is known that the resulting signat...
Ming-Feng Lee, Nigel P. Smart, Bogdan Warinschi
CTRSA
2007
Springer
171views Cryptology» more  CTRSA 2007»
13 years 9 months ago
Compact E-Cash from Bounded Accumulator
Abstract. Known compact e-cash schemes are constructed from signature schemes with efficient protocols and verifiable random functions. In this paper, we introduce a different ap...
Man Ho Au, Qianhong Wu, Willy Susilo, Yi Mu