Sciweavers

1058 search results - page 59 / 212
» Secure Group Communications Using Key Graphs
Sort
View
CCS
2008
ACM
15 years 2 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
100
Voted
JAR
2006
107views more  JAR 2006»
15 years 17 days ago
Attacking Group Protocols by Refuting Incorrect Inductive Conjectures
Automated tools for finding attacks on flawed security protocols often fail to quately with group protocols. This is because the abstractions made to improve performance on fixed ...
Graham Steel, Alan Bundy
88
Voted
GC
2006
Springer
15 years 18 days ago
The Semi-Arc Automorphism Group of a Graph with Application to Map Enumeration
A map is a connected topological graph cellularly embedded in a surface. For a given graph , its genus distribution of rooted maps and embeddings on orientable and non-orientable s...
Linfan Mao, Yanpei Liu, Erling Wei
106
Voted
INFOCOM
2006
IEEE
15 years 6 months ago
Establishing Pair-Wise Keys in Heterogeneous Sensor Networks
— Many applications that make use of sensor networks require secure communication. Because asymmetric-key solutions are difficult to implement in such a resource-constrained env...
Patrick Traynor, Heesook Choi, Guohong Cao, Sencun...
SASN
2003
ACM
15 years 5 months ago
Admission control in Peer-to-Peer: design and performance evaluation
Peer-to-Peer (P2P) applications and services are very common in today’s computing. The popularity of the P2P paradigm prompts the need for specialized security services which ma...
Nitesh Saxena, Gene Tsudik, Jeong Hyun Yi