
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Nitesh Saxena, Gene Tsudik, Jeong Hyun Yi, "Efficient Node Admission and Certificateless Secure Communication in ShortLived MANETs," IEEE Transactions on Parallel and Distributed Systems, vol. 20, no. 2, pp. 158170, February, 2009.  
BibTex  x  
@article{ 10.1109/TPDS.2008.77, author = {Nitesh Saxena and Gene Tsudik and Jeong Hyun Yi}, title = {Efficient Node Admission and Certificateless Secure Communication in ShortLived MANETs}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {20}, number = {2}, issn = {10459219}, year = {2009}, pages = {158170}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.77}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Efficient Node Admission and Certificateless Secure Communication in ShortLived MANETs IS  2 SN  10459219 SP158 EP170 EPD  158170 A1  Nitesh Saxena, A1  Gene Tsudik, A1  Jeong Hyun Yi, PY  2009 KW  Security KW  distributed access control KW  authentication KW  cryptographic protocols KW  ad hoc networks KW  mobile network protocols. VL  20 JA  IEEE Transactions on Parallel and Distributed Systems ER   
[1] K. Barr and K. Asanovic, “Energy Aware Lossless Data Compression,” Proc. First ACM Int'l Conf. Mobile Systems, Applications, and Services (MobiSys '03), pp. 231244, 2003.
[2] O. Baudron, D. Pointcheval, and J. Stern, “Extended Notions of Security for Multicast Public Key Cryptosystems,” Proc. 27th Int'l Colloquium on Automata, Languages and Programming (ICALP '00), pp. 499511, 2000.
[3] M. Bellare and P. Rogaway, “Random Oracles Are Practical: A Paradigm for Designing Efficient Protocols,” Proc. First ACM Conf. Computer and Comm. Security (CCS '93), pp. 6273, 1993.
[4] M. Bellare, A. Boldyreva, and S. Micali, “PublicKey Encryption in a MultiUser Setting: Security Proofs and Improvements,” Proc. Int'l Conf. Theory and Application of Cryptographic Techniques (EUROCRYPT '00), pp. 259274, 2000.
[5] M. Bellare, A. Boldyreva, and A. Palacio, “An Uninstantiable RandomOracleModel Scheme for a Hybrid Encryption Problem,” Proc. Int'l Conf. Theory and Application of Cryptographic Techniques (EUROCRYPT '04), pp. 171188, 2004.
[6] M. BenOr, S. Goldwasser, and A. Wigderson, “Completeness Theorems for NonCryptographic FaultTolerant Distributed Computation,” Proc. 20th Ann. ACM Symp. Theory of Computing (STOC '88), pp. 110, 1988.
[7] C. Blundo, A.D. Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung, “PerfectlySecure Key Distribution for Dynamic Conferences,” Proc. 12th Ann. Int'l Cryptology Conf. (CRYPTO'92), pp. 471486, 1992.
[8] A. Boldyreva, “Efficient Threshold Signatures, Multisignatures and Blind Signatures Based on the GapDiffieHellmanGroup Signature Scheme,” Proc. Sixth Int'l Workshop Theory and Practice in Public Key Cryptography (PKC '03), pp. 3146, 2003.
[9] D. Boneh and M.K. Franklin, “IdentityBased Encryption from the Weil Pairing,” Proc. 21st Ann. Int'l Cryptology Conf. (CRYPTO '01), pp. 213229, 2001.
[10] G. Bracha, “An Asynchronous $\lfloor(n1)/3\rfloor\hbox{}{\rm Resilient}$ Consensus Protocol,” Proc. Third Ann. ACM Symp. Principles of Distributed Computing (PODC '84), pp. 154162, 1984.
[11] C. Castelluccia, N. Saxena, and J.H. Yi, “SelfConfigurable Key PreDistribution in Mobile Ad Hoc Networks,” Proc. Fourth Int'l IFIP Networking Conf. (Networking '05), pp. 10831095, 2005.
[12] J.C. Cha and J.H. Cheon, “An IDBased Signature from GapDiffieHellman Groups,” Proc. Sixth Int'l Workshop Theory and Practice in Public Key Cryptography (PKC '03), pp. 1830, 2003.
[13] B. Dahill, B. Levine, E. Royer, and C. Shields, “A Secure Routing Protocol for Ad Hoc Networks,” Technical Report UMCS2001037, Univ. of Massachusetts, 2001.
[14] Y. Desmedt and Y. Frankel, “Threshold Cryptosystems,” Proc. Ninth Ann. Int'l Cryptology Conf. (CRYPTO '89), pp. 307315, 1989.
[15] T. ElGamal, “A PublicKey Cryptosystem and a Signature Scheme Based on Discrete Logarithms,” IEEE Trans. Information Theory, pp.469472, 1985.
[16] P. Feldman, “A Practical Scheme for NonInteractive Verifiable Secret Sharing,” Proc. 28th Ann. Symp. Foundations of Computer Science (FOCS '87), pp. 427437, 1987.
[17] E. Fujisaki and T. Okamoto, “Secure Integration of Asymmetric and Symmetric Encryption Schemes,” Proc. 19th Ann. Int'l Cryptology Conf. (CRYPTO '99), pp. 537554, 1999.
[18] R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, “Robust Threshold DSS Signatures,” Proc. 16th Ann. Int'l Cryptology Conf. (CRYPTO '96), pp. 354371, 1996.
[19] R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, “Secure Distributed Key Generation for DiscreteLog Based Cryptosystems,” Proc. Int'l Conf. Theory and Application of Cryptographic Techniques (EUROCRYPT '99), pp. 295310, 1999.
[20] S. Goldwasser and S. Micali, “Probabilistic Encryption,” J.Computer and System Sciences, vol. 28, pp. 270299, 1989.
[21] S. Goldwasser, S. Micali, and R.L. Rivest, “A Paradoxical Solution to the Signature Problem,” Proc. 25th Ann. Symp. Foundations of Computer Science (FOCS '84), pp. 441448, 1984.
[22] S. Goldwasser, S. Micali, and R.L. Rivest, “A Digital Signature Scheme Secure Against Adaptive ChosenMessage Attacks,” SIAM J. Computing, vol. 17, no. 2, pp. 281308, 1988.
[23] M.T. Goodrich, M. Sirivianos, J. Solis, G. Tsudik, and E. Uzun, “Loud and Clear: HumanVerifiable Authentication Based on Audio,” Proc. 26th Int'l Conf. Distributed Computing Systems (ICDCS), 2006.
[24] A. Herzberg, S. Jarecki, H. Krawczyk, and M. Yung, “Proactive Secret Sharing, or How to Cope with Perpetual Leakage,” Proc. 15th Ann. Int'l Cryptology Conf. (CRYPTO '95), pp. 339352, 1995.
[25] R. Hills, “Sensing for Danger,” Science Technology Report, http://www.llnl.gov/str/JulAug01Hills.html , July/Aug. 2001.
[26] Y.C. Hu, D.B. Johnson, and A. Perrig, “SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks,” Proc. Fourth IEEE Workshop Mobile Computing Systems and Applications (WMCSA '02), pp. 313, 2002.
[27] Y.C. Hu, A. Perrig, and D.B. Johnson, “Ariadne: A Secure OnDemand Routing Protocol for Ad Hoc Networks,” Proc. ACM MobiCom '02, pp. 1223, 2002.
[28] S. Jarecki, N. Saxena, and J.H. Yi, “An Attack on the Proactive RSA Signature Scheme in the URSA Ad Hoc Network Access Control Protocol,” Proc. ACM Workshop Security of Ad Hoc and Sensor Networks (SASN '04), pp. 19, 2004.
[29] J. Kong, H. Luo, K. Xu, D.L. Gu, M. Gerla, and S. Lu, “Adaptive Security for MultiLevel Adhoc Networks,” Wireless Comm. and Mobile Computing, vol. 2, no. 5, pp. 533547, 2002.
[30] J. Kong, P. Zerfos, H. Luo, S. Lu, and L. Zhang, “Providing Robust and Ubiquitous Security Support for MANET,” Proc. Ninth IEEE Int'l Conf. Network Protocols (ICNP '01), pp. 251260, 2001.
[31] D. Liu and P. Ning, “Establishing Pairwise Keys in Distributed Sensor Networks,” Proc. 10th ACM Conf. Computer and Comm. Security (CCS '03), pp. 5261, 2003.
[32] H. Luo, J. Kong, P. Zerfos, S. Lu, and L. Zhang, “URSA: Ubiquitous and Robust Access Control for Mobile Ad Hoc Networks,” IEEE/ACM Trans. Networking, vol. 12, no. 6, pp. 10491063, 2004.
[33] H. Luo, P. Zerfos, J. Kong, S. Lu, and L. Zhang, “SelfSecuring Ad Hoc Wireless Networks,” Proc. Seventh IEEE Symp. Computers and Comm. (ISCC '02), pp. 567574, 2002.
[34] J.M. McCune, A. Perrig, and M.K. Reiter, “SeeingIsBelieving: Using Camera Phones for HumanVerifiable Authentication,” Proc. IEEE Symp. Security and Privacy (S&P '05), pp. 110124, 2005.
[35] M. Naor, B. Pinkas, and O. Reingold, “Distributed PseudoRandom Functions and KDCs,” Proc. Int'l Conf. Theory and Application of Cryptographic Techniques (EUROCRYPT '99), pp. 327346, 1999.
[36] M. Narasimha, G. Tsudik, and J.H. Yi, “On the Utility of Distributed Cryptography in P2P and MANETs: The Case of Membership Control,” Proc. 11th IEEE Int'l Conf. Network Protocols (ICNP '03), pp. 336345, 2003.
[37] OLSR Protocol, http://menetou.inria.frolsr, 2008.
[38] OpenSSL Project, http:/www.openssl.org, 2008.
[39] Peer Group Admission Control Project, http://sconce.ics.uci.edugac, 2008.
[40] D. Pointcheval and J. Stern, “Security Proofs for Signature Schemes,” Proc. Int'l Conf. Theory and Application of Cryptographic Techniques (EUROCRYPT '96), pp. 387398, 1996.
[41] W.H. Press, B.P. Flannery, S.A. Teukolsky, and W.T. Vetterling, Numerical Recipes in C: The Art of Scientific Computing, ISBN 0521431085, Cambridge Univ. Press, 1992.
[42] N. Saxena, “Public Key Cryptography Sans Certificates in Ad Hoc Networks,” Proc. Fourth Int'l Conf. Applied Cryptography and Network Security (ACNS '06), pp. 375389,
[43] N. Saxena, J.E. Ekberg, K. Kostiainen, and N. Asokan, “Secure Device Pairing Based on a Visual Channel (Short Paper),” Proc. IEEE Symp. Security and Privacy (S&P '06), pp. 306313, 2006.
[44] N. Saxena, G. Tsudik, and J.H. Yi, “Admission Control in PeertoPeer: Design and Performance Evaluation,” Proc. ACM Workshop Security of Ad Hoc and Sensor Networks (SASN '03), pp. 104114, 2003.
[45] N. Saxena, G. Tsudik, and J.H. Yi, “IdentityBased Access Control for AdHoc Groups,” Proc. Seventh Int'l Conf. Information Security and Cryptology (ICISC '04), pp. 362379, 2004.
[46] N. Saxena, G. Tsudik, and J.H. Yi, “Efficient Node Admission for ShortLived Mobile Ad Hoc Networks,” Proc. 13th IEEE Int'l Conf. Network Protocols (ICNP '05), pp. 269278, 2005.
[47] N. Saxena, G. Tsudik, and J.H. Yi, “Threshold Cryptography in P2P and MANETs: The Case of Access Control,” Computer Networks, vol. 51, pp. 36323649, 2007.
[48] C.P. Schnorr, “Efficient Signature Generation by Smart Cards,” J. Cryptology, vol. 4, no. 3, pp. 161174, 1991.
[49] A. Shamir, “How to Share a Secret,” Comm. ACM, vol. 22, no. 11, pp. 612613, 1979.
[50] M. Steiner, G. Tsudik, and M. Waidner, “CLIQUES: A New Approach to Group Key Agreement,” Proc. 18th IEEE Int'l Conf. Distributed Computing Systems (ICDCS '98), pp. 380387, 1998.
[51] M. Steiner, G. Tsudik, and M. Waidner, “Key Agreement in Dynamic Peer Groups,” IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 8, pp. 769780, Aug. 2000.
[52] D.R. Stinson and R. Strobl, “Provably Secure Distributed Schnorr Signatures and a $(t, n)$ Threshold Scheme for Implicit Certificates,” Proc. Sixth Australasian Conf. Information Security and Privacy (ACISP '01), pp. 417434, 2001.
[53] E. Uzun, K. Karvonen, and N. Asokan, “Usability Analysis of Secure Pairing Methods,” Proc. First Int'l Workshop Usable Security (USEC '07), pp. 1516, 2007.
[54] P. van Oorschot, “Extending Cryptographic Logics of Belief to Key Agreement Protocols,” Proc. First ACM Conf. Computer and Comm. Security (CCS '93), pp. 232243, 1993.
[55] L. Zhou and Z.J. Haas, “Securing Ad Hoc Networks,” IEEE Network Magazine, vol. 13, no. 6, pp. 2430, 1999.