Literature Database Entry

erlacher2016tls

Felix Erlacher, Simon Woertz and Falko Dressler, "A TLS Interception Proxy with Real-Time Libpcap Export," Proceedings of 41st IEEE Conference on Local Computer Networks (LCN 2016), Demo Session, Dubai, United Arab Emirates, November 2016.

Abstract

The usage of HTTPS and thereby the Transport Layer Security (TLS) protocol is constantly becoming more ubiquitous. This renders classic Deep Packet Inspection (DPI) approaches on the, now encrypted, application layer useless. The concept of TLS interception proxies is to decrypt the application layer data going through the proxy and to make it available for further processing. The decrypted data varies in form and content depending on the used proxy application. Most currently available tools store this data in plain text format consisting of the decrypted application layer data together with additional metadata describing the connection. This is useful if single connections have to be analyzed but generally fails for network monitoring tools such as Intrusion Detection System (IDS) due to missing lower layer network connection information. We developed a TLS interception proxy that exports in real-time not only the decrypted TLS application data records but also lower layer information using the well known libpcap format. This enables other network monitoring tools to further process the exported data and apply DPI techniques as well as detection rules that inspect the lower layers.

Quick access

Authors' Version PDF (PDF on this web site)
BibTeX BibTeX

Contact

Felix Erlacher
Simon Woertz
Falko Dressler

BibTeX reference

@inproceedings{erlacher2016tls,
    author = {Erlacher, Felix and Woertz, Simon and Dressler, Falko},
    title = {{A TLS Interception Proxy with Real-Time Libpcap Export}},
    publisher = {IEEE},
    address = {Dubai, United Arab Emirates},
    booktitle = {41st IEEE Conference on Local Computer Networks (LCN 2016), Demo Session},
    month = {11},
    year = {2016},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. 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 components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.

Last modified: 2024-04-19