Zobrazit v EDS

Homomorphic Computation in Reed-Muller Codes and Improvements of Modified pqsigRM ; Reed-Muller 부호의 동형 연산과 Modified pqsigRM의 개선

Uloženo v:
Podrobná bibliografie
Název: Homomorphic Computation in Reed-Muller Codes and Improvements of Modified pqsigRM ; Reed-Muller 부호의 동형 연산과 Modified pqsigRM의 개선
Autoři: 조진규
Přispěvatelé: 노종선, CHO JINKYU, 공과대학 전기·정보공학부
Informace o vydavateli: 서울대학교 대학원
Rok vydání: 2023
Sbírka: Seoul National University: S-Space
Témata: "Fully homomorphic encryption (FHE)," "homomorphic computation," "post-quantum cryptography (PQC)," "error-correcting codes (ECCs)," "Reed-Muller (RM) codes," "digital signature scheme," "code-based cryptosystem.", 621.3
Popis: 학위논문(박사) -- 서울대학교대학원 : 공과대학 전기·정보공학부, 2023. 8. 노종선. ; In this dissertation, two main contributions are given as; i) homomorphic computation in Reed-Muller (RM) codes and ii) improving Modified pqsigRM with the key size and bit-security. First, a method of homomorphic computation in RM codes is proposed. With the ongoing developments in artificial intelligence (AI), big data, and cloud services, fully homomorphic encryption (FHE) is being considered as a solution for preserving privacy and security in machine learning systems. Currently, the most of existing FHE schemes are constructed using lattice-based cryptography. In state-of-the-art algorithms, a huge amount of computational resources are required for homomorphic multiplications and the corresponding bootstrapping that is necessary to refresh the ciphertext for a larger number of operations. Therefore, it is necessary to discover a new innovative approach for FHE that can reduce computational complexity for practical applications. Diverse research works, which are not limited to lattice-based cryptography are also needed. The code-based cryptography can be a new solution for this. In this dissertation, I propose a code-based homomorphic operation scheme in RM codes. It is known that the linear codes are closed under the addition, however, achieving multiplicative homomorphic operations with linear codes has been impossible until now. I strive to solve this problem by proposing a fully homomorphic code scheme that can support both addition and multiplication simultaneously using the RM codes. This can be considered as a preceding step for constructing code-based FHE schemes. I restrict this to the computation of the first order of RM codes. As the order of RM codes increases after multiplication, a bootstrapping technique is required to reduce the order of intermediate RM codes to accomplish a large number of operations. I propose a bootstrapping technique to preserve the order of RM codes after the addition or multiplication by proposing three consecutive ...
Druh dokumentu: doctoral or postdoctoral thesis
Popis souboru: ix, 80
Jazyk: Korean
ISBN: 978-0-00-000000-2
0-00-000000-0
Relation: 000000178587; https://hdl.handle.net/10371/196433; https://dcollection.snu.ac.kr/common/orgView/000000178587; 000000000050▲000000000058▲000000178587▲
Dostupnost: https://hdl.handle.net/10371/196433
https://dcollection.snu.ac.kr/common/orgView/000000178587
Přístupové číslo: edsbas.D4DF1FFD
Databáze: BASE
FullText Text:
  Availability: 0
CustomLinks:
  – Url: https://hdl.handle.net/10371/196433#
    Name: EDS - BASE (s4221598)
    Category: fullText
    Text: View record from BASE
  – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=%EC%A1%B0%EC%A7%84%EA%B7%9C
    Name: ISI
    Category: fullText
    Text: Nájsť tento článok vo Web of Science
    Icon: https://imagesrvr.epnet.com/ls/20docs.gif
    MouseOverText: Nájsť tento článok vo Web of Science
Header DbId: edsbas
DbLabel: BASE
An: edsbas.D4DF1FFD
RelevancyScore: 866
AccessLevel: 3
PubType: Dissertation/ Thesis
PubTypeId: dissertation
PreciseRelevancyScore: 865.653564453125
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Homomorphic Computation in Reed-Muller Codes and Improvements of Modified pqsigRM ; Reed-Muller 부호의 동형 연산과 Modified pqsigRM의 개선
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22조진규%22">조진규</searchLink>
– Name: Author
  Label: Contributors
  Group: Au
  Data: 노종선<br />CHO JINKYU<br />공과대학 전기·정보공학부
– Name: Publisher
  Label: Publisher Information
  Group: PubInfo
  Data: 서울대학교 대학원
– Name: DatePubCY
  Label: Publication Year
  Group: Date
  Data: 2023
– Name: Subset
  Label: Collection
  Group: HoldingsInfo
  Data: Seoul National University: S-Space
– Name: Subject
  Label: Subject Terms
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22"Fully+homomorphic+encryption+%28FHE%29%2C"+"homomorphic+computation%2C"+"post-quantum+cryptography+%28PQC%29%2C"+"error-correcting+codes+%28ECCs%29%2C"+"Reed-Muller+%28RM%29+codes%2C"+"digital+signature+scheme%2C"+"code-based+cryptosystem%2E"%22">"Fully homomorphic encryption (FHE)," "homomorphic computation," "post-quantum cryptography (PQC)," "error-correcting codes (ECCs)," "Reed-Muller (RM) codes," "digital signature scheme," "code-based cryptosystem."</searchLink><br /><searchLink fieldCode="DE" term="%22621%2E3%22">621.3</searchLink>
– Name: Abstract
  Label: Description
  Group: Ab
  Data: 학위논문(박사) -- 서울대학교대학원 : 공과대학 전기·정보공학부, 2023. 8. 노종선. ; In this dissertation, two main contributions are given as; i) homomorphic computation in Reed-Muller (RM) codes and ii) improving Modified pqsigRM with the key size and bit-security. First, a method of homomorphic computation in RM codes is proposed. With the ongoing developments in artificial intelligence (AI), big data, and cloud services, fully homomorphic encryption (FHE) is being considered as a solution for preserving privacy and security in machine learning systems. Currently, the most of existing FHE schemes are constructed using lattice-based cryptography. In state-of-the-art algorithms, a huge amount of computational resources are required for homomorphic multiplications and the corresponding bootstrapping that is necessary to refresh the ciphertext for a larger number of operations. Therefore, it is necessary to discover a new innovative approach for FHE that can reduce computational complexity for practical applications. Diverse research works, which are not limited to lattice-based cryptography are also needed. The code-based cryptography can be a new solution for this. In this dissertation, I propose a code-based homomorphic operation scheme in RM codes. It is known that the linear codes are closed under the addition, however, achieving multiplicative homomorphic operations with linear codes has been impossible until now. I strive to solve this problem by proposing a fully homomorphic code scheme that can support both addition and multiplication simultaneously using the RM codes. This can be considered as a preceding step for constructing code-based FHE schemes. I restrict this to the computation of the first order of RM codes. As the order of RM codes increases after multiplication, a bootstrapping technique is required to reduce the order of intermediate RM codes to accomplish a large number of operations. I propose a bootstrapping technique to preserve the order of RM codes after the addition or multiplication by proposing three consecutive ...
– Name: TypeDocument
  Label: Document Type
  Group: TypDoc
  Data: doctoral or postdoctoral thesis
– Name: Format
  Label: File Description
  Group: SrcInfo
  Data: ix, 80
– Name: Language
  Label: Language
  Group: Lang
  Data: Korean
– Name: ISBN
  Label: ISBN
  Group: ISBN
  Data: 978-0-00-000000-2<br />0-00-000000-0
– Name: NoteTitleSource
  Label: Relation
  Group: SrcInfo
  Data: 000000178587; https://hdl.handle.net/10371/196433; https://dcollection.snu.ac.kr/common/orgView/000000178587; 000000000050▲000000000058▲000000178587▲
– Name: URL
  Label: Availability
  Group: URL
  Data: https://hdl.handle.net/10371/196433<br />https://dcollection.snu.ac.kr/common/orgView/000000178587
– Name: AN
  Label: Accession Number
  Group: ID
  Data: edsbas.D4DF1FFD
PLink https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsbas&AN=edsbas.D4DF1FFD
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Text: Korean
    Subjects:
      – SubjectFull: "Fully homomorphic encryption (FHE)," "homomorphic computation," "post-quantum cryptography (PQC)," "error-correcting codes (ECCs)," "Reed-Muller (RM) codes," "digital signature scheme," "code-based cryptosystem."
        Type: general
      – SubjectFull: 621.3
        Type: general
    Titles:
      – TitleFull: Homomorphic Computation in Reed-Muller Codes and Improvements of Modified pqsigRM ; Reed-Muller 부호의 동형 연산과 Modified pqsigRM의 개선
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: 조진규
      – PersonEntity:
          Name:
            NameFull: 노종선
      – PersonEntity:
          Name:
            NameFull: CHO JINKYU
      – PersonEntity:
          Name:
            NameFull: 공과대학 전기·정보공학부
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 01
              Type: published
              Y: 2023
          Identifiers:
            – Type: isbn-print
              Value: 9780000000002
            – Type: isbn-print
              Value: 0000000000
            – Type: issn-locals
              Value: edsbas
            – Type: issn-locals
              Value: edsbas.oa
ResultId 1