Sciweavers

310 search results - page 31 / 62
» An Efficient Protocol for Fair Secure Two-Party Computation
Sort
View
EUROPAR
2003
Springer
15 years 2 months ago
FOBS: A Lightweight Communication Protocol for Grid Computing
The advent of high-performance networks in conjunction with low-cost, powerful computational engines has made possible the development of a new set of technologies termed computat...
Phillip M. Dickens
CCR
2005
95views more  CCR 2005»
14 years 9 months ago
Efficient security for IPv6 multihoming
In this note, we propose a security mechanism for protecting IPv6 networks from possible abuses caused by the malicious usage of a multihoming protocol. In the presented approach,...
Marcelo Bagnulo, Alberto García-Martí...
CORR
2010
Springer
108views Education» more  CORR 2010»
14 years 9 months ago
Securing data transfer in the cloud through introducing identification packet and UDT-authentication option field: a characteriz
The emergence of various technologies has since pushed researchers to develop new protocols that support high density data transmissions in Wide Area Networks. Many of these proto...
Danilo Valeros Bernardo, Doan B. Hoang
WISEC
2010
ACM
15 years 2 months ago
Secret keys from entangled sensor motes: implementation and analysis
Key management in wireless sensor networks does not only face typical, but also several new challenges. The scale, resource limitations, and new threats such as node capture and c...
Matthias Wilhelm, Ivan Martinovic, Jens B. Schmitt
CRYPTO
2010
Springer
181views Cryptology» more  CRYPTO 2010»
14 years 10 months ago
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Due to its universality oblivious transfer (OT) is a primitive of great importance in secure multi-party computation. OT is impossible to implement from scratch in an unconditional...
Severin Winkler, Jürg Wullschleger