Sciweavers

1058 search results - page 99 / 212
» Secure Group Communications Using Key Graphs
Sort
View
EUROCRYPT
2001
Springer
15 years 7 months ago
Evidence that XTR Is More Secure than Supersingular Elliptic Curve Cryptosystems
Abstract. We show that finding an efficiently computable injective homomorphism from the XTR subgroup into the group of points over GF(p2 ) of a particular type of supersingular e...
Eric R. Verheul
110
Voted
CORR
2008
Springer
149views Education» more  CORR 2008»
15 years 2 months ago
Phase Transitions on Fixed Connected Graphs and Random Graphs in the Presence of Noise
In this paper, we study phase transition behavior emerging from the interactions among multiple agents in the presence of noise. We propose a simple discrete-time model in which a...
Jialing Liu, Vikas Yadav, Hullas Sehgal, Joshua M....
INFOCOM
2010
IEEE
15 years 1 months ago
A Node-failure-resilient Anonymous Communication Protocol through Commutative Path Hopping
Abstract—With rising concerns on user privacy over the Internet, anonymous communication systems that hide the identity of a participant from its partner or third parties are hig...
Fengjun Li, Bo Luo, Peng Liu, Chao-Hsien Chu
EDOC
2004
IEEE
15 years 6 months ago
Security Patterns: A Method for Constructing Secure and Efficient Inter-Company Coordination Systems
As the Internet, intranets and other wide-area open networks grow, novel techniques for building distributed systems, notably mobile agents, are attracting increasing attention. T...
Nobukazu Yoshioka, Shinichi Honiden, Anthony Finke...
150
Voted
PERCOM
2006
ACM
16 years 2 months ago
Context and Location-Aware Encryption for Pervasive Computing Environments
Pervasive computing promises to revolutionize computing, empower mobile users, and enhance mobility, customizability and adaptability of computing environments. Intrinsic to the n...
Jalal Al-Muhtadi, Raquel L. Hill, Roy H. Campbell,...