Randomized Response Mechanisms in RRT Measurements for HTTP/3
draft-andersdotter-rrm-for-rrt-in-http3-00

Document Type Active Internet-Draft (individual)
Last updated 2019-11-03
Stream (None)
Intended RFC status (None)
Formats plain text xml pdf htmlized bibtex
Stream Stream state (No stream defined)
Consensus Boilerplate Unknown
RFC Editor Note (None)
IESG IESG state I-D Exists
Telechat date
Responsible AD (None)
Send notices to (None)
Internet Research Task Force                             A. Andersdotter
Internet-Draft                                                ARTICLE 19
Intended status: Informational                                  S. Sahib
Expires: May 6, 2020                                          Salesforce
                                                        November 3, 2019

     Randomized Response Mechanisms in RRT Measurements for HTTP/3
               draft-andersdotter-rrm-for-rrt-in-http3-00

Abstract

   The latency spin bit is an optional feature included in the QUIC
   transport protocol [I-D-QUIC].  It enables passive, on-path
   observations for estimation of latency.  This document presents the
   results of an inquiry into the potential of using randomized response
   mechanisms (RRM) to reduce privacy loss in latency measurements.  It
   concludes that RRM could be used to introduce choice for clients in
   preserving privacy in latency measurements.  But the trade-offs,
   especially since the latency spin bit is already optional, do not
   favour RRM.

Status of This Memo

   This Internet-Draft is submitted in full conformance with the
   provisions of BCP 78 and BCP 79.

   Internet-Drafts are working documents of the Internet Engineering
   Task Force (IETF).  Note that other groups may also distribute
   working documents as Internet-Drafts.  The list of current Internet-
   Drafts is at https://datatracker.ietf.org/drafts/current/.

   Internet-Drafts are draft documents valid for a maximum of six months
   and may be updated, replaced, or obsoleted by other documents at any
   time.  It is inappropriate to use Internet-Drafts as reference
   material or to cite them other than as "work in progress."

   This Internet-Draft will expire on May 6, 2020.

Copyright Notice

   Copyright (c) 2019 IETF Trust and the persons identified as the
   document authors.  All rights reserved.

   This document is subject to BCP 78 and the IETF Trust's Legal
   Provisions Relating to IETF Documents
   (https://trustee.ietf.org/license-info) in effect on the date of
   publication of this document.  Please review these documents

Andersdotter & Sahib       Expires May 6, 2020                  [Page 1]
Internet-Draft            rrm-for-rrt-in-http3             November 2019

   carefully, as they describe your rights and restrictions with respect
   to this document.  Code Components extracted from this document must
   include Simplified BSD License text as described in Section 4.e of
   the Trust Legal Provisions and are provided without warranty as
   described in the Simplified BSD License.

Table of Contents

   1.  Introduction  . . . . . . . . . . . . . . . . . . . . . . . .   2
   2.  Randomized Response Mechanisms  . . . . . . . . . . . . . . .   2
   3.  Application to latency spin bit . . . . . . . . . . . . . . .   3
     3.1.  RRM at edge transition  . . . . . . . . . . . . . . . . .   6
       3.1.1.  No reset and no edge identifying bit  . . . . . . . .   7
       3.1.2.  Reset and no edge identifying bit . . . . . . . . . .   8
       3.1.3.  An edge identifying bit . . . . . . . . . . . . . . .   9
       3.1.4.  Discussion  . . . . . . . . . . . . . . . . . . . . .  10
     3.2.  RRM at each bit . . . . . . . . . . . . . . . . . . . . .  10
       3.2.1.  Client perturbation . . . . . . . . . . . . . . . . .  11
       3.2.2.  Client and server perturbation  . . . . . . . . . . .  12
       3.2.3.  Discussion  . . . . . . . . . . . . . . . . . . . . .  12
   4.  Simulation  . . . . . . . . . . . . . . . . . . . . . . . . .  13
   5.  Conclusion  . . . . . . . . . . . . . . . . . . . . . . . . .  13
   6.  Informative References  . . . . . . . . . . . . . . . . . . .  14
   Authors' Addresses  . . . . . . . . . . . . . . . . . . . . . . .  15

1.  Introduction

   At the IETF104 convening of the Privacy Enhancements and Assessments
   Research Group (PEARG), a presentation on Differential Privacy
   ([AA-CL]) gave rise to the idea of trying to apply Randomized
   Response methods to the QUIC Spin Bit described in [TRAMMEL] and
   [KUEHLEWIND].  Now incorporated in Section 17.3.1 [I-D-QUIC], the
   latency spin bit has generated controversy from a privacy
   perspective, both in the Working Group meetings and on e-mailing
   lists.  Controversies were re-ignited through the publication of a
   Human Rights Consideration in [TENOEVER-MARTINI].  Applying RRM is an
   attempt to address two problems: the privacy loss incurred through
   the spin bit, and considering the potential of using RRM to have more
   than one bit assisting in latency measurement as per previous
   proposals.

2.  Randomized Response Mechanisms

   Randomized Response Mechanisms (RRM) rely on the ability to make
   sense of data with known errors and were originally developed to
   facilitate surveys on sensitive topics such as alcohol or drug abuse
   or political affiliation.  The design allows a survey taker to
   provide, with some known probability P, a "false" answer ("yes"
Show full document text