Sciweavers

757 search results - page 53 / 152
» How secure are secure interdomain routing protocols
Sort
View
ACNS
2009
Springer
168views Cryptology» more  ACNS 2009»
14 years 2 months ago
How to Extract and Expand Randomness: A Summary and Explanation of Existing Results
Abstract. We examine the use of randomness extraction and expansion in key agreement (KA) protocols to generate uniformly random keys in the standard model. Although existing works...
Yvonne Cliff, Colin Boyd, Juan Manuel Gonzá...
OOPSLA
1995
Springer
13 years 11 months ago
How and Why to Encapsulate Class Trees
eusable framework, pattern or module interface usually is represented by abstract They form an abstract design and leave the implementation to concrete subclasses. ract design is ...
Dirk Riehle
JCM
2010
98views more  JCM 2010»
13 years 6 months ago
High Speed Data Routing in Vehicular Sensor Networks
—In this paper, we show through a simple secure symmetric key based protocol design and experiments the feasibility of secure data collection in a vehicular sensor networks. This...
Harry Gao, Seth Utecht, Gregory Patrick, George Hs...
SIGCOMM
2005
ACM
14 years 1 months ago
Declarative routing: extensible routing with declarative queries
The Internet’s core routing infrastructure, while arguably robust and efficient, has proven to be difficult to evolve to accommodate the needs of new applications. Prior researc...
Boon Thau Loo, Joseph M. Hellerstein, Ion Stoica, ...
ICDM
2006
IEEE
131views Data Mining» more  ICDM 2006»
14 years 1 months ago
Transforming Semi-Honest Protocols to Ensure Accountability
The secure multi-party computation (SMC) model provides means for balancing the use and confidentiality of distributed data. This is especially important in the field of privacy...
Wei Jiang, Chris Clifton