Sciweavers

2601 search results - page 236 / 521
» Secure Rewarding Schemes
Sort
View
135
Voted
CCS
2006
ACM
15 years 7 months ago
Secure information flow with random assignment and encryption
Type systems for secure information flow aim to prevent a program from leaking information from variables classified as H to variables classified as L. In this work we extend such...
Geoffrey Smith
155
Voted
CCS
2008
ACM
15 years 5 months ago
Secure neighbor discovery in wireless networks: formal investigation of possibility
Wireless communication enables a broad spectrum of applications, ranging from commodity to tactical systems. Neighbor discovery (ND), that is, determining which devices are within...
Marcin Poturalski, Panos Papadimitratos, Jean-Pier...
138
Voted
CCS
2008
ACM
15 years 5 months ago
Security arguments for the UM key agreement protocol in the NIST SP 800-56A standard
The Unified Model (UM) key agreement protocol is an efficient Diffie-Hellman scheme that has been included in many cryptographic standards, most recently in the NIST SP 80056A sta...
Alfred Menezes, Berkant Ustaoglu
122
Voted
CCR
2007
115views more  CCR 2007»
15 years 3 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
131
Voted
JAR
2008
115views more  JAR 2008»
15 years 3 months ago
Formal Models and Analysis of Secure Multicast in Wired and Wireless Networks
The spreading of multicast technology enables the development of group communication and so dealing with digital streams becomes more and more common over the Internet. Given the f...
Roberto Gorrieri, Fabio Martinelli, Marinella Petr...