Sciweavers

1528 search results - page 25 / 306
» On Signatures for Communication Graphs
Sort
View
ACSAC
2003
IEEE
13 years 11 months ago
Scalable and Efficient PKI for Inter-Organizational Communication
We propose an efficient and flexible system for a secure and authentic data exchange in a multiinstitutional environment, where the institutions maintain different databases and p...
Arne Ansper, Ahto Buldas, Margus Freudenthal, Jan ...
CCR
2007
115views more  CCR 2007»
13 years 7 months ago
Analysis of the SPV secure routing protocol: weaknesses and lessons
We analyze a secure routing protocol, Secure Path Vector (SPV), proposed in SIGCOMM 2004. SPV aims to provide authenticity for route announcements in the Border Gateway Protocol (...
Barath Raghavan, Saurabh Panjwani, Anton Mityagin
CCS
2003
ACM
14 years 23 days ago
Enhancing byte-level network intrusion detection signatures with context
Many network intrusion detection systems (NIDS) use byte sequences as signatures to detect malicious activity. While being highly efficient, they tend to suffer from a high false...
Robin Sommer, Vern Paxson
ICICS
2003
Springer
14 years 23 days ago
ID-Based Distributed "Magic Ink" Signature from Pairings
The advantage of ID-based system is the simplification of key distribution and certification management; a user can directly use his identity as his public key instead of an arbi...
Yan Xie, Fangguo Zhang, Xiaofeng Chen, Kwangjo Kim
DALT
2004
Springer
14 years 28 days ago
The Logic of Communication Graphs
In 1992, Moss and Parikh studied a bimodal logic of knowledge and effort called Topologic. In this current paper, Topologic is extended to the case of many agents who are assumed...
Eric Pacuit, Rohit Parikh