Sciweavers

909 search results - page 38 / 182
» Games for extracting randomness
Sort
View
FOCS
2002
IEEE
14 years 10 days ago
On the (non)Universality of the One-Time Pad
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...
Yevgeniy Dodis, Joel Spencer
CRV
2007
IEEE
161views Robotics» more  CRV 2007»
14 years 1 months ago
Dense Stereo Range Sensing with Marching Pseudo-Random Patterns
As an extension to classical structured lighting techniques, the use of bi-dimensional pseudo-random color codes is explored to perform range sensing with variable density from a ...
Danick Desjardins, Pierre Payeur
COCO
1994
Springer
140views Algorithms» more  COCO 1994»
13 years 11 months ago
Random Debaters and the Hardness of Approximating Stochastic Functions
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...
TWC
2010
13 years 2 months ago
Efficient Spectrum Leasing via Randomized Silencing of Secondary Users
In this paper, a primary (licensed) user leases part of its resources to independent secondary (unlicensed) terminals in exchange for a tariff in dollars per bit, under the constra...
Rocco Di Taranto, Petar Popovski, Osvaldo Simeone,...
FOCS
2009
IEEE
14 years 2 months ago
Extracting Correlations
Abstract— Motivated by applications in cryptography, we consider a generalization of randomness extraction and the related notion of privacy amplification to the case of two cor...
Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, A...