<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-08-06T03:42:08Z</responseDate>
  <request identifier="23138" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:23138</identifier>
        <datestamp>2025-06-03T06:37:37Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Laplace Transform Interpretation of Differential Privacy</dc:title>
          <dc:creator>Chourasia, Rishav</dc:creator>
          <dc:creator>Javaid, Uzair</dc:creator>
          <dc:creator>Sikdar, Biplab</dc:creator>
          <dc:subject>Differential Privacy</dc:subject>
          <dc:subject>Composition Theorem</dc:subject>
          <dc:subject>Laplace Transform</dc:subject>
          <dc:description>We introduce a set of useful expressions of Differential Privacy (DP) notions in terms of Laplace transformations. The underlying bare-form expressions for these transforms appear in several works on analyzing DP, either as an integral or an expectation. We show that recognizing these expressions as Laplace transformations unlocks a new way to reason about DP properties by exploiting the duality between time and frequency domains. Leveraging our interpretation, we connect the (q, ρ(q))-Rényi DP curve and the (ε, δ(ε))-DP curve as being the Laplace and inverse-Laplace transforms of one another. Using our Laplace transform-based analysis, we also prove an adaptive composition theorem for (ε, δ)-DP guarantees that is exactly-tight (i.e., matches even in constants) for all values of ε. Additionally, we resolve an issue regarding symmetry of f-DP on subsampling that prevented equivalence across all functional DP notions.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Rishav Chourasia and Uzair Javaid and Biplab Sikdar</dc:contributor>
          <dc:date>2025</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 329, 6th Symposium on Foundations of Responsible Computing (FORC 2025)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.FORC.2025.11</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-231387</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FORC.2025.11</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
