326 search results - page 14 / 66 » Digital Signature Scheme Based on a New Hard Problem |
EUROCRYPT
2011
Springer
12 years 11 months ago
2011
Springer
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an...
SCN
2004
Springer
14 years 27 days ago
2004
Springer
Chameleon signatures were introduced by Krawczyk and Rabin, being non-interactive signature schemes that provide non-transferability. However, that first construction employs a c...
PAIRING
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. This paper describes a new method in pairing-based signature schemes for identifying the invalid digital signatures in a batch after batch verification has failed. The me...
ASIACRYPT
2010
Springer
13 years 5 months ago
2010
Springer
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
ACISP
2004
Springer
14 years 29 days ago
2004
Springer
A new type of signature scheme, called NTRUSign, based on solving the approximately closest vector problem in a NTRU lattice was proposed at CT-RSA’03. However no security proof ...