29 search results - page 5 / 6 » Homomorphic Signatures for Polynomial Functions |
ATAL
2010
Springer
13 years 8 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
CHES
2009
Springer
14 years 8 months ago
2009
Springer
Fault attacks exploit hardware malfunctions to recover secrets from embedded electronic devices. In the late 90's, Boneh, DeMillo and Lipton [6] introduced fault-based attacks...
ASIACRYPT
2008
Springer
13 years 9 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...
COCO
2007
Springer
13 years 11 months ago
2007
Springer
Current constructions of efficient argument systems combine a short (polynomial size) PCP with a cryptographic hashing technique. We suggest an alternative approach for this probl...
ECCC
2007
13 years 7 months ago
2007
We show how to construct a variety of “trapdoor” cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the sho...