<?xml version="1.0" encoding="UTF-8"?>
<mods xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.loc.gov/mods/v3" version="3.1" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
  <titleInfo>
    <title>Neural Network Training With Homomorphic Encryption</title>
  </titleInfo>
  <name type="personal">
    <namePart>Kentaro Mihara</namePart>
    <role>
      <roleTerm authority="marcrelator" type="text">creator</roleTerm>
    </role>
  </name>
  <typeOfResource>text</typeOfResource>
  <originInfo>
    <place>
      <placeTerm type="code" authority="marccountry">xx</placeTerm>
    </place>
    <dateIssued encoding="marc">2020</dateIssued>
    <issuance>monographic</issuance>
  </originInfo>
  <language>
    <languageTerm authority="iso639-2b" type="code">ng </languageTerm>
  </language>
  <physicalDescription>
    <form authority="marcform">print</form>
  </physicalDescription>
  <abstract>We introduce a novel method and implementation architecture to train neural networks which preserves the confidentiality of both the model and the data. Our method relies on homomorphic capability of lattice based encryption scheme. Our procedure is optimized for operations on packed ciphertexts in order to achieve efficient updates of the model parameters. Our method achieves a significant reduction of computations due to our way to perform multiplications and rotations on packed ciphertexts from a feedforward network to a back-propagation network. To verify the accuracy of the training model as well as the implementation feasibility, we tested our method on the Iris data set by using the CKKS scheme with Microsoft SEAL as a back end. Although our test implementation is for simple neural network training, we believe our basic implementation block can help the further applications for mo</abstract>
  <note>Open access — freely available to read.</note>
  <identifier type="uri">https://arxiv.org/pdf/2012.13552v1</identifier>
  <location>
    <url displayLabel="Read the full paper (PDF)">https://arxiv.org/pdf/2012.13552v1</url>
  </location>
  <accessCondition type="restrictionOnAccess">Open access — freely available to read.</accessCondition>
  <recordInfo>
    <recordCreationDate encoding="marc">250101</recordCreationDate>
    <recordChangeDate encoding="iso8601">20260901030331.0</recordChangeDate>
  </recordInfo>
</mods>
