48 search results - page 4 / 10 » Probabilistically Checkable Proofs and Applications |
116
click to vote
EUROCRYPT
2008
Springer
15 years 4 months ago
2008
Springer
A shuffle of a set of ciphertexts is a new set of ciphertexts with the same plaintexts in permuted order. Shuffles of homomorphic encryptions are a key component in mix-nets, whic...
112
click to vote
JLP
2008
15 years 2 months ago
2008
We demonstrate a method for describing data-flow analyses based program optimizations as compositional type systems with a transformation component. Analysis results are presented...
122
click to vote
APPROX
2005
Springer
15 years 8 months ago
2005
Springer
An error-correcting code is said to be locally testable if it has an efficient spot-checking procedure that can distinguish codewords from strings that are far from every codeword...
143
click to vote
FOCS
1995
IEEE
15 years 6 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
101
Voted
ECCC
2010
15 years 3 months ago
2010
A linear code is said to be affine-invariant if the coordinates of the code can be viewed as a vector space and the code is invariant under an affine transformation of the coordin...