Sciweavers

162 search results - page 14 / 33
» A Group Signature Scheme from Lattice Assumptions
Sort
View
SCN
2008
Springer
105views Communications» more  SCN 2008»
14 years 10 months ago
Expressive Subgroup Signatures
In this work, we propose a new generalization of the notion of group signatures, that allows signers to cover the entire spectrum from complete disclosure to complete anonymity. Pr...
Xavier Boyen, Cécile Delerablée
EUROCRYPT
2010
Springer
15 years 3 months ago
Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
We develop an abstract framework that encompasses the key properties of bilinear groups of composite order that are required to construct secure pairing-based cryptosystems, and we...
David Mandell Freeman
CCS
2008
ACM
15 years 22 days ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
ICISC
2004
146views Cryptology» more  ICISC 2004»
15 years 3 days ago
Identity Based Threshold Ring Signature
In threshold ring signature schemes, any group of t entities spontaneously conscript arbitrarily n - t entities to generate a publicly verifiable t-out-of-n signature on behalf of ...
Sherman S. M. Chow, Lucas Chi Kwong Hui, Siu-Ming ...
SEC
2007
15 years 4 days ago
Security Remarks on a Convertible Nominative Signature Scheme
A nominative signature scheme allows a nominator (i.e. the signer) and a nominee (i.e. a designated verifier) to jointly generate and publish a signature so that only the nominee ...
Guilin Wang, Feng Bao