Sciweavers

1528 search results - page 40 / 306
» On Signatures for Communication Graphs
Sort
View
WWW
2005
ACM
14 years 8 months ago
Signing individual fragments of an RDF graph
Being able to determine the provenience of statements is a fundamental step in any SW trust modeling. We propose a methodology that allows signing of small groups of RDF statement...
Giovanni Tummarello, Christian Morbidoni, Paolo Pu...
CORR
2008
Springer
139views Education» more  CORR 2008»
13 years 7 months ago
The Secrecy Graph and Some of its Properties
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure commun...
Martin Haenggi
GLOBECOM
2006
IEEE
14 years 1 months ago
On the Effectiveness of Service Registration-Based Worm Defense
— Existing Internet worm research focuses either on worm detection inside an AS, or on prevention of Internet-wide worm epidemic. But of more practical concern is how to repel wo...
Jin-Ho Kim, Hyogon Kim, Saewoong Bahk
DASFAA
2008
IEEE
188views Database» more  DASFAA 2008»
14 years 2 months ago
Summarization Graph Indexing: Beyond Frequent Structure-Based Approach
Graph is an important data structure to model complex structural data, such as chemical compounds, proteins, and XML documents. Among many graph data-based applications, sub-graph ...
Lei Zou, Lei Chen 0002, Huaming Zhang, Yansheng Lu...
IEEEARES
2007
IEEE
14 years 1 months ago
Pseudo-Voter Identity (PVID) Scheme for e-Voting Protocols
Voter anonymity, also known as unlinkability, is the primary requirement to satisfy privacy in e-voting protocols. Up until now, e-voting protocols have tried to make communicatio...
Orhan Cetinkaya, Ali Doganaksoy