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

skip to main content
10.1145/2557547.2557583acmconferencesArticle/Chapter ViewAbstractPublication PagescodaspyConference Proceedingsconference-collections
poster

Spoilt for choice: graph-based assessment of key management protocols to share encrypted data

Published: 03 March 2014 Publication History

Abstract

Sharing data with client-side encryption requires key management. Selecting an appropriate key management protocol for a given scenario is hard, since the interdependency between scenario parameters and the resource consumption of a protocol is often only known for artificial, simplified scenarios. In this paper, we explore the resource consumption of systems that offer sharing of encrypted data within real-world scenarios, which are typically complex and determined by many parameters. For this purpose, we first collect empirical data that represents real-world scenarios by monitoring large-scale services within our organization. We then use this data to parameterize a resource consumption model that is based on the key graph generated by each key management protocol. The preliminary simulation runs we did so far indicate that this key-graph based model can be used to estimate the resource consumption of real-world systems for sharing encrypted data.

References

[1]
Y. Challal. Group Key Management Protocols: A Novel Taxonomy. International Journal of Information Technology, 2(2):105--118, 2005.
[2]
D. Grolimund, L. Meisser, S. Schmid, and R. Wattenhofer. Cryptree: A Folder Tree Structure for Cryptographic File Systems. In 25th IEEE Symposium on Reliable Distributed Systems - SRDS '06, pages 189--198, 2006.
[3]
R. Krishnan, R. Sandhu, J. Niu, and W. H. Winsborough. Foundations For Group-Centric Secure Information Sharing Models. In Proceedings of the 14th ACM Symposium on Access Control Models and Technologies - SACMAT '09, page 115, 2009.
[4]
C. K. Wong, M. Gouda, and S. S. Lam. Secure Group Communications Using Key Graphs. ACM SIGCOMM Computer Communication Review, 28(4):68--79, Oct. 1998.

Cited By

View all
  • (2015)On the Resource Consumption of Secure Data SharingProceedings of the 2015 IEEE Trustcom/BigDataSE/ISPA - Volume 0110.1109/Trustcom.2015.460(880-889)Online publication date: 20-Aug-2015

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
CODASPY '14: Proceedings of the 4th ACM conference on Data and application security and privacy
March 2014
368 pages
ISBN:9781450322782
DOI:10.1145/2557547
Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 March 2014

Check for updates

Author Tags

  1. key management protocols
  2. workloads

Qualifiers

  • Poster

Conference

CODASPY'14
Sponsor:

Acceptance Rates

CODASPY '14 Paper Acceptance Rate 19 of 119 submissions, 16%;
Overall Acceptance Rate 149 of 789 submissions, 19%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 24 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2015)On the Resource Consumption of Secure Data SharingProceedings of the 2015 IEEE Trustcom/BigDataSE/ISPA - Volume 0110.1109/Trustcom.2015.460(880-889)Online publication date: 20-Aug-2015

View Options

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