Sciweavers

2210 search results - page 161 / 442
» CLEF 2001 - Overview of Results
Sort
View
CP
2001
Springer
15 years 10 months ago
Optimal Pruning in Parametric Differential Equations
Initial value problems for parametric ordinary differential equations (ODEs) arise in many areas of science and engineering. Since some of the data is uncertain, traditional numer...
Micha Janssen, Pascal Van Hentenryck, Yves Deville
166
Voted
CPM
2001
Springer
98views Combinatorics» more  CPM 2001»
15 years 10 months ago
Regular Expression Searching over Ziv-Lempel Compressed Text
We present a solution to the problem of regular expression searching on compressed text. The format we choose is the Ziv-Lempel family, speci cally the LZ78 and LZW variants. Give...
Gonzalo Navarro
CRYPTO
2001
Springer
155views Cryptology» more  CRYPTO 2001»
15 years 10 months ago
RSA-OAEP Is Secure under the RSA Assumption
Recently Victor Shoup noted that there is a gap in the widely-believed security result of OAEP against adaptive chosen-ciphertext attacks. Moreover, he showed that, presumably, OA...
Eiichiro Fujisaki, Tatsuaki Okamoto, David Pointch...
CRYPTO
2001
Springer
136views Cryptology» more  CRYPTO 2001»
15 years 10 months ago
Session-Key Generation Using Human Passwords Only
We present session-key generation protocols in a model where the legitimate parties share only a human-memorizable password. The security guarantee holds with respect to probabilis...
Oded Goldreich, Yehuda Lindell
CRYPTO
2001
Springer
144views Cryptology» more  CRYPTO 2001»
15 years 10 months ago
Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation
In this paper we show that any two-party functionality can be securely computed in a constant number of rounds, where security is obtained against malicious adversaries that may ar...
Yehuda Lindell