2478 search results - page 74 / 496 » Message from the Chair |
137
click to vote
PROVSEC
2010
Springer
15 years 1 months ago
2010
Springer
Generic constructions of designated confirmer signatures follow one of the following two strategies; either produce a digital signature on the message to be signed, then encrypt th...
128
click to vote
CRYPTO
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We propose a new and efficient signature scheme that is provably secure in the plain model. The security of our scheme is based on a discrete-logarithm-based assumption p...
107
click to vote
CIE
2008
Springer
15 years 6 months ago
2008
Springer
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
161
click to vote
IJNSEC
2011
14 years 11 months ago
2011
We first analyze the security of a short signature scheme without random oracles called ZCSM scheme and point out that it cannot support unforgeable under the chosen message and ...
134
click to vote
PUC
2007
15 years 3 months ago
2007
One of the tropes of the age of ubiquitous computing is the migration of computation into new spaces. Domestic environments have been a particular focus of attention for many. Howe...