106 search results - page 1 / 22 » Probabilistically Checkable Arguments |
COCO
2009
Springer
14 years 3 months ago
2009
Springer
Starting with Kilian (STOC ‘92), several works have shown how to use probabilistically checkable proofs (PCPs) and cryptographic primitives such as collision-resistant hashing to...
CRYPTO
2009
Springer
14 years 3 months ago
2009
Springer
EUROCRYPT
2008
Springer
13 years 10 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...
STACS
1997
Springer
14 years 21 days ago
1997
Springer
Various types of probabilistic proof systems have played a central role in the development of computer science in the last decade. In this exposition, we concentrate on three such...
SIAMCOMP
2008
13 years 8 months ago
2008
We give constructions of probabilistically checkable proofs (PCPs) of length n