87 search results - page 3 / 18 » Two Generic Constructions of Probabilistic Cryptosystems and... |
COLT
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...
EUROPKI
2008
Springer
13 years 7 months ago
2008
Springer
We propose a generic method to construct forward-secure signature schemes from standard signature schemes. The proposed construction is more computationally efficient than previous...
SIGIR
2005
ACM
13 years 10 months ago
2005
ACM
This paper explores probabilistic lexico-syntactic pattern matching, also known as soft pattern matching. While previous methods in soft pattern matching are ad hoc in computing t...
APPROX
2005
Springer
13 years 10 months ago
2005
Springer
There has been significant interest lately in the task of constructing codes that are testable with a small number of random probes. Ben-Sasson and Sudan show that the repeated te...
EUROCRYPT
2005
Springer
13 years 10 months ago
2005
Springer
We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secu...