서브메뉴
검색
In-Network Assistance for Secure Transport Protocols
In-Network Assistance for Secure Transport Protocols
상세정보
- 자료유형
- 학위논문 서양
- 최종처리일시
- 20260202104849
- ISBN
- 9798288815072
- DDC
- 620
- 저자명
- Yuan, Gina.
- 서명/저자
- In-Network Assistance for Secure Transport Protocols
- 발행사항
- [Sl] : Stanford University, 2025
- 발행사항
- Ann Arbor : ProQuest Dissertations & Theses, 2025
- 형태사항
- 127 p
- 주기사항
- Source: Dissertations Abstracts International, Volume: 87-02, Section: B.
- 주기사항
- Advisor: Mazières, David;Winstein, Keith.
- 학위논문주기
- Thesis (Ph.D.)--Stanford University, 2025.
- 초록/해제
- 요약Post-TCP transport protocols such as QUIC now include end-to-end encryption at the transport layer. This enhances security by making their packets opaque to connection-splitting proxies and immune to ossification, but can harm performance. In this dissertation, I will present the Sidekick protocol approach to in-network assistance for secure transport protocols, where proxies and endpoints send information on an adjacent connection about which encrypted packets they have received. Sidekick protocols apply set reconciliation techniques in a novel setting to efficiently refer to encrypted packets in a quACK, without using plaintext sequence numbers. In some use cases of the Sidekick protocol, Packrat proxies keep a small cache of packets for possible in-network retransmissions of encrypted packets. This approach allows secure transport protocols to achieve performance benefits similar to those of traditional PEPs, but leaves the protocol unchanged on the wire and free to evolve. Finally, I will present the split throughput heuristic for reasoning about connection-splitting in the context of two recent developments: the BBR congestion control algorithm and the QUIC transport protocol. I use this heuristic in an emulation measurement study and discuss how connection-splitting, despite the ossification it can induce, still offers valuable performance benefits today.
- 일반주제명
- Wireless networks
- 일반주제명
- Software
- 일반주제명
- Control algorithms
- 일반주제명
- Streaming media
- 일반주제명
- Internet access
- 일반주제명
- Protocol
- 일반주제명
- Satellites
- 일반주제명
- Wireless access points
- 일반주제명
- Computer engineering
- 일반주제명
- Electrical engineering
- 기타저자
- Stanford University.
- 기본자료저록
- Dissertations Abstracts International. 87-02B.
- 전자적 위치 및 접속
- 로그인 후 원문을 볼 수 있습니다.
MARC
008260126s2025 us c eng d■001000017359205
■00520260202104849
■006m o d
■007cr#unu||||||||
■020 ▼a9798288815072
■035 ▼a(MiAaPQ)AAI32200939
■035 ▼a(MiAaPQ)Stanforddv280ht6313
■040 ▼aMiAaPQ▼cMiAaPQ
■0820 ▼a620
■1001 ▼aYuan, Gina.
■24510▼aIn-Network Assistance for Secure Transport Protocols
■260 ▼a[Sl]▼bStanford University▼c2025
■260 1▼aAnn Arbor▼bProQuest Dissertations & Theses▼c2025
■300 ▼a127 p
■500 ▼aSource: Dissertations Abstracts International, Volume: 87-02, Section: B.
■500 ▼aAdvisor: Mazières, David;Winstein, Keith.
■5021 ▼aThesis (Ph.D.)--Stanford University, 2025.
■520 ▼aPost-TCP transport protocols such as QUIC now include end-to-end encryption at the transport layer. This enhances security by making their packets opaque to connection-splitting proxies and immune to ossification, but can harm performance. In this dissertation, I will present the Sidekick protocol approach to in-network assistance for secure transport protocols, where proxies and endpoints send information on an adjacent connection about which encrypted packets they have received. Sidekick protocols apply set reconciliation techniques in a novel setting to efficiently refer to encrypted packets in a quACK, without using plaintext sequence numbers. In some use cases of the Sidekick protocol, Packrat proxies keep a small cache of packets for possible in-network retransmissions of encrypted packets. This approach allows secure transport protocols to achieve performance benefits similar to those of traditional PEPs, but leaves the protocol unchanged on the wire and free to evolve. Finally, I will present the split throughput heuristic for reasoning about connection-splitting in the context of two recent developments: the BBR congestion control algorithm and the QUIC transport protocol. I use this heuristic in an emulation measurement study and discuss how connection-splitting, despite the ossification it can induce, still offers valuable performance benefits today.
■590 ▼aSchool code: 0212.
■650 4▼aWireless networks
■650 4▼aSoftware
■650 4▼aControl algorithms
■650 4▼aStreaming media
■650 4▼aInternet access
■650 4▼aProtocol
■650 4▼aSatellites
■650 4▼aWireless access points
■650 4▼aComputer engineering
■650 4▼aElectrical engineering
■653 ▼aTransport protocols
■653 ▼aQUIC transport protocol
■690 ▼a0544
■690 ▼a0464
■71020▼aStanford University.
■7730 ▼tDissertations Abstracts International▼g87-02B.
■790 ▼a0212
■791 ▼aPh.D.
■792 ▼a2025
■793 ▼aEnglish
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T17359205▼nKERIS▼z이 자료의 원문은 한국교육학술정보원에서 제공합니다.
