Sciweavers

133 search results - page 17 / 27
» On the security of linear consensus networks
Sort
View
IACR
2011
124views more  IACR 2011»
12 years 7 months ago
Generic Fully Simulatable Adaptive Oblivious Transfer
We aim at constructing adaptive oblivious transfer protocols, enjoying fully simulatable security, from various well-known assumptions such as DDH, d-Linear, QR, DCR, and LWE. To t...
Kaoru Kurosawa, Ryo Nojima, Le Trieu Phong
CORR
2007
Springer
138views Education» more  CORR 2007»
13 years 7 months ago
On the Performance Evaluation of Encounter-based Worm Interactions Based on Node Characteristics
An encounter-based network is a frequently-disconnected wireless ad-hoc network requiring nearby neighbors to store and forward data utilizing mobility and encounters over time. U...
Sapon Tanachaiwiwat, Ahmed Helmy
IPCCC
2005
IEEE
14 years 1 months ago
A key distribution scheme for double authentication in link state routing protocol
The Double Authentication (DA) scheme presented in [1] is designed to provide security against impersonation attack to link state routing protocol at a lower computational cost as...
D. Huang, A. Sinha, D. Medhi
EUROCRYPT
2007
Springer
14 years 1 months ago
Atomic Secure Multi-party Multiplication with Low Communication
We consider the standard secure multi-party multiplication protocol due to M. Rabin. This protocol is based on Shamir’s secret sharing scheme and it can be viewed as a practical ...
Ronald Cramer, Ivan Damgård, Robbert de Haan
SIGCOMM
1998
ACM
14 years 5 hour ago
Secure Group Communications Using Key Graphs
Many emerging applications (e.g., teleconference, real-time information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group ...
Chung Kei Wong, Mohamed G. Gouda, Simon S. Lam