Sciweavers

18 search results - page 3 / 4
» Password-Authenticated Key Exchange Based on RSA
Sort
View
189
Voted
GI
2004
Springer
15 years 11 months ago
A Low-Cost Solution for Frequent Symmetric Key Exchange in Ad-hoc Networks
: Next to authentication, secure key exchange is considered the most critical and complex issue regarding ad-hoc network security. We present a low-cost, (i.e. low hardware-complex...
Markus Volkmer, Sebastian Wallner
177
Voted
ARITH
1999
IEEE
15 years 10 months ago
Moduli for Testing Implementations of the RSA Cryptosystem
Comprehensive testing of any implementation of the RSA cryptosystem requires the use of a number of moduli with specific properties. It is shown how to generate a sufficient varie...
Colin D. Walter
160
Voted
DRM
2003
Springer
15 years 11 months ago
Breaking and repairing optimistic fair exchange from PODC 2003
In PODC 2003, Park, Chong, Siegel and Ray [22] proposed an optimistic protocol for fair exchange, based on RSA signatures. We show that their protocol is totally breakable already...
Yevgeniy Dodis, Leonid Reyzin
200
Voted
JOC
2007
133views more  JOC 2007»
15 years 5 months ago
Trapdoor Hard-to-Invert Group Isomorphisms and Their Application to Password-Based Authentication
In the security chain the weakest link is definitely the human one: human beings cannot remember long secrets and often resort to rather insecure solutions to keep track of their ...
Dario Catalano, David Pointcheval, Thomas Pornin
136
Voted
STOC
2003
ACM
110views Algorithms» more  STOC 2003»
16 years 6 months ago
Non-interactive and reusable non-malleable commitment schemes
We consider non-malleable (NM) and universally composable (UC) commitment schemes in the common reference string (CRS) model. We show how to construct non-interactive NM commitmen...
Ivan Damgård, Jens Groth