<?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-03-14T14:56:44Z</responseDate>
  <request metadataPrefix="jpcoar_1.0" verb="GetRecord" identifier="oai:ipsj.ixsq.nii.ac.jp:00241007">https://ipsj.ixsq.nii.ac.jp/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:ipsj.ixsq.nii.ac.jp:00241007</identifier>
        <datestamp>2025-03-06T06:12:41Z</datestamp>
        <setSpec>6164:6165:6462:11854</setSpec>
      </header>
      <metadata>
        <jpcoar:jpcoar xmlns:datacite="https://schema.datacite.org/meta/kernel-4/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:dcndl="http://ndl.go.jp/dcndl/terms/" xmlns:dcterms="http://purl.org/dc/terms/" xmlns:jpcoar="https://github.com/JPCOAR/schema/blob/master/1.0/" xmlns:oaire="http://namespace.openaire.eu/schema/oaire/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:rioxxterms="http://www.rioxx.net/schema/v2.0/rioxxterms/" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns="https://github.com/JPCOAR/schema/blob/master/1.0/" xsi:schemaLocation="https://github.com/JPCOAR/schema/blob/master/1.0/jpcoar_scm.xsd">
          <dc:title xml:lang="ja">RS符号語のブロック分割による(K,N)秘密分散 を用いたQRコードと互換性のある2領域2次元シンボル</dc:title>
          <dc:title xml:lang="en">A two region 2D symbol  compatible with QR code using (K,N) secret sharing  by block division of RS codewords</dc:title>
          <jpcoar:creator>
            <jpcoar:creatorName>寺浦, 信之</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName>越前, 功</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName>岩村, 恵市</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Nobuyuki, Teraura</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Isao, Echizen</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:creator>
            <jpcoar:creatorName xml:lang="en">Keiichi, Iwamura</jpcoar:creatorName>
          </jpcoar:creator>
          <jpcoar:subject subjectScheme="Other">QR シンボル，秘密分散，RS 符号，領域分割, 互換性, 2 領域2 次元シンボル</jpcoar:subject>
          <datacite:description descriptionType="Other">QRコードは，データを伝達するデータキャリアやスマホでWEB参照を行う場合のWEBアドレスの入力手段として活用されている．しかし，QRコードでは，誤り訂正の機能を有しているがセキュリティ性が脆弱であり，誰でもがQRコードのデータを読取ることが可能である．秘匿データを受渡しする手法としては，暗号化と秘密分散が考えられる．ここでは，RS符号を用いた秘密分散を検討した．RS符号では，データを記憶するデータ部コード語と訂正部コード語から構成される．一部でもデータ部コード語を含む情報を分割してシェアすると，復号不可のシェアからデータの一部が判明する可能性がある．そこで，訂正部コード語を分割してシェアする．そして，訂正部コード語を対象データとするRS符号の第２の訂正部コード語を作成し，データ部とともに分割してシェアする．このとき，第２の訂正部コード語の語数を特定の語数とすることにより（K,N)秘密分散が成立する．このシェアを2領域２次元シンボルに記憶することで互換性を維持する秘密分散を検討した．</datacite:description>
          <datacite:description descriptionType="Other">QR codes are used as data carriers that transmit data and as a means of inputting web addresses when browsing the web on a smartphone. However, although QR codes have an error correction function, their security is weak, and anyone can read the data in the QR code. Methods for transferring secret data include encryption and secret sharing. Here, we considered secret sharing using RS codes. RS codes consist of a data section codeword that stores data and a correction section codeword. If information containing even a part of the data section codeword is divided and shared, there is a possibility that part of the data will be revealed from the undecryptable share. Therefore, the correction section codeword is divided and shared. Then, a second correction section codeword of the RS code with the correction section codeword as the target data is created, and it is divided and shared together with the data section. At this time, (K,N) secret sharing is established by setting the number of words of the second correction section codeword to a specific number of words. We considered secret sharing that maintains compatibility by storing this share in a two-region 2d symbol.</datacite:description>
          <dc:publisher xml:lang="ja">情報処理学会</dc:publisher>
          <datacite:date dateType="Issued">2024-10-15</datacite:date>
          <dc:language>jpn</dc:language>
          <dc:type rdf:resource="http://purl.org/coar/resource_type/c_5794">conference paper</dc:type>
          <jpcoar:identifier identifierType="URI">https://ipsj.ixsq.nii.ac.jp/records/241007</jpcoar:identifier>
          <jpcoar:sourceTitle>コンピュータセキュリティシンポジウム2024論文集</jpcoar:sourceTitle>
          <jpcoar:pageStart>1950</jpcoar:pageStart>
          <jpcoar:pageEnd>1957</jpcoar:pageEnd>
          <jpcoar:file>
            <jpcoar:URI label="IPSJ-CSS2024261.pdf">https://ipsj.ixsq.nii.ac.jp/record/241007/files/IPSJ-CSS2024261.pdf</jpcoar:URI>
            <jpcoar:mimeType>application/pdf</jpcoar:mimeType>
            <jpcoar:extent>1.3 MB</jpcoar:extent>
            <datacite:date dateType="Available">2026-10-15</datacite:date>
          </jpcoar:file>
        </jpcoar:jpcoar>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
