Sciweavers

534 search results - page 17 / 107
» Power from Random Strings
Sort
View
EUROCRYPT
2010
Springer
13 years 10 months ago
Constructing Verifiable Random Functions with Large Input Spaces
We present a family of verifiable random functions which are provably secure for exponentially-large input spaces under a non-interactive complexity assumption. Prior construction...
Susan Hohenberger, Brent Waters
DLT
2004
13 years 8 months ago
On Competence in CD Grammar Systems
Abstract. We investigate the generative power of cooperating distributed grammar systems (CDGSs), if the cooperation protocol is based on the level of competence on the underlying ...
Maurice H. ter Beek, Erzsébet Csuhaj-Varj&u...
CRYPTO
2001
Springer
125views Cryptology» more  CRYPTO 2001»
13 years 12 months ago
Robust Non-interactive Zero Knowledge
Abstract. Non-Interactive Zero Knowledge (NIZK), introduced by Blum, Feldman, and Micali in 1988, is a fundamental cryptographic primitive which has attracted considerable attentio...
Alfredo De Santis, Giovanni Di Crescenzo, Rafail O...
CHES
2000
Springer
135views Cryptology» more  CHES 2000»
13 years 11 months ago
Differential Power Analysis in the Presence of Hardware Countermeasures
Abstract. The silicon industry has lately been focusing on side channel attacks, that is attacks that exploit information that leaks from the physical devices. Although different c...
Christophe Clavier, Jean-Sébastien Coron, N...
APPROX
2007
Springer
77views Algorithms» more  APPROX 2007»
14 years 1 months ago
High Entropy Random Selection Protocols
We study the two party problem of randomly selecting a string among all the strings of length n. We want the protocol to have the property that the output distribution has high en...
Harry Buhrman, Matthias Christandl, Michal Kouck&y...