Sciweavers

87 search results - page 3 / 18
» A Verifiable Random Function with Short Proofs and Keys
Sort
View
JOC
2011
104views more  JOC 2011»
14 years 13 days ago
Short Undeniable Signatures Based on Group Homomorphisms
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...
Jean Monnerat, Serge Vaudenay
EVOW
2009
Springer
15 years 4 months ago
Elevated Pitch: Automated Grammatical Evolution of Short Compositions
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...
John Reddin, James McDermott, Michael O'Neill
CRYPTO
2001
Springer
106views Cryptology» more  CRYPTO 2001»
15 years 2 months ago
Forward-Secure Signatures with Optimal Signing and Verifying
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...
Gene Itkis, Leonid Reyzin
ACNS
2004
Springer
133views Cryptology» more  ACNS 2004»
15 years 1 months ago
Limited Verifier Signature from Bilinear Pairings
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...
Xiaofeng Chen, Fangguo Zhang, Kwangjo Kim
TCC
2004
Springer
100views Cryptology» more  TCC 2004»
15 years 2 months ago
On the Random-Oracle Methodology as Applied to Length-Restricted Signature Schemes
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...
Ran Canetti, Oded Goldreich, Shai Halevi