Sciweavers

102 search results - page 13 / 21
» Secure Sketch for Multiple Secrets
Sort
View
DSN
2008
IEEE
14 years 1 months ago
Security through redundant data diversity
Unlike other diversity-based approaches, N-variant systems thwart attacks without requiring secrets. Instead, they use redundancy (to require an attacker to simultaneously comprom...
Anh Nguyen-Tuong, David Evans, John C. Knight, Ben...
SISW
2005
IEEE
14 years 1 months ago
Adding Secure Deletion to Your Favorite File System
Files or even their names often contain confidential or secret information. Most users believe that such information is erased as soon as they delete a file. Even those who know...
Nikolai Joukov, Erez Zadok
CORR
2010
Springer
183views Education» more  CORR 2010»
13 years 7 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...
FC
1999
Springer
160views Cryptology» more  FC 1999»
13 years 11 months ago
Anonymous Authentication of Membership in Dynamic Groups
Abstract. We present a series of protocols for authenticating an individual’s membership in a group without revealing that individual’s identity and without restricting how the...
Stuart E. Schechter, Todd Parnell, Alexander J. Ha...
JSW
2008
101views more  JSW 2008»
13 years 7 months ago
Broadcast Authentication with Practically Unbounded One-way Chains
A protocol for assuring the authenticity of information broadcasted over long periods of time is proposed. The protocol is based on time synchronization and uses one-way chains con...
Bogdan Groza