2967 search results - page 363 / 594 » Cryptology |
155
click to vote
ACNS
2008
Springer
15 years 8 months ago
2008
Springer
The conjugacy search problem in a group G is the problem of recovering an x G from given g G and h = x-1 gx. The alleged computational hardness of this problem in some groups was...
151
click to vote
AFRICACRYPT
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. In the context of iterated hash functions, "dithering" designates the technique of adding an iteration-dependent input to the compression function in order to d...
166
click to vote
ASIACRYPT
2008
Springer
15 years 8 months ago
2008
Springer
This paper introduces fast algorithms for performing group operations on twisted Edwards curves, pushing the recent speed limits of Elliptic Curve Cryptography (ECC) forward in a ...
159
click to vote
ASIACRYPT
2008
Springer
15 years 8 months ago
2008
Springer
Optimistic fair exchange (OFE) is a protocol for solving the problem of exchanging items or services in a fair manner between two parties, a signer and a verifier, with the help o...
153
click to vote
ASIACRYPT
2008
Springer
15 years 8 months ago
2008
Springer
In a proof-of-retrievability system, a data storage center must prove to a verifier that he is actually storing all of a client's data. The central challenge is to build syst...