Sciweavers

112 search results - page 10 / 23
» Short Randomizable Signatures
Sort
View
IJNSEC
2007
118views more  IJNSEC 2007»
13 years 7 months ago
Code-based Ring Signature Scheme
McEliece is one of the oldest known public key cryptosystems, however it was not quite as successful as RSA. One main reason is that it is widely believed that code-based cryptosy...
Dong Zheng, Xiangxue Li, Kefei Chen
CTRSA
2005
Springer
221views Cryptology» more  CTRSA 2005»
14 years 1 months ago
Accumulators from Bilinear Pairings and Applications
We propose a dynamic accumulator scheme from bilinear pairings, whose security is based on the Strong Diļ¬ƒe-Hellman assumption. We show applications of this accumulator in constru...
Lan Nguyen
CCS
2010
ACM
13 years 7 months ago
Synchronized aggregate signatures: new definitions, constructions and applications
An aggregate signature scheme is a digital signature scheme where anyone given n signatures on n messages from n users can aggregate all these signatures into a single short signa...
Jae Hyun Ahn, Matthew Green, Susan Hohenberger
ASIACRYPT
2004
Springer
14 years 26 days ago
Generic Homomorphic Undeniable Signatures
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Diļ¬...
Jean Monnerat, Serge Vaudenay
TCC
2004
Springer
100views Cryptology» more  TCC 2004»
14 years 24 days ago
On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes
In earlier work, we described a ā€œpathologicalā€ example of a signature scheme that is secure in the Random Oracle Model, but for which no secure implementation exists. For that...
Ran Canetti, Oded Goldreich, Shai Halevi