| Author | Title | Year | Journal/Proceedings | Reftype | DOI/URL |
|---|---|---|---|---|---|
| Christina Fragouli, Dina Katabi, A. M. M. M. H. R. | Wireless Network Coding: Opportunities & Challenges | 2007 | MILCOM | inproceedings | |
| Abstract: Wireless networks suffer from a variety of unique problems such as low throughput, dead spots, and inadequate support for mobility. However, their characteristics such as the broadcast nature of the medium, spatial diversity, and significant data redundancy, provide opportunities for new design principles to address these problems. There has been recent interest in employing network coding in wireless networks. This paper explores the case for network coding as a unifying design paradigm for wireless networks, by describing how it addresses issues of througput, reliability, mobility, and management. We also discuss the practical challenges facing the integration of such a design into the network stack. | |||||
| Review: Gives a brief overview of list of applications of Network Coding Understanding: Mainly NC is used for reducing bandwidth utilization, and packet distribution |
|||||
BibTeX:
@inproceedings{fragouli07milcom,
author = {Christina Fragouli, Dina Katabi, Athina Markopoulou, Muriel M´edard, Hariharan Rahul},
title = {Wireless Network Coding: Opportunities & Challenges},
booktitle = {MILCOM},
year = {2007}
}
|
|||||
| Dan Boneh, Craig Gentry, B. L. H. S. | A Survey of Two Signature Aggregation Techniques | 2003 | article | URL | |
| Abstract: We survey two recent signature constructions that support signature aggregation: Given n signatures on n distinct messages from n distinct users, it is possible to aggregate all these signatures into a single signature. This single signature (and all n original messages) will convince any verifier that the n users signed the n original messages (i.e., for i = 1; : : : ; n user i signed message number i). We survey two constructions. The first is based on the short signature scheme of Boneh,... | |||||
BibTeX:
@article{boneh03survey,
author = {Dan Boneh, Craig Gentry, Ben Lynn, Hovav Shacham},
title = {A Survey of Two Signature Aggregation Techniques},
year = {2003},
url = {http://crypto.stanford.edu/~dabo/papers/aggsurvey.pdf}
}
|
|||||
| Danfeng Yao, Tamassia, R. | Cascaded Authorization with Anonymous-Signer Aggregate Signatures | 2006 | Information Assurance Workshop, IEEE | article | URL |
| Abstract: We introduce a decentralized trust management model called anonymous role-based cascaded delegation. In this model, a delegator can issue authorizations on behalf of her role without revealing her identity. This type of delegation protects the sensitive membership information of a delegator and hides the internal structure of an organization. To provide an efficient storage and transmission mechanism for credentials used in anonymous role-based cascaded delegation, we present a new signature scheme that supports both signer anonymity and signature aggregation. Our scheme has compact role signatures that make it especially suitable for ubiquitous computing environments, where users may have mobile computing devices with narrow communication bandwidth and small storage units | |||||
BibTeX:
@article{yao06ia,
author = {Danfeng Yao, Tamassia, R},
title = {Cascaded Authorization with Anonymous-Signer Aggregate Signatures},
journal = {Information Assurance Workshop, IEEE},
year = {2006},
url = {http://www.cs.brown.edu/cgc/stms/papers/anonymity-full.pdf}
}
|
|||||
| Dimakis, A. G. | Network Coding - Data Storage [BibTeX] |
'03-'08 | Network Coding - Data Storage | incollection | URL |
BibTeX:
@incollection{dimakis,
author = {Alexandros G. Dimakis},
title = {Network Coding - Data Storage},
booktitle = {Network Coding - Data Storage},
publisher = {self},
year = {'03-'08},
url = {http://www.eecs.berkeley.edu/~adim/}
}
|
|||||
| F. Zhao, T. Kalker, M. M. & Han, K. J. | Signatures for content distribution with network coding | 2007 | International Symposium on Information Theory (ISIT) | inproceedings | |
| Abstract: Recent research has shown that network coding can be used in content distribution systems to improve the speed of downloads and the robustness of the systems. However, such systems are very vulnerable to attacks by malicious nodes, and we need to have a signature scheme that allows nodes to check the validity of a packet without decoding. In this paper, we propose such a signature scheme for network coding. Our scheme makes use of the linearity property of the packets in a coded system, and allows nodes to check the integrity of the packets received easily. We show that the proposed scheme is secure, and its overhead is negligible for large files. | |||||
| Review: Idea: private key: k (used alpha in the paper) public key: g^k Sender: ----------- V-message pick a U, s.t., V.U = 0 for U noteq 0 hash, h_v = U / k Receiver: ------------- received: ( V, h_v) check, (g^k) ^ (V. h_v) ==? 1 thats it. DONE |
|||||
BibTeX:
@inproceedings{zhao07isit,
author = {F. Zhao, T. Kalker, M. Médard, and K. J. Han},
title = {Signatures for content distribution with network coding},
booktitle = {International Symposium on Information Theory (ISIT)},
year = {2007}
}
|
|||||
| Fragouli, C., Boudec, J. L. & Widmer, J. | Network coding: an instant primer | 2006 | SIGCOMM Comput. Commun. Rev. | article | DOIURL |
| Abstract: Network coding is a new research area that may have inter-esting applications in practical networking systems. With network coding, intermediate nodes may send out packets that are linear combinations of previously received informa-tion. There are two main benefits of this approach: potential throughput improvements and a high degree of robustness. Robustness translates into loss resilience and facilitates the design of simple distributed algorithms that perform well, even if decisions are based only on partial information. This paper is an instant primer on network coding: we explain what network coding does and how it does it. We also dis-cuss the implications of theoretical results on network coding for realistic settings and show how network coding can be used in practice. |
|||||
| Review: Christina Fraguoli have done extensive work on Network Coding The paper gives a big picture of what is Network coding along with its application areas. Though the paper has been recently published, it is just a primer, no indepth contribution. It can be listed as the Consolidation of Network Coding Area. |
|||||
BibTeX:
@article{fragouli06sigcomm,
author = {Christina Fragouli and Jean-Yves Le Boudec and Jörg Widmer},
title = {Network coding: an instant primer},
journal = {SIGCOMM Comput. Commun. Rev.},
publisher = {ACM},
year = {2006},
volume = {36},
number = {1},
pages = {63--68},
url = {http://algo.epfl.ch/~christin/cv_fragouli.pdf},
doi = {http://doi.acm.org/10.1145/1111322.1111337}
}
|
|||||
| Haven, F. | Anonymity Bibliography 1 | '77-'08 | Anonymity Bibliography 1 | incollection | URL |
| Review: 1. Comprehension 1.a. Summary 1.b. Authors Contributions 1.c. Claim Substantiation 1.d. Conclusion 2. Evaluation 2.a. Significance of problem 2.b. Significance of contribution 2.c. Validity of claims 3. Synthesis 3.a. Alternative solution 3.b. Better way to substantiate the claim 3.c. Argument against the claim 3.d. Application to other context 3.e. Open problems raised by this work 3.f. Ways to do better than authors 4. Research Components 4.a. Measurements: validation is an issue 4.b. Theory: exact form o problem studied with assumptions (which are not tied to details that will change tomorrow) - a class of solutions 4.c. Systems: a comparative evaluation 4.d. Simulation: correctness of simulator - sanity check - identify important factors to the setup - explore enough of the space to draw conclusions 5. Writing style 5.a. Introduce the problem and idea with an example and present the general case 5.b. Writing the paper is how one develop the idea in the first place |
|||||
BibTeX:
@incollection{anonymitybib1,
author = {Free Haven},
title = {Anonymity Bibliography 1},
booktitle = {Anonymity Bibliography 1},
publisher = {Self},
year = {'77-'08},
url = {http://www.freehaven.net/anonbib/full/date.html}
}
|
|||||
| HongKi Lee1, D. N. & Song1, J. | Message and Its Origin Authentication Protocol for Data Aggregation in Sensor Networks | 2006 | Emerging Directions in Embedded and Ubiquitous Computing | article | URL |
| Abstract: In distributed sensor networks, the researches for authentication in sensor network have been focused on broadcast authentication. In this paper, we propose a message and its origin authentication protocol for data aggregation in sensor networks, based on one way hash chain and Merkle tree authentication with pre-deployment knowledge. Proposed protocol provides not only for downstream messages but also for upstream messages among neighbors, and it solves the secret value update issue with multiple Merkle trees and unbalanced energy consumption among sensor nodes with graceful handover of aggregator. In treating compromised node problem, our protocol provides an equivalent security level of pair-wise key sharing scheme, while much less memory requirements compared to pair-wise key sharing scheme. | |||||
BibTeX:
@article{lee06eucw,
author = {HongKi Lee1 , DaeHun Nyang2 and JooSeok Song1},
title = {Message and Its Origin Authentication Protocol for Data Aggregation in Sensor Networks},
journal = {Emerging Directions in Embedded and Ubiquitous Computing},
year = {2006},
volume = {4097},
pages = {281},
url = {http://www.springerlink.com/content/488265573k266361/}
}
|
|||||
| Katti, S., Cohen, J. & Katabi, D. | Information Slicing: Anonymity Using Unreliable Overlays | 2007 | Proceedings of the 4th USENIX Symposium on Networked Systems Design and Implementation (NSDI '07), Cambridge, MA, USA | inproceedings | URL |
| Abstract: This paper proposes a new approach to anonymous communication called information slicing. Typically, anonymizers use onion routing, where a message is encrypted in layers with the public keys of the nodes along the path. Instead, our approach scrambles the message, divides it into pieces, and sends the pieces along disjoint paths. We show that information slicing addresses message confidentiality as well as source and destination anonymity. Surprisingly, it does not need any public key cryptography. Further, our approach naturally addresses the problem of node failures. These characteristics make it a good fit for use over dynamic peer-to-peer overlays.We evaluate the anonymity of information slicing via analysis and simulations. Our prototype implementation on PlanetLab shows that it achieves higher throughput than onion routing and effectively copes with node churn. | |||||
| Review: UnRead | |||||
BibTeX:
@inproceedings{katti07nsdi,
author = {S. Katti and J. Cohen and D. Katabi},
title = {Information Slicing: Anonymity Using Unreliable Overlays},
booktitle = {Proceedings of the 4th USENIX Symposium on Networked Systems Design and Implementation (NSDI '07), Cambridge, MA, USA},
year = {2007},
pages = {43--56},
url = {http://nms.lcs.mit.edu/~sachin/papers/slicingnsdi.pdf}
}
|
|||||
| Katz, J. | Security Topics [BibTeX] |
2008 | BibList | incollection | URL |
BibTeX:
@incollection{katz08,
author = {Jonathan Katz},
title = {Security Topics},
booktitle = {BibList},
publisher = {self},
year = {2008},
url = {http://www.cs.umd.edu/~jkatz/research.html}
}
|
|||||
| Katz1, J. & Lindell2, A. Y. | Aggregate Message Authentication Codes | 2008 | Topics in Cryptology – CT-RSA | article | URL |
| Abstract: We propose and investigate the notion of aggregate message authentication codes (MACs) which have the property that multiple MAC tags, computed by (possibly) different senders on multiple (possibly different) messages, can be aggregated into a shorter tag that can still be verified by a recipient who shares a distinct key with each sender. We suggest aggregate MACs as an appropriate tool for authenticated communication in mobile ad-hoc networks or other settings where resource-constrained devices share distinct keys with a single entity (such as a base station), and communication is an expensive resource. | |||||
BibTeX:
@article{katz08rsa,
author = {Jonathan Katz1 and Andrew Y. Lindell2},
title = {Aggregate Message Authentication Codes},
journal = {Topics in Cryptology – CT-RSA},
year = {2008},
url = {http://www.springerlink.com/index/r60gh16928rph372.pdf}
}
|
|||||
| Lin, K. & Levis, P. | Data Discovery and Dissemination with DIP | 2008 | ipsn | article | DOIURL |
| Abstract: We present DIP, a data discovery and dissemination protocol for wireless networks. Prior approaches, such as Trickle or SPIN, have overheads that scale linearly with the number of data items. For T items, DIP can identify new items with O(log(T)) packets while maintaining a O(1) detection latency. To achieve this performance in a wide spectrum of network configurations, DIP uses a hybrid approach of randomized scanning and tree-based directed searches. By dynamically selecting which of the two algorithms to use, DIP outperforms both in terms of transmissions and speed. Simulation and testbed experiments show that DIP sends 20-60% fewer packets than existing protocols and can be 200% faster, while only requiring O(log(log(T))) additional state per data item. | |||||
BibTeX:
@article{lin08ipsn,
author = {Kaisen Lin and Philip Levis},
title = {Data Discovery and Dissemination with DIP},
journal = {ipsn},
publisher = {IEEE Computer Society},
year = {2008},
volume = {0},
pages = {433-444},
url = {http://sing.stanford.edu/pubs/ipsn08-dip.pdf},
doi = {http://doi.ieeecomputersociety.org/10.1109/IPSN.2008.17}
}
|
|||||
| Liu, K. | Privacy Preserving Data Mining [BibTeX] |
2008 | Privacy Preserving Data Mining | incollection | URL |
BibTeX:
@incollection{liu08privacy,
author = {Kun Liu},
title = {Privacy Preserving Data Mining},
booktitle = {Privacy Preserving Data Mining},
publisher = {self},
year = {2008},
url = {http://www.cs.umbc.edu/~kunliu1/research/privacy_review.html}
}
|
|||||
| Madhukar Anand, Eric Cronin, M. S. M. A. B. Z. G. I. I. L. | Sensor Network Security: More Interesting Than You Think | 2006 | UPenn Technical ReportHotSec (USENIX Workshop on Hot Topics in Security) | conference | |
| Abstract: With the advent of low-power wireless sensor networks, a wealth of new applications at the interface of the real and digital worlds is emerging. A distributed computing platform that can measure properties of the real world, formulate intelligent inferences, and instrument responses, requires strong foundations in distributed computing, artificial intelligence, databases, control theory, and security. Before these intelligent systems can be deployed in critical infrastructures such as emergency rooms and powerplants, the security properties of sensors must be fully understood. Existing wisdom has been to apply the traditional security models and techniques to sensor networks. However, sensor networks are not traditional computing devices, and as a result, existing security models and methods are ill suited. In this position paper, we take the first steps towards producing a comprehensive security model that is tailored for sensor networks. Incorporating work from Internet security, ubiquitous computing, and distributed systems, we outline security properties that must be considered when designing a secure sensor network. We propose challenges for sensor networks – security obstacles that, when overcome, will move us closer to decreasing the divide between computers and the physical world. |
|||||
| Review: Basic Paper | |||||
BibTeX:
@conference{anand06HotSec,
author = {Madhukar Anand, Eric Cronin, Micah Sherr,Matthew A. Blaze, Zachary G. Ives, Insup Lee},
title = {Sensor Network Security: More Interesting Than You Think},
booktitle = {HotSec (USENIX Workshop on Hot Topics in Security)},
journal = {UPenn Technical Report},
year = {2006},
volume = {1},
pages = {7}
}
|
|||||
| Mahimkar, A. & Rappaport, T. S. | SecureDAV: a secure data aggregation and verification protocol for sensor networks | 2004 | Global Telecommunications Conference, 2004. GLOBECOM '04. IEEEGlobal Telecommunications Conference, 2004. GLOBECOM '04. IEEE | article | URL |
| Abstract: Sensor networks include nodes with limited computation and communication capabilities. One of the basic functions of sensor networks is to sense and transmit data to the end users. The resource constraints and security issues pose a challenge to information aggregation in large sensor networks. Bootstrapping keys is another challenge because public key cryptosystems are unsuitable for use in resource-constrained sensor networks. In this paper, we propose a solution by dividing the problem in two domains. First, we present a protocol for establishing cluster keys in sensor networks using verifiable secret sharing. We chose elliptic curve cryptosystems for security because of their smaller key size, faster computations and reductions in processing power. Second, we develop a secure data aggregation and verification (SecureDAV) protocol that ensures that the base station never accepts faulty aggregate readings. An integrity check of the readings is done using Merkle hash trees, avoiding over-reliance on the cluster-heads. | |||||
BibTeX:
@article{mahimkar04globecom,
author = {Mahimkar, A. and Rappaport, T. S. },
title = {SecureDAV: a secure data aggregation and verification protocol for sensor networks},
booktitle = {Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE},
journal = {Global Telecommunications Conference, 2004. GLOBECOM '04. IEEE},
year = {2004},
volume = {4},
pages = {2175--2179 Vol.4},
url = {http://ieeexplore.ieee.org/xpls/absall.jsp?arnumber=1378395}
}
|
|||||
| Médard, M. | Network Coding Bibliography | 03-07 | Network Coding Bibliography | incollection | URL |
| Abstract: List of Papers related to network coding between yr 2003 and 2008 | |||||
BibTeX:
@incollection{medardBib,
author = {Muriel Médard},
title = {Network Coding Bibliography},
booktitle = {Network Coding Bibliography},
publisher = {self},
year = {03-07},
url = {https://hermes.lnt.e-technik.tu-muenchen.de/DokuWiki/doku.php?id=network_coding:bibliography_for_network_coding}
}
|
|||||
| Neven, G. | Efficient Sequential Aggregate Signed Data. | 2008 | EUROCRYPT | article | URL |
| Abstract: We generalize the concept of sequential aggregate signatures (SAS), proposed by Lysyanskaya, Micali, Reyzin, and Shacham (LMRS) at Eurocrypt 2004, to a new primitive called "sequential aggregate signed data" (SASD) that tries to minimize the total amount of transmitted data, rather than just signature length. We present SAS and SASD schemes that offer numerous advantages over the LMRS scheme. Most importantly, our schemes can be instantiated with uncertified claw-free permutations, thereby allowing implementations based on low-exponent RSA and factoring, and drastically reducing signing and verification costs. Our schemes support aggregation of signatures under keys of different lengths, and the SASD scheme even has as little as 160 bits of bandwidth overhead. Finally, we present a multi-signed data scheme that, when compared to the state-of-the-art multi-signature schemes, is the first scheme with non-interactive signature generation not based on pairings. All of our constructions are proved secure in the random oracle model based on families of claw-free permutations. | |||||
BibTeX:
@article{neven08eurocrypto,
author = {Gregory Neven},
title = {Efficient Sequential Aggregate Signed Data.},
booktitle = {EUROCRYPT},
publisher = {Springer},
year = {2008},
volume = {4965},
pages = {52-69},
url = {http://dblp.uni-trier.de/db/conf/eurocrypt/eurocrypt2008.html#Neven08}
}
|
|||||
| Przydatek, B., Song, D. & Perrig, A. | SIA: secure information aggregation in sensor networks | 2003 | SenSysSenSys '03: Proceedings of the 1st international conference on Embedded networked sensor systems | article | DOIURL |
| Abstract: Sensor networks promise viable solutions to many monitoring problems. However, the practical deployment of sensor networks faces many challenges imposed by real-world demands. Sensor nodes often have limited computation and communication resources and battery power. Moreover, in many applications sensors are deployed in open environments, and hence are vulnerable to physical attacks, potentially compromising the sensor’s cryptographic keys. One of the basic and indispensable functionalities of sensor networks is the ability to answer queries over the data acquired by the sensors. The resource constraints and security issues make designing mechanisms for information aggregation in large sensor networks particularly challenging. In this paper, we propose a novel framework for secure information aggregation in large sensor networks. In our framework certain nodes in the sensor network, called aggregators, help aggregating information requested by a query, which substantially reduces the communication overhead. By constructing efficient random sampling mechanisms and interactive proofs, we enable the user to verify that the answer given by the aggregator is a good approximation of the true value even when the aggregator and a fraction of the sensor nodes are corrupted. In particular, we present efficient protocols for secure computation of the median and the average of the measurements, for the estimation of the network size, and for finding the minimum and maximum sensor reading. Our protocols require only sublinear communication between the aggregator and the user. To the best of our knowledge, this paper is the first on secure information aggregation in sensor networks that can handle a malicious aggregator and sensor nodes. | |||||
BibTeX:
@article{przydatek03sensys,
author = {Bartosz Przydatek and Dawn Song and Adrian Perrig},
title = {SIA: secure information aggregation in sensor networks},
booktitle = {SenSys '03: Proceedings of the 1st international conference on Embedded networked sensor systems},
journal = {SenSys},
publisher = {ACM},
year = {2003},
pages = {255--265},
url = {http://www.cs.berkeley.edu/~dawnsong/papers/sia.pdf},
doi = {http://doi.acm.org/10.1145/958491.958521}
}
|
|||||
| Rajagopalan, R. & Varshney, P. K. | Data aggregation techniques in sensor networks: A survey | 2006 | Communications Surveys & Tutorials, IEEE | article | URL |
| Abstract: Wireless sensor networks consist of sensor nodes with sensing and communication capabilities. We focus on data aggregation problems in energy constrained sensor networks. The main goal of data aggregation algorithms is to gather and aggregate data in an energy efficient manner so that network lifetime is enhanced. In this paper, we present a survey of data aggregation algorithms in wireless sensor networks. We compare and contrast different algorithms on the basis of performance measures such as lifetime, latency and data accuracy. We conclude with possible future research directions. |
|||||
BibTeX:
@article{rajagopalan06commSurvey,
author = {Ramesh Rajagopalan and Pramod K. Varshney},
title = {Data aggregation techniques in sensor networks: A survey},
journal = {Communications Surveys & Tutorials, IEEE},
year = {2006},
volume = {6},
pages = {48-63},
url = {http://web.syr.edu/~rarajago/Com_survey_final_draft.pdf}
}
|
|||||
| Rosario Gennaro1, Shai Halevi1, H. K. & Rabin1, T. | Threshold RSA for Dynamic and Ad-Hoc Groups | 2008 | Advances in Cryptology – EUROCRYPT | article | URL |
| Abstract: We consider the use of threshold signatures in ad-hoc and dynamic groups such as MANETs (“mobile ad-hoc networks”). While the known threshold RSA signature schemes have several properties that make them good candidates for deployment in these scenarios, none of these schemes seems practical enough for realistic use in these highly-constrained environments. In particular, this is the case of the most efficient of these threshold RSA schemes, namely, the one due to Shoup. Our contribution is in presenting variants of Shoup’s protocol that overcome the limitations that make the original protocol unsuitable for dynamic groups. The resultant schemes provide the efficiency and flexibility needed in ad-hoc groups, and add the capability of incorporating new members (share-holders) to the group of potential signers without relying on central authorities. Namely, any threshold of existing members can cooperate to add a new member. The schemes are efficient, fully non-interactive and do not assume broadcast. | |||||
BibTeX:
@article{gennaro08eurocrypto,
author = {Rosario Gennaro1, Shai Halevi1, Hugo Krawczyk1 and Tal Rabin1},
title = {Threshold RSA for Dynamic and Ad-Hoc Groups},
journal = {Advances in Cryptology – EUROCRYPT},
year = {2008},
url = {http://www.springerlink.com/index/3llp7169727k5k46.pdf}
}
|
|||||
| Shmatikov, V. | Privacy [BibTeX] |
2008 | Bibliography | incollection | URL |
BibTeX:
@incollection{vitaly08bib,
author = {Vitaly Shmatikov},
title = {Privacy},
booktitle = {Bibliography},
publisher = {self},
year = {2008},
url = {http://www.cs.utexas.edu/~shmat/}
}
|
|||||
| Wang, P., Ning, P. & Reeves, D. S. | A k-anonymous communication protocol for overlay networks. | 2007 | ASIACCS | inproceedings | URL |
| Abstract: Anonymity is increasingly important for network applica-tions concerning about censorship and privacy. The ex-isting anonymous communication protocols generally stem from mixnet and DC-net. They either cannot provide provable anonymity or suffer from transmission collision. In this paper, we introduce a novel approach which takes advan-tage of hierarchical ring structure and mix technique. This proposed protocol is collision free and provides provable k-anonymity for both the sender and the recipient, even if a polynomial time adversary can eavesdrop all network traf-fic and control a fraction of participants. Furthermore, it can hide the sender and the recipient from each other and thus can be used for anonymous file sharing. The analysis shows the proposed protocol is secure against various at-tacks. Measurements further demonstrate it is practical. | |||||
| Review: UnRead | |||||
BibTeX:
@inproceedings{wangNR07ccs,
author = {Pan Wang and Peng Ning and Douglas S. Reeves},
title = {A k-anonymous communication protocol for overlay networks.},
booktitle = {ASIACCS},
publisher = {ACM},
year = {2007},
pages = {45-56},
url = {http://discovery.csc.ncsu.edu/~pning/pubs/ASIACCS07b.pdf}
}
|
|||||
| Weatherspoon, H. & Kubiatowicz, J. | Erasure Coding Vs. Replication: A Quantitative Comparison | 2002 | IPTPS '01: Revised Papers from the First International Workshop on Peer-to-Peer Systems | inproceedings | DOI |
| Review: UnRead | |||||
BibTeX:
@inproceedings{687814,
author = {Hakim Weatherspoon and John Kubiatowicz},
title = {Erasure Coding Vs. Replication: A Quantitative Comparison},
booktitle = {IPTPS '01: Revised Papers from the First International Workshop on Peer-to-Peer Systems},
publisher = {Springer-Verlag},
year = {2002},
pages = {328--338},
doi = {http://portal.acm.org/citation.cfm?id=646334.687814}
}
|
|||||
| Yi Yang, Xinran Wang, S. Z. & Cao, G. | SDAP: A Secure HopbyHop Data Aggregation Protocol for Sensor Networks | 2006 | MobiHoc | article | URL |
| Abstract: Hop-by-hop data aggregation is a very important technique for reducing the communication overhead and energy expenditure of sensor nodes during the process of data collection in a sensor network. However, because individual sensor readings are lost in the per-hop aggregation process, compromised nodes in the network may forge false values as the aggregation results of other nodes, tricking the base station into accepting spurious aggregation results. Here a fundamental challenge is: how can the base station obtain a good approximation of the fusion result when a fraction of sensor nodes are compromised.To answer this challenge, we propose SDAP, a Secure Hop-by-hop Data Aggregation Protocol for sensor networks. The design of SDAP is based on the principles of divide-and-conquer and commit-and-attest. First, SDAP uses a novel probabilistic grouping technique to dynamically partition the nodes in a tree topology into multiple logical groups (subtrees) of similar sizes. A commitment-based hop-by-hop aggregation is performed in each group to generate a group aggregate. The base station then identifies the suspicious groups based on the set of group aggregates. Finally, each group under suspect participates in an attestation process to prove the correctness of its group aggregate. Our analysis and simulations show that SDAP can achieve the level of efficiency close to an ordinary hop-by-hop aggregation protocol while providing certain assurance on the trustworthiness of the aggregation result. Moreover, SDAP is a general-purpose secure aggregation protocol applicable to multiple aggregation functions. | |||||
BibTeX:
@article{yang06mobihoc,
author = {Yi Yang, Xinran Wang, Sencun Zhu†, and Guohong Cao},
title = {SDAP: A Secure HopbyHop Data Aggregation Protocol for Sensor Networks},
journal = {MobiHoc},
year = {2006},
url = {http://www.cse.psu.edu/~szhu/papers/sdap.pdf}
}
|
|||||
| Yingpeng Sang, Hong Shen, Y. I. Y. T. N. X. | Secure Data Aggregation inWireless Sensor Networks: A Survey | 2006 | PDCAT -Parallel and Distributed Computing,Applications and Technologies | article | URL |
| Abstract: Data aggregation is a widely used technique in wireless sensor networks. The security issues, data confidentiality and integrity, in data aggregation become vital when the sensor network is deployed in a hostile environment. There has been many related work proposed to address these security issues. In this paper we survey these work and classify them into two cases: hop-by-hop encrypted data aggregation and end-to-end encrypted data aggregation. We also propose two general frameworks for the two cases respectively. The framework for end-to-end encrypted data aggregation has higher computation cost on the sensor nodes, but achieves stronger security, in comparison with the framework for hop-by-hop encrypted data aggregation. | |||||
BibTeX:
@article{sang06pdcat,
author = {Yingpeng Sang,Hong Shen,Yasushi Inoguchi, Yasuo Tan, Naixue Xiong},
title = {Secure Data Aggregation inWireless Sensor Networks: A Survey},
journal = {PDCAT -Parallel and Distributed Computing,Applications and Technologies},
year = {2006},
url = {http://ieeexplore.ieee.org/iel5/4032130/4032131/04032199.pdf?isnumber=4032131&prod=CNF&arnumber=4032199&arSt=315&ared=320&arAuthor=Yingpeng+Sang%3B+Hong+Shen%3B+Yasushi+Inoguchi%3B+Yasuo+Tan%3B+Naixue+Xiong}
}
|
|||||
| Zhen Yu, Yawen Wei, B. R. & Guan, Y. | An Efficient Signature-based Scheme for Securing Network Coding against Pollution Attacks | 2008 | 27th IEEE Conference on Computer Communications INFOCOM | inproceedings | |
| Abstract: Network coding provides the possibility to maximize network throughput and receives various applications in traditional computer networks, wireless sensor networks and peer-to-peer systems. However, the applications built on top of network coding are vulnerable to pollution attacks, in which the compromised forwarders can inject polluted or forged messages into networks. Existing schemes addressing pollution attacks either require an extra secure channel or incur high computation overhead. In this paper, we propose an efficient signature-based scheme to detect and filter pollution attacks for the applications adopting linear network coding techniques. Our scheme exploits a novel homomorphic signature function to enable the source to delegate its signing authority to forwarders, that is, the forwarders can generate the signatures for their output messages without contacting the source. This nice property allows the forwarders to verify the received messages, but prohibit them from creating the valid signatures for polluted or forged ones. Our scheme does not need any extra secure channels, and can provide source authentication and batch verification. Experimental results show that it can improve computation efficiency up to ten times compared to some existing one. In addition, we present an alternate lightweight scheme based on a much simpler linear signature function. This alternate scheme provides a tradeoff between computation efficiency and security. | |||||
| Review: For regular network: =============== "scheme works" The basic idea is t ^ ed = 1, for any t public key : e private key: d sender: h(M) = (g ^ M)^d forwarder: E=alpha . M h(E) = h(M) ^ p>where, alpha - encoding vector verification: check, h(E) ^ e ?= g^ E For WSN: ======= "scheme has serious security flaw" un suitable for WSN problem: because, source sending more than (m+n) linearly independent messages allows the adversary to solve src's private key. |
|||||
BibTeX:
@inproceedings{yu08infocom,
author = {Zhen Yu, Yawen Wei, Bhuvaneswari Ramkumar, and Yong Guan},
title = {An Efficient Signature-based Scheme for Securing Network Coding against Pollution Attacks},
booktitle = {27th IEEE Conference on Computer Communications INFOCOM},
year = {2008}
}
|
|||||
| Securing Wireless Sensor Network [BibTeX] |
booklet | ||||
BibTeX:
@booklet{propWSN,,
title = {Securing Wireless Sensor Network}
}
|
|||||
Created by JabRef on 11/05/2008.