Sciweavers

12 search results - page 3 / 3
» Verifying and decoding in constant depth
Sort
View
COCO
2010
Springer
168views Algorithms» more  COCO 2010»
13 years 6 months ago
A New Sampling Protocol and Applications to Basing Cryptographic Primitives on the Hardness of NP
We investigate the question of what languages can be decided efficiently with the help of a recursive collisionfinding oracle. Such an oracle can be used to break collisionresistan...
Iftach Haitner, Mohammad Mahmoody, David Xiao
ECCC
2007
86views more  ECCC 2007»
13 years 5 months ago
Interactive PCP
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...
Yael Tauman Kalai, Ran Raz