Abstract | ||
---|---|---|
A sanitizable signature scheme allows a signer to partially delegate signing rights on a message to another party, called a sanitizer. After the message is signed, the sanitizer can modify pre-determined parts of the message and generate a new signature on the sanitized message without interacting with the signer. At ACNS 2008, Canard et al. introduced trapdoor sanitizable signatures based on identity-based chameleon hashes, where the power of sanitization for a given signed message can be delegated to possibly several entities, by giving a trapdoor issued by the signer at any time. We present a generic construction of trapdoor sanitizable signatures from ordinary signature schemes. The construction is intuitively simple and answers the basic theoretic question about the minimal computational complexity assumption under which a trapdoor sanitizable signature exists; one-way functions imply trapdoor sanitizable signatures. |
Year | DOI | Venue |
---|---|---|
2010 | 10.1007/978-3-642-13708-2_4 | ACNS |
Keywords | Field | DocType |
one-way function,generic construction,ordinary signature scheme,sanitizable signature scheme,new signature,pre-determined part,minimal computational complexity assumption,basic theoretic question,identity-based chameleon hash,trapdoor sanitizable signature,one way function,computational complexity | Delegate,Computer science,Computer security,Theoretical computer science,Trapdoor function,Hash function,Aggregate signature,Oblivious transfer,Computational complexity theory | Conference |
Volume | ISSN | ISBN |
6123 | 0302-9743 | 3-642-13707-5 |
Citations | PageRank | References |
8 | 0.45 | 19 |
Authors | ||
3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Dae Hyun Yum | 1 | 315 | 24.95 |
Jae Woo Seo | 2 | 36 | 4.50 |
Pil Joong Lee | 3 | 1039 | 103.09 |