Jolyon Clulow
Tyler Moore
Abstract
We consider the problem of credential revocation in self-organizing systems. In the absence of a common trusted authority, reaching a decision is slow, expensive and prone to manipulation. We propose a radical, new strategy---suicide for the common good---which drastically simplifies the decision-making process and revocation orders. Our mechanism is fully decentralized, incurs low communication and storage overhead, enables fast removal of misbehaving nodes, and is ideally suited to highly mobile networks.
- S. Brands and D. Chaum. Distance-bounding protocols (extended abstract). In EUROCRYPT, pages 344--359, 1993. Google Scholar
Digital Library
- S. Buchegger and J.-Y. L. Boudec. Performance analysis of the confidant protocol. In MobiHoc, pages 226--236. ACM, 2002. Google ScholarDigital Library
- S. Capkun, L. Buttyán, and J.-P. Hubaux. Sector: secure tracking of node encounters in multi-hop wireless networks. In S. Setia and V. Swarup, editors, SASN, pages 21--32. ACM, 2003. Google ScholarDigital Library
- H. Chan, V. D. Gligor, A. Perrig, and G. Muralidharan. On the distribution and revocation of cryptographic keys in sensor networks. IEEE Trans. Dependable Secur. Comput., 2(3):233--247, 2005. Google ScholarDigital Library
- H. Chan, A. Perrig, and D. X. Song. Random key predistribution schemes for sensor networks. In IEEE Symposium on Security and Privacy, pages 197--. IEEE Computer Society, 2003. Google ScholarDigital Library
- C. Crépeau and C. R. Davis. A certificate revocation scheme for wireless ad hoc networks. In SASN '03: Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks, pages 54--61, New York, NY, USA, 2003. ACM Press. Google ScholarDigital Library
- J. R. Douceur. The Sybil attack. In P. Druschel, M. F. Kaashoek, and A. I. T. Rowstron, editors, IPTPS, volume 2429 of Lecture Notes in Computer Science, pages 251--260. Springer, 2002. Google ScholarDigital Library
- M. Feldman, K. Lai, I. Stoica, and J. Chuang. Robust incentive techniques for peer-to-peer networks. In EC '04: Proceedings of the 5th ACM conference on Electronic commerce, pages 102--111. ACM Press, 2004. Google ScholarDigital Library
- S. Ganeriwal and M. B. Srivastava. Reputation-based framework for high integrity sensor networks. In S. Setia and V. Swarup, editors, SASN, pages 66--77. ACM, 2004. Google ScholarDigital Library
- G. P. Hancke and M. G. Kuhn. An RFID distance bounding protocol. In IEEE SecureComm 2005, Athens, Greece, 5--9 September 2005, pages 67--73. IEEE Computer Society, 2005. Google ScholarDigital Library
- R. Housley, W. Polk, W. Ford, and D. Solo. Internet X.509 Public Key Infrastructure Certificate and Certificate Revocation List (CRL) Profile. RFC 3280 (Proposed Standard), Apr. 2002. Updated by RFC 4325. Google ScholarDigital Library
- Y.-C. Hu, A. Perrig, and D. B. Johnson. Packet leashes: A defense against wormhole attacks in wireless networks. In INFOCOM, 2003.Google ScholarCross Ref
- S. D. Kamvar, M. T. Schlosser, and H. Garcia-Molina. The eigentrust algorithm for reputation management in P2P networks. In WWW '03: Proceedings of the twelfth international conference on World Wide Web, pages 640--651. ACM Press, 2003. Google ScholarDigital Library
- J. Kong, P. Zerfos, H. Luo, S. Lu, and L. Zhang. Providing robust and ubiquitous security support for mobile ad hoc networks. In ICNP, pages 251--260. IEEE Computer Society, 2001. Google ScholarDigital Library
- D. Liu, P. Ning, and W. Du. Detecting malicious beacon nodes for secure location discovery in wireless sensor networks. In ICDCS, pages 609--619. IEEE Computer Society, 2005. Google ScholarDigital Library
- P. Michiardi and R. Molva. Core: a collaborative reputation mechanism to enforce node cooperation in mobile ad hoc networks. In B. Jerman-Blazic and T. Klobucar, editors, Communications and Multimedia Security, volume 228 of IFIP Conference Proceedings, pages 107--121. Kluwer, 2002. Google ScholarDigital Library
- J. Newsome, E. Shi, D. X. Song, and A. Perrig. The Sybil attack in sensor networks: analysis & defenses. In K. Ramchandran, J. Sztipanovits, J. C. Hou, and T. N. Pappas, editors, IPSN, pages 259--268. ACM, 2004. Google ScholarDigital Library
- B. Parno, A. Perrig, and V. D. Gligor. Distributed detection of node replication attacks in sensor networks. In IEEE Symposium on Security and Privacy, pages 49--63. IEEE Computer Society, 2005. Google ScholarDigital Library
- A. Perrig, R. Szewczyk, J. D. Tygar, V. Wen, and D. E. Culler. SPINS: security protocols for sensor networks. Wirel. Netw., 8(5):521--534, 2002. Google ScholarDigital Library
- A. Serjantov and R. Anderson. On dealing with adversaries fairly. In Proceedings of the Third Annual Workshop on Economics and Information Security, May 2004.Google Scholar
- L. Xiong and L. Liu. A reputation-based trust model for peer-to-peer ecommerce communities. In ACM Conference on Electronic Commerce, pages 228--229. ACM, 2003. Google ScholarDigital Library
- L. Zhou and Z. J. Haas. Securing ad hoc networks. IEEE Network, 13(6):24--30, 1999. Google ScholarDigital Library
Index Terms
- Suicide for the common good: a new strategy for credential revocation in self-organizing systems
Recommendations
Cryptanalytic results on `Dual CRT' and `Common Prime' RSA
In this paper we study weaknesses of two variants of RSA: Dual RSA and Common Prime RSA. Several schemes under the framework of Dual RSA have been proposed by Sun et al. (IEEE Trans Inf Theory 53(8):2922---2933, 2007). We here concentrate on the Dual ...
Order-preserving encryption using approximate common divisors
AbstractOrder-preservation is a highly desirable property for encrypted databases as it allows range queries over ciphertexts. Order-preserving encryption (OPE) is used in the encrypted database systems CryptDB and Cipherbase. The former has ...
Characteristics of common mobility models for opportunistic networks
PM2HW2N '07: Proceedings of the 2nd ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networksUnderstanding the characteristics of synthetic mobility models is important for the design and analysisof routing schemes for mobile ad hoc networks (MANETs). This is especially true for mobile opportunistic networks where node mobility is utilized to ...
Comments