26 search results - page 2 / 6 » Short Redactable Signatures Using Random Trees |
SPAA
2009
ACM
14 years 5 months ago
2009
ACM
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
TCC
2004
Springer
13 years 10 months ago
2004
Springer
In earlier work, we described a “pathological” example of a signature scheme that is secure in the Random Oracle Model, but for which no secure implementation exists. For that...
ACNS
2008
Springer
13 years 11 months ago
2008
Springer
We describe two new paradigms on how to obtain ordinary signatures that are secure against existential forgery under adaptively chosen message attacks (fully-secure, in short), fro...
CORR
2008
Springer
13 years 4 months ago
2008
Springer
The concept of universal designated verifier signatures was introduced by Steinfeld, Bull, Wang and Pieprzyk at Asiacrypt 2003. These signatures can be used as standard publicly ve...
LATINCRYPT
2010
13 years 3 months ago
2010
In this article, we propose a new lattice-based threshold ring signature scheme, modifying Aguilar’s code-based solution to use the short integer solution (SIS) problem as securi...