Sciweavers

1195 search results - page 2 / 239
» New constructions of SSPDs and their applications
Sort
View
STACS
1999
Springer
13 years 9 months ago
Balanced Randomized Tree Splitting with Applications to Evolutionary Tree Constructions
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
Ming-Yang Kao, Andrzej Lingas, Anna Östlin
KI
1992
Springer
13 years 9 months ago
How to Construct a Logic for Your Application
Abstract. The purpose of this note is to present and evaluate the options available to a researcher wishing to use logic for representation, reasoning and computation in his applic...
Dov M. Gabbay
CRYPTO
2000
Springer
277views Cryptology» more  CRYPTO 2000»
13 years 9 months ago
Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications
The best known constructions for arrays with low bias are those from [1] and the exponential sum method based on the WeilCarlitz-Uchiyama bound. They all yield essentially the same...
Jürgen Bierbrauer, Holger Schellwat
CCS
2011
ACM
12 years 5 months ago
WAPTEC: whitebox analysis of web applications for parameter tampering exploit construction
Parameter tampering attacks are dangerous to a web application whose server fails to replicate the validation of user-supplied data that is performed by the client. Malicious user...
Prithvi Bisht, Timothy Hinrichs, Nazari Skrupsky, ...