Results 1  10
of
236
The Complexity of Local List Decoding
"... We study the complexity of locally listdecoding binary error correcting codes with good parameters (that are polynomially related to information theoretic bounds). We show that computing majority over Θ(1/ǫ) bits is essentially equivalent to locally listdecoding binary codes from relative distance ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
on the complexity of uniform (and even somewhat nonuniform) fullyblackbox worstcase to averagecase reductions. Very recently, Shaltiel and Viola [SV08] independently obtained similar limitations for completely nonuniform fullyblackbox worstcase to averagecase reductions, but only for the special case
WorstCase to AverageCase Reductions Revisited
"... A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomialtime samplable distribution (e.g., the uniform distribution) and a language in NTIME(f(n)) for some polynomial function f, such that the language is hard on the average with respect to this dis ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
by the negative result. This gives rise to an intriguing new notion of (almost blackbox) reductions. After extending the negative results to the nonstandard averagecase setting of [GSTS05], we ask whether their positive result can be extended to the standard setting, to prove some new worstcase/averagecase
Efficient collisionresistant hashing from worstcase assumptions on cyclic lattices
 In TCC
, 2006
"... Abstract The generalized knapsack function is defined as fa(x) = Pi ai * xi, where a = (a1,..., am)consists of m elements from some ring R, and x = (x1,..., xm) consists of m coefficients froma specified subset S ` R. Micciancio (FOCS 2002) proposed a specific choice of the ring R andsubset S for w ..."
Abstract

Cited by 61 (16 self)
 Add to MetaCart
typically must be invoked many times in their applications (at least when used in a blackbox way) [9].
Nonuniform hardness for np via blackbox adversaries
 In Proceedings of the 21th Annual IEEE Conference on Computational Complexity
, 2006
"... We may believe SAT does not have small Boolean circuits. But is it possible that some language with small circuits looks indistiguishable from SAT to every polynomialtime bounded adversary? We rule out this possibility. More precisely, assuming SAT does not have small circuits, we show that for eve ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
, and TaShma reducing averagecase hardness to worstcase hardness via uniform adversaries that know the algorithm they fool. The new adversary we construct has the feature of being blackbox on the algorithm it fools, so it makes sense in the nonuniform setting as well. Our proof makes use of a refined
New connections between derandomization, worstcase complexity and averagecase complexity
 Electronic Colloquium on Computational Complexity
, 2006
"... We show that a mild derandomization assumption together with the worstcase hardness of NP implies the averagecase hardness of a language in nondeterministic quasipolynomial time. Previously such connections were only known for high classes such as EXP and PSPACE. There has been a long line of re ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
of research trying to explain our failure in proving worstcase to averagecase reductions within NP [FF93, Vio03, BT03, AGGM06]. The bottom line of this research is essentially that (under plausible assumptions) blackbox techniques cannot prove such results. Indeed, our proof is not blackbox, as it uses a
Relativized separations of worstcase and averagecase complexities for NP
 In IEEE Conference on Computational Complexity
, 2011
"... AbstractNonrelativization of complexity issues can be interpreted as showing that these issues cannot be resolved by "blackbox" techniques. We show that the assumption DistN P ⊆ AvgP does not imply that N P ⊆ BP P by relativizing techniques. More precisely, we give an oracle relative t ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
AbstractNonrelativization of complexity issues can be interpreted as showing that these issues cannot be resolved by "blackbox" techniques. We show that the assumption DistN P ⊆ AvgP does not imply that N P ⊆ BP P by relativizing techniques. More precisely, we give an oracle relative
Examination of NonUniform Distribution of Current on WorstCase Crosstalk Noise for Distributed RLC Interconnect
"... Abstract Considering circuit designs at the deep submicron level, the more that interconnect wires of small cross section are packed closer together, coupled with longer length of interconnect and an increase in the number of layers of interconnect may cause different parts of an interconnect line ..."
Abstract
 Add to MetaCart
line to experience a varying degree of coupling effect from other interconnects, with the consequent variation in the inducedcurrent across the interconnect. An analytical model to examine the effect of nonuniform distribution of current on the mutual inductance and capacitance between on
4 Optimal CSMAbased Wireless Communication with Worstcase Delay and Nonuniform Sizes
"... ar ..."
Nonuniform Fast Fourier Transforms Using MinMax Interpolation
 IEEE Trans. Signal Process
, 2003
"... The FFT is used widely in signal processing for efficient computation of the Fourier transform (FT) of finitelength signals over a set of uniformlyspaced frequency locations. However, in many applications, one requires nonuniform sampling in the frequency domain, i.e.,a nonuniform FT . Several pap ..."
Abstract

Cited by 126 (22 self)
 Add to MetaCart
papers have described fast approximations for the nonuniform FT based on interpolating an oversampled FFT. This paper presents an interpolation method for the nonuniform FT that is optimal in the minmax sense of minimizing the worstcase approximation error over all signals of unit norm. The proposed
Overcoming the worstcase curse for cryptographic constructions. IACR Cryptology ePrint Archive
, 2013
"... Modeling efficient algorithms as polynomial size circuits rather than as polynomial time Turing machines has been the rule with few exceptions in cryptographic constructions which provide “secure versions ” of general efficient algorithms. A consequence of this modeling is that the resulting “secure ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of the Turing machine (and does not depend on its runtime). Moreover, the decryption algorithm has inputspecific runtime (as opposed to worstcase). • A singlekey functional encryption scheme (FE) for any polynomialtime Turing machines (uniform or nonuniform), where the length of the function keys (or
Results 1  10
of
236