Sciweavers

38 search results - page 2 / 8
» Random Oracles and Auxiliary Input
Sort
View
CCS
2007
ACM
13 years 11 months ago
Security under key-dependent inputs
In this work we re-visit the question of building cryptographic primitives that remain secure even when queried on inputs that depend on the secret key. This was investigated by B...
Shai Halevi, Hugo Krawczyk
SIROCCO
2010
13 years 6 months ago
Average Long-Lived Memoryless Consensus: The Three-Value Case
Abstract. We study strategies that minimize the instability of a faulttolerant consensus system. More precisely, we find the strategy than minimizes the number of output changes ov...
Ivan Rapaport, Eric Rémila
PODS
2005
ACM
164views Database» more  PODS 2005»
14 years 4 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt
ECCC
2010
122views more  ECCC 2010»
13 years 3 months ago
Query Complexity Lower Bounds for Reconstruction of Codes
We investigate the problem of local reconstruction, as defined by Saks and Seshadhri (2008), in the context of error correcting codes. The first problem we address is that of me...
Sourav Chakraborty, Eldar Fischer, Arie Matsliah
CORR
2010
Springer
142views Education» more  CORR 2010»
13 years 4 months ago
Capacity-Equivocation Region of the Gaussian MIMO Wiretap Channel
We study the Gaussian multiple-input multiple-output (MIMO) wiretap channel, which consists of a transmitter, a legitimate user, and an eavesdropper. In this channel, the transmit...
Ersen Ekrem, Sennur Ulukus