<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="/oai-pmh.xsl"?>
<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-09-24T08:31:53Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/115635" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/115635</identifier>
        <datestamp>2023-07-11</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_10761</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_10755</setSpec>
        <setSpec>com_2142_234</setSpec>
      </header>
      <metadata>
        <thesis xmlns="http://www.ndltd.org/standards/metadata/etdms/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dc="http://purl.org/dc/elements/1.1/" xsi:schemaLocation="http://www.ndltd.org/standards/metadata/etdms/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdms11.xsd http://purl.org/dc/elements/1.1/ http://www.ndltd.org/standards/metadata/etdms/1.1/etdmsdc.xsd">
          <dc:contributor>Khurana, Dakshita</dc:contributor>
          <dc:date>2022-05</dc:date>
          <dc:format>application/pdf</dc:format>
          <dc:language>en</dc:language>
          <dc:type>text</dc:type>
          <dc:description>Submission published under a 24 month embargo labeled 'U of I Access', the embargo will last until 2024-05-01</dc:description>
          <dc:description>The student, Nishant Kumar, accepted the attached license on 2022-05-31 at 09:57.</dc:description>
          <dc:description>The student, Nishant Kumar, submitted this Thesis for approval on 2022-05-31 at 11:05.</dc:description>
          <dc:description>This Thesis was approved for publication on 2022-06-01 at 15:36.</dc:description>
          <dc:description>DSpace SAF Submission Ingestion Package generated from Vireo submission #18048 on 2022-11-11 at 12:12:24</dc:description>
          <dc:title>Frameworks for efficient quantum oblivious transfer in the QROM</dc:title>
          <dc:creator>Kumar, Nishant</dc:creator>
          <dc:date>2022-06-01</dc:date>
          <dc:subject>cryptography</dc:subject>
          <dc:subject>quantum</dc:subject>
          <dc:subject>random oracles</dc:subject>
          <dc:subject>oblivious transfer</dc:subject>
          <dc:subject>entanglement</dc:subject>
          <dc:description>We propose new general frameworks for constructing round efficient and concretely efficient
quantum oblivious transfer (OT) in the quantum random oracle model (QROM). We obtain
the following unconditionally secure protocols in the QROM, satisfying simulation-based
security against malicious adversaries.
• Non-interactive (i.e., one-message) bit OT between two parties that initially share a
set of EPR pairs. This realizes an ideal functionality that obtains two chosen bits
(m0,m1) from a sender and outputs (b,mb) to a receiver, for uniformly random b.
• Two-message bit OT without setup, realizing the same functionality as above. This is
obtained by showing that the above protocol remains secure even if the receiver is the
one that sets up the entanglement.
• Three-message chosen-input string OT without entanglement or setup.
Our conceptual contribution is a new template for quantum OT, that we call the “fixed basis
framework”. In this framework, the correct choice of basis used by one player to polarize
qubits is largely fixed and public at the time of measurement, except for some hidden trap
qubits that are intentionally polarized in a conjugate basis. To analyze some of our protocols,
we develop new techniques that enable seedless extraction from quantum sources of entropy.
Finally, we also construct three-message random-input and four-message chosen-input
OT assuming non-interactive idealized (i.e. extractable and equivocal) bit commitments.
In fact, all our protocols use such commitments, for which we provide simple and efficient
constructions in the QROM. These may be of independent interest.</dc:description>
          <dc:type>Thesis</dc:type>
          <dc:language>eng</dc:language>
          <dc:identifier>https://hdl.handle.net/2142/115635</dc:identifier>
          <dc:rights>Copyright 2022 Nishant Kumar</dc:rights>
          <degree>
            <name>M.S.</name>
            <level>Thesis</level>
            <discipline>Computer Science</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <department>Computer Science</department>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
