Automatic taxonomy generation: Issues and possibilities
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
At Crypto 96 Cramer and Damgård proposed an efficient, tree-based, signature scheme that is provably secure against adaptive chosen message attacks under the assumption that inverting RSA is computationally infeasible. In this paper we show how to modify their basic construction in order to achieve a scheme that is provably secure under the assumption that factoring large composites of a certain form is hard. Our scheme is as efficient as the original Cramer Damgård solution while relying on a seemingly weaker intractability assumption. © 2006 Elsevier Ltd. All rights reserved.
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
Yun Mao, Hani Jamjoom, et al.
CoNEXT 2006
B.K. Boguraev, Mary S. Neff
HICSS 2000
Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010