68 search results - page 8 / 14 » Ring signatures without random oracles |
IJNSEC
2008
13 years 7 months ago
2008
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...
CRYPTO
2001
Springer
13 years 12 months ago
2001
Springer
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...
ASIACRYPT
2011
Springer
12 years 7 months ago
2011
Springer
We provide constructions of (m, 1)-programmable hash functions (PHFs) for m ≥ 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into ...
CRYPTO
2005
Springer
14 years 1 months ago
2005
Springer
We investigate several previously suggested scenarios of instantiating random oracles (ROs) with “realizable” primitives in cryptographic schemes. As candidates for such “in...
CISC
2008
Springer
13 years 9 months ago
2008
Springer
One of the important applications of digital signature is anonymous credential or pseudonym system. In these scenarios, it is essential that the identity of the signer is kept secr...