Sciweavers

10 search results - page 2 / 2
» A Flaw in the Use of Minimal Defining Sets for Secret Sharin...
Sort
View
CCS
2006
ACM
13 years 8 months ago
An efficient key establishment scheme for secure aggregating sensor networks
Key establishment is a fundamental prerequisite for secure communication in wireless sensor networks. A new node joining the network needs to efficiently and autonomously set up s...
Erik-Oliver Blaß, Martina Zitterbart
ASIACRYPT
2010
Springer
13 years 3 months ago
Constant-Size Commitments to Polynomials and Their Applications
We introduce and formally define polynomial commitment schemes, and provide two efficient constructions. A polynomial commitment scheme allows a committer to commit to a polynomial...
Aniket Kate, Gregory M. Zaverucha, Ian Goldberg
CORR
2010
Springer
183views Education» more  CORR 2010»
13 years 5 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...
CANS
2009
Springer
165views Cryptology» more  CANS 2009»
13 years 11 months ago
Blink 'Em All: Scalable, User-Friendly and Secure Initialization of Wireless Sensor Nodes
Abstract. Wireless sensor networks have several useful applications in commercial and defense settings, as well as user-centric personal area networks. To establish secure (point-t...
Nitesh Saxena, Md. Borhan Uddin
GLOBECOM
2009
IEEE
13 years 9 months ago
Optimum Allocation of Energy and Spectrum in Power-Controlled Wireless Networks with QoS Constraints
An important performance measure in wireless networks is the manner in which the network can distributively manage its limited energy and spectrum resources, while assuring certain...
Stepán Kucera, Ludek Kucera, Bing Zhang