87 search results - page 3 / 18 » A Verifiable Random Function with Short Proofs and Keys |
102
click to vote
JOC
2011
14 years 2 months ago
2011
This paper is devoted to the design and analysis of short undeniable signatures based on a random oracle. Exploiting their online property, we can achieve signatures with a fully s...
EVOW
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. A system for automatic composition using grammatical evolution is presented. Compositions are created under the constraints of a generative grammar, and under the bias of...
CRYPTO
2001
Springer
15 years 4 months ago
2001
Springer
We propose the first forward-secure signature scheme for which both signing and verifying are as efficient as for one of the most efficient ordinary signature schemes (Guillou-Qui...
ACNS
2004
Springer
15 years 3 months ago
2004
Springer
Motivated by the conflict between authenticity and privacy in the digital signature, the notion of limited verifier signature was introduced [1]. The signature can be verified by a...
TCC
2004
Springer
15 years 5 months ago
2004
Springer
In earlier work, we described a “pathological” example of a signature scheme that is secure in the Random Oracle Model, but for which no secure implementation exists. For that...