Sciweavers

112 search results - page 6 / 23
» Short Randomizable Signatures
Sort
View
PKC
2005
Springer
125views Cryptology» more  PKC 2005»
14 years 28 days ago
A Generic Scheme Based on Trapdoor One-Way Permutations with Signatures as Short as Possible
We answer the open question of the possibility of building a digital signature scheme with proven security based on the one-wayness of a trapdoor permutation and with signatures as...
Louis Granboulan
CCS
2004
ACM
13 years 11 months ago
Group signatures with verifier-local revocation
Group signatures have recently become important for enabling privacy-preserving attestation in projects such as Microsoft's ngscb effort (formerly Palladium). Revocation is c...
Dan Boneh, Hovav Shacham
PROVSEC
2009
Springer
14 years 2 months ago
Anonymous Signatures Revisited
Abstract. We revisit the notion of the anonymous signature, first formalized by Yang, Wong, Deng and Wang [12], and then further developed by Fischlin [6] and Zhang and Imai [13]. ...
Vishal Saraswat, Aaram Yun
PKC
2009
Springer
142views Cryptology» more  PKC 2009»
14 years 8 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
FLAIRS
2003
13 years 8 months ago
Multi-Document Summaries Based on Semantic Redundancy
This paper presents a technique for producing short summaries from multiple documents. This technique promotes the belief that informative short summaries may be generated when us...
Sanda M. Harabagiu, V. Finley Lacatusu, Steven J. ...