96 search results - page 20 / 20 » Solving the Satisfiability Problem Using Finite Learning Aut... |
CCS
2008
ACM
13 years 7 months ago
2008
ACM
In 1998, Blaze, Bleumer, and Strauss suggested a cryptographic primitive termed proxy re-signature in which a proxy transforms a signature computed under Alice's secret key in...