Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

PKC

1999

Springer

1999

Springer

One of the key directions in complexity theory which has also ﬁltered through to cryptographic research, is the eﬀort to classify related but seemingly distinct notions. Separation or reduction arguments are the basic means for this classiﬁcation. Continuing this direction we identify a class of problems, called “matching problems,” which are related to the class of “decision problems.” In many cases, these classes are neither trivially equivalent nor distinct. Brieﬂy, a “decision” problem consists of one instance and a supposedly related image of this instance; the problem is to decide whether the instance and the image indeed satisfy the given predicate. In a “matching” problem two such pairs of instances-images are given, and the problem is to “match” or “distinguish” which image corresponds to which instance. Clearly the decision problem is more diﬃcult, since given a “decision” oracle one can simply test each of the two images to be matched ag...

Added |
04 Aug 2010 |

Updated |
04 Aug 2010 |

Type |
Conference |

Year |
1999 |

Where |
PKC |

Authors |
Helena Handschuh, Yiannis Tsiounis, Moti Yung |

Comments (0)