Sciweavers

2492 search results - page 14 / 499
» On the General Signature Trees
Sort
View
CTRSA
2005
Springer
221views Cryptology» more  CTRSA 2005»
14 years 1 months ago
Accumulators from Bilinear Pairings and Applications
We propose a dynamic accumulator scheme from bilinear pairings, whose security is based on the Strong Diffie-Hellman assumption. We show applications of this accumulator in constru...
Lan Nguyen
VLDB
2003
ACM
107views Database» more  VLDB 2003»
14 years 7 months ago
A performance study of four index structures for set-valued attributes of low cardinality
The efficient retrieval of data items on set-valued attributes is an important research topic that has attracted little attention so far. We studied and modified four index structu...
Sven Helmer, Guido Moerkotte
WWW
2008
ACM
14 years 8 months ago
Efficiently querying rdf data in triple stores
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
Ying Yan, Chen Wang, Aoying Zhou, Weining Qian, Li...
ASIACRYPT
2004
Springer
14 years 28 days ago
Generic Homomorphic Undeniable Signatures
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Diï¬...
Jean Monnerat, Serge Vaudenay
KDID
2003
119views Database» more  KDID 2003»
13 years 9 months ago
Generalized Version Space Trees
We introduce generalized version space trees, a novel data structure that serves as a condensed representation in inductive databases for graph mining. Generalized version space tr...
Ulrich Rückert, Stefan Kramer