Sciweavers

2492 search results - page 123 / 499
» On the General Signature Trees
Sort
View
CSL
2010
Springer
15 years 7 months ago
Graded Computation Tree Logic with Binary Coding
Abstract. Graded path quantifiers have been recently introduced and investigated as a useful framework for generalizing standard existential and universal path quantifiers in the b...
Alessandro Bianco, Fabio Mogavero, Aniello Murano
SIGMOD
2011
ACM
249views Database» more  SIGMOD 2011»
14 years 9 months ago
ProApproX: a lightweight approximation query processor over probabilistic trees
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...
Pierre Senellart, Asma Souihli
IPPS
2005
IEEE
16 years 1 hour ago
Some Issues in Solving the Anomaly Detection Problem using Immunological Approach
Results of an experimental study of an anomaly detection system based on the paradigm of artificial immune systems (AISs) are presented. Network traffic data are mapped into ant...
Franciszek Seredynski, Pascal Bouvry
EUROCRYPT
2001
Springer
15 years 11 months ago
Lower Bounds for Multicast Message Authentication
Message integrity from one sender to one receiver is typically achieved by having the two parties share a secret key to compute a Message Authentication Code (MAC). We consider the...
Dan Boneh, Glenn Durfee, Matthew K. Franklin
FC
1999
Springer
97views Cryptology» more  FC 1999»
15 years 10 months ago
Playing "Hide and Seek" with Stored Keys
In this paper we consider the problem of efficiently locating cryptographic keys hidden in gigabytes of data, such as the complete file system of a typical PC. We describe efficie...
Adi Shamir, Nicko van Someren