Detailed Information
Cited time in 
Cited time in 
Cited time in
Metadata Downloads
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.citation.endPage | 475 | - |
| dc.citation.number | 3 | - |
| dc.citation.startPage | 461 | - |
| dc.citation.title | 정보보호학회논문지 | - |
| dc.citation.volume | 24 | - |
| dc.contributor.author | Joo, Chihong | - |
| dc.contributor.author | Yun, Aaram | - |
| dc.date.accessioned | 2023-12-22T02:38:11Z | - |
| dc.date.available | 2023-12-22T02:38:11Z | - |
| dc.date.created | 2014-09-29 | - |
| dc.date.issued | 2014-06 | - |
| dc.description.abstract | Homomorphic MAC is a cryptographic primitive which protects authenticity of data, while allowing homomorphic evaluation of such protected data. In this paper, we present a new homomorphic MAC, which is based on integers, relying only on the existence of secure PRFs, and having efficiency comparable to the practical Catalano-Fiore homomorphic MAC. Our scheme is unforgeable even when MAC verification queries are allowed to the adversary, and we achieve this by showing strong unforgeability of our scheme. | - |
| dc.identifier.bibliographicCitation | 정보보호학회논문지, v.24, no.3, pp.461 - 475 | - |
| dc.identifier.doi | 10.13089/JKIISC.2014.24.3.461 | - |
| dc.identifier.issn | 1598-3986 | - |
| dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/6695 | - |
| dc.language | 한국어 | - |
| dc.publisher | 한국정보보호학회 | - |
| dc.title.alternative | A Strongly Unforgeable Homomorphic MAC over Integers | - |
| dc.title | 강한 위조 불가능성을 갖는 정수 기반 준동형 메시지 인증 코드 | - |
| dc.type | Article | - |
| dc.description.isOpenAccess | FALSE | - |
| dc.identifier.kciid | ART001891620 | - |
| dc.description.journalRegisteredClass | kci | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.