Sciweavers

242 search results - page 8 / 49
» Randomness in Cryptography
Sort
View
ICS
2010
Tsinghua U.
15 years 9 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
CRYPTO
2009
Springer
145views Cryptology» more  CRYPTO 2009»
15 years 6 months ago
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
We study the design of cryptographic primitives resilient to key-leakage attacks, where an attacker can repeatedly and adaptively learn information about the secret key, subject o...
Joël Alwen, Yevgeniy Dodis, Daniel Wichs
FOCS
2007
IEEE
15 years 6 months ago
Cryptography from Sunspots: How to Use an Imperfect Reference String
The Common Reference String (CRS) model equips all protocol participants with a common string that is sampled from a pre-specified distribution, say the uniform distribution. Thi...
Ran Canetti, Rafael Pass, Abhi Shelat
CHES
2003
Springer
114views Cryptology» more  CHES 2003»
15 years 5 months ago
True Random Number Generators Secure in a Changing Environment
A true random number generator (TRNG) usually consists of two components: an “unpredictable” source with high entropy, and a randomness extractor — a function which, when app...
Boaz Barak, Ronen Shaltiel, Eran Tromer
CHES
2009
Springer
150views Cryptology» more  CHES 2009»
16 years 8 days ago
An Efficient Method for Random Delay Generation in Embedded Software
Random delays are a countermeasure against a range of side channel and fault attacks that is often implemented in embedded software. We propose a new method for generation of rando...
Ilya Kizhvatov, Jean-Sébastien Coron