Sciweavers

1853 search results - page 236 / 371
» Cryptographic Protocols and Network Security
Sort
View
EUROCRYPT
2007
Springer
15 years 10 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
158
Voted
CORR
2010
Springer
183views Education» more  CORR 2010»
15 years 4 months ago
Forming the COUNCIL Based Clusters in Securing Wireless Ad Hoc Networks
-- In cluster-based routing protocol (CBRP), two-level hierarchical structure is successfully used to reduce over-flooding in wireless ad hoc networks. As it is vulnerable to a sin...
Alok Ojha, Hongmei Deng, Dharma P. Agrawal, Sugata...
INFOCOM
2010
IEEE
15 years 2 months ago
SafeQ: Secure and Efficient Query Processing in Sensor Networks
The architecture of two-tiered sensor networks, where storage nodes serve as an intermediate tier between sensors and a sink for storing data and processing queries, has been widel...
Fei Chen, Alex X. Liu
CRITIS
2006
15 years 8 months ago
Applying Key Infrastructures for Sensor Networks in CIP/CIIP Scenarios
It is commonly agreed that Wireless Sensor Networks (WSN) is one of the technologies that better fulfills features like the ones required by Critical (Information) Infrastructures....
Cristina Alcaraz, Rodrigo Roman
142
Voted
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
15 years 8 months ago
On Expected Constant-Round Protocols for Byzantine Agreement
In a seminal paper, Feldman and Micali (STOC '88) show an n-party Byzantine agreement protocol tolerating t < n/3 malicious parties that runs in expected constant rounds. H...
Jonathan Katz, Chiu-Yuen Koo