Sciweavers

55 search results - page 3 / 11
» On the Minimal Assumptions of Group Signature Schemes
Sort
View
IJNSEC
2011
143views more  IJNSEC 2011»
13 years 28 days ago
Probable Security Proof of A Blind Signature Scheme over Braid Groups
In this paper, we reinvestigate the security analysis of blind signature scheme over braid groups proposed by Verma in 2008. A blind signature scheme is a cryptographic primitive ...
Girraj Kumar Verma
EUROCRYPT
2006
Springer
13 years 9 months ago
Compact Group Signatures Without Random Oracles
We present the first efficient group signature scheme that is provably secure without random oracles. We achieve this result by combining provably secure hierarchical signatures i...
Xavier Boyen, Brent Waters
IIWAS
2004
13 years 7 months ago
An Efficient Group Signature Based on the Discrete Logarithm Problem
Group signature schemes permit a group member signing on messages anonymously and unlinkably on behalf of a group. The anonymity can be revoked when arguments occurred. This paper...
Fuw-Yi Yang, Jinn-ke Jan
INDOCRYPT
2005
Springer
13 years 11 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
ICCSA
2005
Springer
13 years 11 months ago
Security Flaws in Several Group Signatures Proposed by Popescu
In resent years, Popescu proposed several group signature schemes based on the Okamoto-Shiraishi assumption in [8–11], and claimed his schemes are secure. However, this paper dem...
Guilin Wang, Sihan Qing