Sciweavers

163 search results - page 19 / 33
» Computationally Convincing Proofs of Knowledge
Sort
View
EUROCRYPT
2006
Springer
13 years 11 months ago
Compact Group Signatures Without Random Oracles
We present the first efficient group signature scheme that is provably secure without random oracles. We achieve this result by combining provably secure hierarchical signatures i...
Xavier Boyen, Brent Waters
FOSSACS
2011
Springer
12 years 11 months ago
Ordinal Theory for Expressiveness of Well Structured Transition Systems
To the best of our knowledge, we characterize for the first time the importance of resources (counters, channels, alphabets) when measuring expressiveness of WSTS. We establish, f...
Rémi Bonnet, Alain Finkel, Serge Haddad, Fe...
SEMWEB
2009
Springer
14 years 2 months ago
Populating the Semantic Web by Macro-reading Internet Text
A key question regarding the future of the semantic web is “how will we acquire structured information to populate the semantic web on a vast scale?” One approach is to enter t...
Tom M. Mitchell, Justin Betteridge, Andrew Carlson...
VSTTE
2005
Springer
14 years 1 months ago
From the How to the What
In this paper, we consider the Grand Challenge under a very specific perspective: the enabling of application experts without programming knowledge to reliably model their busines...
Tiziana Margaria, Bernhard Steffen
CSL
2001
Springer
14 years 4 days ago
A Logic for Approximate First-Order Reasoning
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ...
Frédéric Koriche