Sciweavers

85 search results - page 1 / 17
» Short Signatures Without Random Oracles
Sort
View
IJNSEC
2011
108views more  IJNSEC 2011»
12 years 12 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...
EUROCRYPT
2004
Springer
13 years 10 months ago
Short Signatures Without Random Oracles
We describe a short signature scheme that is strongly existentially unforgeable under an adaptive chosen message attack in the standard security model. Our construction works in g...
Dan Boneh, Xavier Boyen
INDOCRYPT
2005
Springer
13 years 10 months ago
Short Undeniable Signatures Without Random Oracles: The Missing Link
Abstract. We introduce a new undeniable signature scheme which is existentially unforgeable and anonymous under chosen message attacks in the standard model. The scheme is an embed...
Fabien Laguillaumie, Damien Vergnaud
ICICS
2007
Springer
13 years 11 months ago
Short Group Signature Without Random Oracles
Xiaohui Liang, Zhenfu Cao, Jun Shao, Huang Lin
CISC
2006
Springer
131views Cryptology» more  CISC 2006»
13 years 8 months ago
Efficient Intrusion-Resilient Signatures Without Random Oracles
Intrusion-resilient signatures are key-evolving protocols that extend the concepts of forward-secure and key-insulated signatures. As in the latter schemes, time is divided into di...
Benoît Libert, Jean-Jacques Quisquater, Moti...