64 search results - page 6 / 13 » Proxy Cryptography Revisited |
EUROCRYPT
2004
Springer
14 years 28 days ago
2004
Springer
At Eurocrypt ’96, Coppersmith proposed an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction techniques. But the approach is...
CCS
2001
ACM
14 years 1 days ago
2001
ACM
Authenticating mobile computing users can require a significant amount of processing and communications resources— particularly when protocols based on public key encryption are...
EUROCRYPT
2004
Springer
14 years 28 days ago
2004
Springer
For the last two decades the notion and implementations of proxy signatures have been used to allow transfer of digital signing power within some context (in order to enable flexi...
FSE
2009
Springer
14 years 8 months ago
2009
Springer
We revisit the rate-1 blockcipher based hash functions as first studied by Preneel, Govaerts and Vandewalle (Crypto'93) and later extensively analysed by Black, Rogaway and Sh...
EUROCRYPT
2003
Springer
14 years 23 days ago
2003
Springer
Abstract. We generalize the Weil descent construction of the GHS attack to arbitrary Artin-Schreier extensions. We give a formula for the characteristic polynomial of Frobenius of ...