Sciweavers

1466 search results - page 11 / 294
» Completeness of the Authentication Tests
Sort
View
FC
2005
Springer
98views Cryptology» more  FC 2005»
14 years 1 months ago
Secure Biometric Authentication for Weak Computational Devices
This paper presents computationally “lightweight” schemes for performing biometric authentication that carry out the comparison stage without revealing any information that can...
Mikhail J. Atallah, Keith B. Frikken, Michael T. G...
CCS
2001
ACM
14 years 5 days ago
Flexible authentication of XML documents
XML is increasingly becoming the format of choice for information exchange on the Internet. As this trend grows, one can expect that documents (or collections thereof) may get qui...
Premkumar T. Devanbu, Michael Gertz, April Kwong, ...
JOC
2006
116views more  JOC 2006»
13 years 7 months ago
On the Fly Authentication and Signature Schemes Based on Groups of Unknown Order
Abstract. In response to the current need for fast, secure and cheap public-key cryptography, we propose an interactive zero-knowledge identification scheme and a derived signature...
Marc Girault, Guillaume Poupard, Jacques Stern
ESWS
2006
Springer
13 years 11 months ago
Towards a Complete OWL Ontology Benchmark
Abstract. Aiming to build a complete benchmark for better evaluation of existing ontology systems, we extend the well-known Lehigh University Benchmark in terms of inference and sc...
Li Ma, Yang Yang, Zhaoming Qiu, Guo Tong Xie, Yue ...
ISSTA
1989
ACM
13 years 11 months ago
Estimating the Number of Test Cases Required to Satisfy the All-du-paths Testing Criterion
The all-du-paths software testing criterion is the most discriminating of the data ow testing criteria of Rapps and Weyuker. Unfortunately, in the worst case, the criterion requir...
James M. Bieman, J. Schultz