4 search results - page 1 / 1 » On the Compressibility of NP Instances and Cryptographic App... |
FOCS
2006
IEEE
14 years 5 months ago
2006
IEEE
We study compression that preserves the solution to an instance of a problem rather than preserving the instance itself. Our focus is on the compressibility of NP decision problem...
ECCC
2007
13 years 11 months ago
2007
A central line of research in the area of PCPs is devoted to constructing short PCPs. In this paper, we show that if we allow an additional interactive verification phase, with v...
ACISP
2008
Springer
14 years 5 months ago
2008
Springer
LAKE is a family of cryptographic hash functions presented at FSE 2008. It is an iterated hash function and defines two main instances with a 256 bit and 512 bit hash value. In th...
CORR
2006
Springer
13 years 11 months ago
2006
Springer
We consider a type of zero-knowledge protocols that are of interest for their practical applications within networks like the Internet: efficient zero-knowledge arguments of knowl...