Sciweavers

38 search results - page 6 / 8
» Dining Cryptographers Revisited
Sort
View
CHES
2004
Springer
167views Cryptology» more  CHES 2004»
14 years 3 months ago
Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs
Strong public-key cryptography is often considered to be too computationally expensive for small devices if not accelerated by cryptographic hardware. We revisited this statement a...
Nils Gura, Arun Patel, Arvinderpal Wander, Hans Eb...
CTRSA
2010
Springer
172views Cryptology» more  CTRSA 2010»
14 years 4 months ago
Revisiting Higher-Order DPA Attacks:
Security devices are vulnerable to side-channel attacks that perform statistical analysis on data leaked from cryptographic computations. Higher-order (HO) attacks are a powerful a...
Benedikt Gierlichs, Lejla Batina, Bart Preneel, In...
ESAS
2004
Springer
14 years 3 months ago
Public Key Cryptography in Sensor Networks - Revisited
The common perception of public key cryptography is that it is complex, slow and power hungry, and as such not at all suitable for use in ultra-low power environments like wireless...
Gunnar Gaubatz, Jens-Peter Kaps, Berk Sunar
EUROPKI
2006
Springer
14 years 1 months ago
Short Linkable Ring Signatures Revisited
Ring signature is a group-oriented signature in which the signer can spontaneously form a group and generate a signature such that the verifier is convinced the signature was gener...
Man Ho Au, Sherman S. M. Chow, Willy Susilo, Patri...
STACS
2009
Springer
14 years 4 months ago
Generating Shorter Bases for Hard Random Lattices
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
Joël Alwen, Chris Peikert