Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/2659532.2659643acmotherconferencesArticle/Chapter ViewAbstractPublication PagescompsystechConference Proceedingsconference-collections
research-article

Tree-based revocation for authentication in vehicular ad-hoc networks

Published: 27 June 2014 Publication History

Abstract

A dynamic authenticated data structure based on k-ary trees is here proposed to improve the performance of certificate revocation in vehicular ad-hoc networks. Such a structure allows taking advantage of a duplex construction of the new standard SHA-3. In particular, efficient algorithms for search, insertion, deletion and restructuring the used k-ary trees are presented. This is a work in progress, and in the near future an implementation of a proof-of-concept prototype for smartphones will be available.

References

[1]
Bertoni G., Daemen J., Peeters M., Van Assche G., Duplexing the Sponge: Single-Pass Authenticated Encryption and Other Applications, Selected Areas in Cryptography, pp. 320--337, 2011.
[2]
Bertoni G., Daemen J., Peeters M., Van Assche G., Keccak sponge function family main document version 2.1, Updated submission to NIST (Round 2), 2010.
[3]
Chang S., Perlner R., Burr W., Turan M., Kelsey J., Paul S., Bassham L., Third-Round Report of the SHA-3 Cryptographic Hash Algorithm Competition, nvlpubs.nist.gov/nistpubs/ir/2012/NIST.IR.7896.pdf, 2012.
[4]
Ganan C., Munoz J., Esparza O., Mata-Diaz J., Alins J., Toward Revocation Data Handling Efficiency in VANETs, Communication Technologies for Vehicles Lecture Notes in Computer Science 7266, pp. 80--90, 2012.
[5]
Jakobsson M., Wetzel S., Efficient attribute authentication with applications to ad hoc networks, ACM international workshop on Vehicular ad hoc networks, pp. 38--46, 2004.
[6]
Merkle R. C., Protocols for public key cryptosystems. IEEE Symposium on Security and privacy 1109, pp. 122--134, 1980.

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Other conferences
CompSysTech '14: Proceedings of the 15th International Conference on Computer Systems and Technologies
June 2014
489 pages
ISBN:9781450327534
DOI:10.1145/2659532
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

  • UORB: University of Ruse, Bulgaria
  • Querbie: Querbie

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 June 2014

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. hash function
  2. k-ary tree
  3. revocation
  4. vehicular ad-hoc network

Qualifiers

  • Research-article

Conference

CompSysTech'14
Sponsor:
  • UORB
  • Querbie

Acceptance Rates

CompSysTech '14 Paper Acceptance Rate 56 of 107 submissions, 52%;
Overall Acceptance Rate 241 of 492 submissions, 49%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 74
    Total Downloads
  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)0
Reflects downloads up to 04 Oct 2024

Other Metrics

Citations

View Options

Get Access

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media