有限域同构问题的一个签名方案

IF 0.5 Q4 COMPUTER SCIENCE, THEORY & METHODS

Journal of Mathematical Cryptology Pub Date : 2020-01-01 DOI:10.1515/jmc-2015-0050

J. Hoffstein, J. Silverman, William Whyte, Zhenfei Zhang

{"title":"有限域同构问题的一个签名方案","authors":"J. Hoffstein, J. Silverman, William Whyte, Zhenfei Zhang","doi":"10.1515/jmc-2015-0050","DOIUrl":null,"url":null,"abstract":"Abstract In a recent paper the authors and their collaborators proposed a new hard problem, called the finite field isomorphism problem, and they used it to construct a fully homomorphic encryption scheme. In this paper, we investigate how one might build a digital signature scheme from this new problem. Intuitively, the hidden field isomorphism allows us to convert short vectors in the underlying lattice of one field into generic looking vectors in an isomorphic field.","PeriodicalId":43866,"journal":{"name":"Journal of Mathematical Cryptology","volume":"14 1","pages":"39 - 54"},"PeriodicalIF":0.5000,"publicationDate":"2020-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1515/jmc-2015-0050","citationCount":"2","resultStr":"{\"title\":\"A signature scheme from the finite field isomorphism problem\",\"authors\":\"J. Hoffstein, J. Silverman, William Whyte, Zhenfei Zhang\",\"doi\":\"10.1515/jmc-2015-0050\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract In a recent paper the authors and their collaborators proposed a new hard problem, called the finite field isomorphism problem, and they used it to construct a fully homomorphic encryption scheme. In this paper, we investigate how one might build a digital signature scheme from this new problem. Intuitively, the hidden field isomorphism allows us to convert short vectors in the underlying lattice of one field into generic looking vectors in an isomorphic field.\",\"PeriodicalId\":43866,\"journal\":{\"name\":\"Journal of Mathematical Cryptology\",\"volume\":\"14 1\",\"pages\":\"39 - 54\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2020-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1515/jmc-2015-0050\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Mathematical Cryptology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1515/jmc-2015-0050\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Mathematical Cryptology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1515/jmc-2015-0050","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 2

摘要

摘要在最近的一篇论文中，作者和他们的合作者提出了一个新的难题，称为有限域同构问题，并用它构造了一个全同态加密方案。在本文中，我们研究了如何从这个新问题中构建数字签名方案。直观地说，隐域同构允许我们将一个域的底层格中的短向量转换为同构域中的泛型向量。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A signature scheme from the finite field isomorphism problem

Abstract In a recent paper the authors and their collaborators proposed a new hard problem, called the finite field isomorphism problem, and they used it to construct a fully homomorphic encryption scheme. In this paper, we investigate how one might build a digital signature scheme from this new problem. Intuitively, the hidden field isomorphism allows us to convert short vectors in the underlying lattice of one field into generic looking vectors in an isomorphic field.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Journal of Mathematical Cryptology COMPUTER SCIENCE, THEORY & METHODS-

CiteScore

2.70

自引率

8.30%

发文量

审稿时长

100 weeks