165 search results - page 2 / 33 » Cryptographic Complexity Classes and Computational Intractab... |
82
Voted
EUROCRYPT
1999
Springer
15 years 1 months ago
1999
Springer
We present a single-database computationally private information retrieval scheme with polylogarithmic communication complexity. Our construction is based on a new, but reasonable...
77
Voted
ISAAC
2003
Springer
15 years 2 months ago
2003
Springer
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
EUROCRYPT
2003
Springer
15 years 2 months ago
2003
Springer
The recently proposed universally composable (UC) security framework for analyzing security of cryptographic protocols provides very strong security guarantees. In particular, a p...
CIE
2008
Springer
14 years 11 months ago
2008
Springer
Abstract We prove, using a non-standard complexity assumption, that any language in NP has a 1-round (that is, the verifier sends a message to the prover, and the prover sends a me...
114
Voted
ICDT
2012
ACM
12 years 12 months ago
2012
ACM
Previous studies of incomplete XML documents have identified three main sources of incompleteness – in structural information, data values, and labeling – and addressed data ...