186 search results - page 10 / 38 » Signature Schemes Based on the Strong RSA Assumption |
72
Voted
STOC
2003
ACM
15 years 12 months ago
2003
ACM
We consider non-malleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model. We show how to construct non-interactive NM commitmen...
ISW
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Chameleon signatures are based on well established hashand-sign paradigm, where a chameleon hash function is used to compute the cryptographic message digest. Chameleon s...
127
Voted
ASIACRYPT
2001
Springer
15 years 3 months ago
2001
Springer
Abstract. We introduce a short signature scheme based on the Computational Diffie-Hellman assumption on certain elliptic and hyper-elliptic curves. The signature length is half the...
EUROCRYPT
2004
Springer
15 years 5 months ago
2004
Springer
An aggregate signature scheme (recently proposed by Boneh, Gentry, Lynn, and Shacham) is a method for combining n signatures from n different signers on n different messages int...
ASIACRYPT
2010
Springer
14 years 9 months ago
2010
Springer
Group signature schemes allow users to sign messages on behalf of a group while (1) maintaining anonymity (within that group) with respect to an observer, yet (2) ensuring traceab...