Sciweavers

324 search results - page 12 / 65
» A new signature scheme without random oracles
Sort
View
CISC
2007
Springer
117views Cryptology» more  CISC 2007»
13 years 11 months ago
An Efficient ID-Based Proxy Signature Scheme from Pairings
This paper proposes a new ID-based proxy signature scheme based on the bilinear pairings. The number of paring operation involved in the verification procedure of our scheme is onl...
Chunxiang Gu, Yuefei Zhu
INDOCRYPT
2007
Springer
14 years 1 months ago
Proxy Re-signature Schemes Without Random Oracles
Jun Shao, Zhenfu Cao, Licheng Wang, Xiaohui Liang
CCS
1999
ACM
13 years 11 months ago
Signature Schemes Based on the Strong RSA Assumption
We describe and analyze a new digital signature scheme. The new scheme is quite efficient, does not require the the signer to maintain any state, and can be proven secure against ...
Ronald Cramer, Victor Shoup
EUROCRYPT
2010
Springer
13 years 7 months ago
On the Impossibility of Three-Move Blind Signature Schemes
We investigate the possibility to prove security of the well-known blind signature schemes by Chaum, and by Pointcheval and Stern in the standard model, i.e., without random oracle...
Marc Fischlin, Dominique Schröder
CCS
2010
ACM
14 years 2 months ago
Attribute-based signature and its applications
In an attribute-based signature (ABS), users sign messages with any predicate of their attributes issued from an attribute authority. Under this notion, a signature attests not to...
Jin Li, Man Ho Au, Willy Susilo, Dongqing Xie, Kui...