Sciweavers

209 search results - page 6 / 42
» Secure Hash-and-Sign Signatures Without the Random Oracle
Sort
View
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
CORR
2000
Springer
93views Education» more  CORR 2000»
13 years 7 months ago
The Random Oracle Methodology, Revisited
We take a critical look at the relationship between the security of cryptographic schemes in the Random Oracle Model, and the security of the schemes that result from implementing...
Ran Canetti, Oded Goldreich, Shai Halevi
IJNSEC
2008
112views more  IJNSEC 2008»
13 years 7 months 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
EUROCRYPT
2001
Springer
13 years 12 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
IJNSEC
2011
128views more  IJNSEC 2011»
13 years 2 months ago
Certificateless Group Oriented Signature Secure Against Key Replacement Attack
Since Al-Riyami and Paterson presented certificateless cryptography, many certificateless schemes have been proposed for different purposes. In this paper, we present a certificate...
Chunbo Ma, Jun Ao