Sciweavers

1359 search results - page 3 / 272
» Black-Box Program Specialization
Sort
View
ASIACRYPT
2008
Springer
13 years 7 months ago
Sufficient Conditions for Intractability over Black-Box Groups: Generic Lower Bounds for Generalized DL and DH Problems
Abstract. The generic (aka. black-box) group model is a valuable methodology for analyzing the computational hardness of number-theoretic problems used in cryptography. Since the p...
Andy Rupp, Gregor Leander, Endre Bangerter, Alexan...
FOCS
2009
IEEE
14 years 16 days ago
Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy
Canetti, Goldreich, Goldwasser, and Micali (STOC 2000) introduced the notion of resettable zeroknowledge proofs, where the protocol must be zero-knowledge even if a cheating veriļ...
Yi Deng, Vipul Goyal, Amit Sahai
ICALP
2004
Springer
13 years 11 months ago
The Black-Box Complexity of Nearest Neighbor Search
We deļ¬ne a natural notion of eļ¬ƒciency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
ICST
2009
IEEE
13 years 3 months ago
An Empirical Evaluation of Automated Black Box Testing Techniques for Crashing GUIs
This paper reports an empirical evaluation of four blackbox testing techniques for crashing programs through their GUI interface: SH, AF, DH, and BxT. The techniques vary in their...
Cristiano Bertolini, Glaucia Peres, Marcelo d'Amor...
GI
2001
Springer
13 years 10 months ago
Extending Sunit to Test Components
To ensure the deployment of reusable and reliable components, it is important to verify their functionality. In this paper, we present a framework for component testing, an extens...
Ludger Martin, Elke Siemon