Sciweavers

26 search results - page 1 / 6
» Short Redactable Signatures Using Random Trees
Sort
View
CTRSA
2009
Springer
128views Cryptology» more  CTRSA 2009»
13 years 11 months ago
Short Redactable Signatures Using Random Trees
Abstract. A redactable signature scheme for a string of objects supports verification even if multiple substrings are removed from the original string. It is important that the re...
Ee-Chien Chang, Chee Liang Lim, Jia Xu
IJNSEC
2011
108views more  IJNSEC 2011»
12 years 11 months ago
Cryptanalysis and Fixed of Short Signature Scheme without Random Oracle from Bilinear Parings
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 ...
Mingwu Zhang, Bo Yang, Yusheng Zhong, Pengcheng Li...
IJNSEC
2008
112views more  IJNSEC 2008»
13 years 4 months ago
A New and Efficient Signature on Commitment Values
We present a new short signature scheme based on a variant of the Boneh-Boyen's short signatures schemes. Our short signature scheme is secure without requiring the random or...
Fangguo Zhang, Xiaofeng Chen, Yi Mu, Willy Susilo
CRYPTO
2004
Springer
118views Cryptology» more  CRYPTO 2004»
13 years 9 months ago
Short Group Signatures
ded abstract of this paper is to appear in Advances in Cryptology—CRYPTO 2004, Springer-Verlag. We construct a short group signature scheme. Signatures in our scheme are approxi...
Dan Boneh, Xavier Boyen, Hovav Shacham
PKC
2009
Springer
142views Cryptology» more  PKC 2009»
14 years 4 months ago
Identification of Multiple Invalid Signatures in Pairing-Based Batched Signatures
This paper describes new methods in pairing-based signature schemes for identifying the invalid digital signatures in a batch, after batch verification has failed. These methods ef...
Brian J. Matt