Sciweavers

659 search results - page 43 / 132
» Compiling and securing cryptographic protocols
Sort
View
TCS
2002
15 years 2 months ago
Authentication tests and the structure of bundles
Suppose a principal in a cryptographic protocol creates and transmits a message containing a new value v, later receiving v back in a different cryptographic context. It can concl...
Joshua D. Guttman, F. Javier Thayer
122
Voted
ICASSP
2011
IEEE
14 years 6 months ago
Efficiently computing private recommendations
Online recommender systems enable personalized service to users. The underlying collaborative filtering techniques operate on privacy sensitive user data, which could be misused ...
Zekeriya Erkin, M. Beye, T. Veugen, Reginald L. La...
CCS
2008
ACM
15 years 4 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
110
Voted
CCR
2007
115views more  CCR 2007»
15 years 2 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
162
Voted
WIMOB
2007
IEEE
15 years 8 months ago
A New Protocol for Securing Wireless Sensor Networks against Nodes Replication Attacks
—The low-cost, unattended nature and the capability of self-organizing of sensors, yield the use of Wireless Sensor Networks (WSN) very popular to day. Unfortunately, the unshiel...
Chakib Bekara, Maryline Laurent-Maknavicius