http://iet.metastore.ingenta.com
1887

Effective certificate revocation scheme based on weighted voting game approach

Effective certificate revocation scheme based on weighted voting game approach

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Information Security — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Mobile ad hoc networks (MANETs) are wireless networks that have a wide range of applications because of their dynamic topologies and ease of deployment. Owing to the independent and dynamic nature of mobile nodes, the topology of a MANET often changes and is prone to various attacks. Therefore, substantial research in the area of security is required. Certificate revocation is an effective mechanism for providing network security services. However, the existing schemes are not well suited to MANETs because of their considerable overhead or low accuracy with respect to certificate revocation. In this study, the authors investigate a distributed certificate revocation protocol. On the basis of the game-theoretic model, they design a new voting-based security scheme. Their game-based security paradigm can provide the ability to practically respond to the current system conditions and is suitable for real MANET operations. Simulation results demonstrate the effectiveness and the efficiency of their scheme with respect to certificate revocation. Finally, they discuss the results of an evaluation provide an outlook on the future work in this field.

References

    1. 1)
      • 1. Raya, M., Manshaei, M.H., Félegyhazi, M., et al: ‘Revocation games in ephemeral networks’. Proc. of ACM Conf. on Computer and Communications Security, 2008, pp. 199210.
    2. 2)
      • 2. Bilogrevic, I., Manshaei, H., Raya, M., et al: ‘Optimal revocations in ephemeral networks: a game-theoretic framework’. Proc. of the Eighth Int. Symp. on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WiOpt), 2010, pp. 2130.
    3. 3)
      • 3. Kim, J.-H., Lee, K.-J., Kim, T.-H., et al: ‘Effective routing schemes for double-layered peer-to-peer systems in MANET’, JCSE, 2011, 5, (1), pp. 1931.
    4. 4)
      • 4. Htike, Z., Hong, C.S., Lee, S.: ‘The life cycle of the rendezvous problem of cognitive radio ad hoc networks: a survey’, JCSE, 2013, 7, (2), pp. 8188.
    5. 5)
      • 5. Marti, I.L.: ‘Evaluation of a game-theoretical protocol for certificate revocation in vehicular networks’. Master thesis, École polytechnique fédérale de Lausanne, Lausanne, Switzerland, 2008.
    6. 6)
      • 6. Indhu Lekha, S.J., Kathiroli, R.: ‘Trust based certificate revocation of malicious nodes in MANET’. IEEE ICACCCT'2014, 2014, pp. 11851189.
    7. 7)
      • 7. Zuckerman, M., Faliszewski, P., Bachrach, Y., et al: ‘Manipulating the quota in weighted voting games’. Conf. on Artificial Intelligence (AAAI'2008), 2008, pp. 215220.
    8. 8)
      • 8. Kim, S.: ‘Game theory applications in network design’ (IGI Global, PA, USA, 2014).
    9. 9)
      • 9. Park, K., Nishiyama, H., Ansari, N., et al: ‘Certificate revocation to cope with false accusations in mobile ad hoc networks’. IEEE VTC'2010, 2010, pp. 15.
    10. 10)
      • 10. Guo, C., Xu, H., Ju, L., et al: ‘A high-performance distributed certificate revocation scheme for mobile ad hoc networks’. IEEE TrustCom'2014, 2014, pp. 156163.
    11. 11)
    12. 12)
      • 12. Steven Raj, N., Kathare, S.: ‘Clustering of certificate revocation to reinforce an idea for mobile ad hoc networks’, Int. J. Eng. Res. Technol., 2014, 3, (7), pp. 682685.
    13. 13)
      • 13. Bachrach, Y., Elkind, E.: ‘Divide and conquer: false-name manipulations in weighted voting games’. Int. Conf. on Autonomous Agents and Multiagent Systems (AAMAS'08), 2008, pp. 975982.
    14. 14)
      • 14. Zuckerman, M., Faliszewski, P., Bachrach, Y., et al: ‘Manipulating the quota in weighted voting games’. Conf. on Artificial Intelligence, 2008, pp. 1317.
    15. 15)
      • 15. Izquierdo, L.R., Izquierdo, S.S.: ‘Dynamics of the Bush–Mosteller learning algorithm in 2 × 2 games’ (InTech Publisher, 2008).
    16. 16)
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-ifs.2015.0047
Loading

Related content

content/journals/10.1049/iet-ifs.2015.0047
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address