Sciweavers

117 search results - page 12 / 24
» Short Group Signature Without Random Oracles
Sort
View
IJNSEC
2008
129views more  IJNSEC 2008»
13 years 7 months ago
Repairing Efficient Threshold Group Signature Scheme
To enhance the efficiency of threshold group signature schemes, Yu and Chen, recently, proposed an efficient threshold group signature scheme. By using elliptic curves, the propos...
Zuhua Shao
CRYPTO
2001
Springer
97views Cryptology» more  CRYPTO 2001»
13 years 12 months ago
Two-Party Generation of DSA Signatures
d Abstract) Philip MacKenzie and Michael K. Reiter Bell Labs, Lucent Technologies, Murray Hill, NJ, USA We describe a means of sharing the DSA signature function, so that two parti...
Philip D. MacKenzie, Michael K. Reiter
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
CTRSA
2009
Springer
141views Cryptology» more  CTRSA 2009»
13 years 11 months ago
Practical Short Signature Batch Verification
In many applications, it is desirable to work with signatures that are both short, and yet where many messages from different signers be verified very quickly. RSA signatures sati...
Anna Lisa Ferrara, Matthew Green, Susan Hohenberge...
CRYPTO
2005
Springer
144views Cryptology» more  CRYPTO 2005»
14 years 28 days ago
Analysis of Random Oracle Instantiation Scenarios for OAEP and Other Practical Schemes
We investigate several previously suggested scenarios of instantiating random oracles (ROs) with “realizable” primitives in cryptographic schemes. As candidates for such “in...
Alexandra Boldyreva, Marc Fischlin