Sciweavers

242 search results - page 4 / 49
» Randomness in Cryptography
Sort
View
CHES
2005
Springer
149views Cryptology» more  CHES 2005»
14 years 29 days ago
Resistance of Randomized Projective Coordinates Against Power Analysis
Embedded devices implementing cryptographic services are the result of a trade-off between cost, performance and security. Aside from flaws in the protocols and the algorithms us...
William Dupuy, Sébastien Kunz-Jacques
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 8 months ago
Non-malleable extractors and symmetric key cryptography from weak secrets
We study the question of basing symmetric key cryptography on weak secrets. In this setting, Alice and Bob share an n-bit secret W, which might not be uniformly random, but the ad...
Yevgeniy Dodis, Daniel Wichs
ASIACRYPT
2011
Springer
12 years 7 months ago
Resettable Cryptography in Constant Rounds - The Case of Zero Knowledge
A fundamental question in cryptography deals with understanding the role that randomness plays in cryptographic protocols and to what extent it is necessary. One particular line o...
Yi Deng, Dengguo Feng, Vipul Goyal, Dongdai Lin, A...
CRYPTO
2006
Springer
110views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
On the Power of the Randomized Iterate
We consider two of the most fundamental theorems in Cryptography. The first, due to H
Iftach Haitner, Danny Harnik, Omer Reingold
DEPCOS
2008
IEEE
156views Hardware» more  DEPCOS 2008»
14 years 1 months ago
A True Random Number Generator with Built-in Attack Detection
True random number generators (TRNGs) are extensively used in cryptography, simulations and statistics. Metastability is a way to generate true random numbers. By using electromag...
Bernhard Fechner, Andre Osterloh