Sciweavers

24 search results - page 3 / 5
» Short Signatures from Weaker Assumptions
Sort
View
EUROCRYPT
2004
Springer
13 years 12 months ago
Concurrent Signatures
We introduce the concept of concurrent signatures. These allow two entities to produce two signatures in such a way that, from the point of view of any third party, both signatures...
Liqun Chen, Caroline Kudla, Kenneth G. Paterson
ASIACRYPT
2000
Springer
13 years 10 months ago
Unconditionally Secure Digital Signature Schemes Admitting Transferability
A potentially serious problem with current digital signature schemes is that their underlying hard problems from number theory may be solved by an innovative technique or a new gen...
Goichiro Hanaoka, Junji Shikata, Yuliang Zheng, Hi...
CCS
2010
ACM
13 years 6 months ago
Synchronized aggregate signatures: new definitions, constructions and applications
An aggregate signature scheme is a digital signature scheme where anyone given n signatures on n messages from n users can aggregate all these signatures into a single short signa...
Jae Hyun Ahn, Matthew Green, Susan Hohenberger
PKC
2007
Springer
99views Cryptology» more  PKC 2007»
14 years 18 days ago
Full-Domain Subgroup Hiding and Constant-Size Group Signatures
We give a short constant-size group signature scheme, which we prove fully secure under reasonable assumptions in bilinear groups, in the standard model. We achieve this result by ...
Xavier Boyen, Brent Waters
ICS
2010
Tsinghua U.
14 years 3 months ago
Proof-Carrying Data and Hearsay Arguments from Signature Cards
: Design of secure systems can often be expressed as ensuring that some property is maintained at every step of a distributed computation among mutually-untrusting parties. Special...
Alessandro Chiesa, Eran Tromer