Sciweavers

24 search results - page 5 / 5
» ctrsa 2007
Sort
View
CTRSA
2007
Springer
146views Cryptology» more  CTRSA 2007»
13 years 11 months ago
How to Strengthen Any Weakly Unforgeable Signature into a Strongly Unforgeable Signature
Standard signature schemes are usually designed only to achieve weak unforgeability – i.e. preventing forgery of signatures on new messages not previously signed. However, most s...
Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang
CTRSA
2009
Springer
151views Cryptology» more  CTRSA 2009»
13 years 11 months ago
Key-Private Proxy Re-encryption
Proxy re-encryption (PRE) allows a proxy to convert a ciphertext encrypted under one key into an encryption of the same message under another key. The main idea is to place as lit...
Giuseppe Ateniese, Karyn Benson, Susan Hohenberger
CTRSA
2009
Springer
141views Cryptology» more  CTRSA 2009»
13 years 8 months ago
Practical Short Signature Batch Verification
In many applications, it is desirable to work with signatures that are both short, and yet where many messages from different signers be verified very quickly. RSA signatures sati...
Anna Lisa Ferrara, Matthew Green, Susan Hohenberge...
IACR
2011
104views more  IACR 2011»
12 years 4 months ago
Short Transitive Signatures for Directed Trees
A transitive signature scheme allows to sign a graph in such a way that, given the signatures of edges (a, b) and (b, c), it is possible to compute the signature for the edge (or ...
Philippe Camacho, Alejandro Hevia