2492 search results - page 9 / 499 » On the General Signature Trees |
CTRSA
2007
Springer
14 years 1 months ago
2007
Springer
In 2002, Micali and Rivest raised an open problem as to whether directed transitive signatures exist or not. In 2003, Hohenberger formalized the necessary mathematical criteria for...
ASIACRYPT
2003
Springer
14 years 22 days ago
2003
Springer
This paper investigates some modular powering functions suitable for cryptography. It is well known that the Rabin encryption function is a 4-to-1 mapping and breaking its one-wayn...
CRYPTO
2006
Springer
13 years 11 months ago
2006
Springer
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
SOFSEM
2004
Springer
14 years 25 days ago
2004
Springer
We propose an efficient approach for finding relevant XML data twigs defined by unordered query tree specifications. We use the tree signatures as the index structure and find...
ICCCN
2007
IEEE
14 years 1 months ago
2007
IEEE
