<?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-22T01:19:13Z</responseDate>
  <request identifier="oai:www.ideals.illinois.edu:2142/80781" metadataPrefix="etdms" verb="GetRecord">https://www.ideals.illinois.edu/oai-pmh</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:www.ideals.illinois.edu:2142/80781</identifier>
        <datestamp>2023-07-11</datestamp>
        <setSpec>col_2142_5131</setSpec>
        <setSpec>col_2142_8888</setSpec>
        <setSpec>com_2142_5130</setSpec>
        <setSpec>com_2142_8887</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>Moulin, Pierre</dc:contributor>
          <dc:contributor>Ramchandran, Kannan</dc:contributor>
          <dc:creator>Mihcak, Mehmet Kivanc</dc:creator>
          <dc:date>2015-09-25T20:08:08Z</dc:date>
          <dc:date>2015-09-25T20:08:08Z</dc:date>
          <dc:date>10000-01-01</dc:date>
          <dc:date>2002</dc:date>
          <dc:date>2002</dc:date>
          <dc:description>Finally, we present a new approach to the watermarking problem that is based on traditional cryptographic arguments. Here, the attacker is assumed to have enough information about the algorithmic steps of information hiding schemes (except for the secret key). Within this scenario he has access to the decoder; his goal is to break the scheme with a finite number of trials by reliably finding or estimating the secret. We propose an image watermarking approach that is designed as a first step for such a situation. We also present a video watermarking technique that combines the proposed image hashing and watermarking techniques.</dc:description>
          <dc:description>Made available in DSpace on 2015-09-25T20:08:08Z (GMT). No. of bitstreams: 2
license.txt: 4848 bytes, checksum: 96035ab3f5e1c23cc7138a224ce498bd (MD5)
3070031.pdf: 7711230 bytes, checksum: 7af6dd8fce59f6bc0b21fb34f214f367 (MD5)
  Previous issue date: 2002</dc:description>
          <dc:description>Embargo set by: Seth Robbins for item 82063
Lift date: Forever
Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs</dc:description>
          <dc:description>U of I Only</dc:description>
          <dc:description>176 p.</dc:description>
          <dc:description>Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2002.</dc:description>
          <dc:identifier>http://hdl.handle.net/2142/80781</dc:identifier>
          <dc:identifier>(MiAaPQ)AAI3070031</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:subject>Engineering, Electronics and Electrical</dc:subject>
          <dc:title>Information Hiding Codes and Their Applications to Images and Audio</dc:title>
          <dc:type>text</dc:type>
          <degree>
            <department>Electrical Engineering</department>
            <discipline>Electrical Engineering</discipline>
            <grantor>University of Illinois at Urbana-Champaign</grantor>
            <level>Dissertation</level>
            <name>Ph.D.</name>
          </degree>
        </thesis>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
