162 search results - page 20 / 33 » A Group Signature Scheme from Lattice Assumptions |
CCS
2008
ACM
15 years 24 days ago
2008
ACM
In 1998, Blaze, Bleumer, and Strauss suggested a cryptographic primitive termed proxy re-signature in which a proxy transforms a signature computed under Alice's secret key in...
114
click to vote
CTRSA
2009
Springer
15 years 2 months ago
2009
Springer
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...
IACR
2011
13 years 10 months ago
2011
In this paper, we explore a general methodology for converting composite order pairingbased cryptosystems into the prime order setting. We employ the dual pairing vector space app...
PKC
2005
Springer
15 years 4 months ago
2005
Springer
To sign with RSA, one usually encodes the message m as µ(m) and then raises the result to the private exponent modulo N. In Asiacrypt 2000, Coron et al. showed how to build a secu...
105
click to vote
CJ
2006
14 years 10 months ago
2006
Anonymous channels or similar techniques that can achieve sender's anonymity play important roles in many applications. However, they will be meaningless if cryptographic prim...