loading
Papers

Research.Publish.Connect.

Paper

Authors: Takahiro Matsuda 1 ; Kenta Takahashi 2 and Goichiro Hanaoka 1

Affiliations: 1 National Institute of Advanced Industrial Science and Technology (AIST), Tokyo and Japan ; 2 Hitachi Ltd., Yokohama and Japan

ISBN: 978-989-758-319-3

Keyword(s): Fuzzy Signature, Linear Sketch, Recovering Attacks.

Related Ontology Subjects/Areas/Topics: Applied Cryptography ; Biometrics Security and Privacy ; Cryptographic Techniques and Key Management ; Data Engineering ; Databases and Data Security ; Information and Systems Security

Abstract: Recently, the notion of fuzzy signature was introduced by Takahashi et al. (ACNS 2015, ACNS 2016, ePrint 2017). It is a signature scheme in which signatures can be generated using “fuzzy data” (i.e. noisy data such as biometric features) as a signing key, without using any additional user-specific data (such as a helper string in the context of fuzzy extractors). One of the main building blocks in the existing fuzzy signature schemes, is a primitive called linear sketch, which can be interpreted as a certain form of (one-way) encoding with which fuzzy data is encoded, and is used in combination with an ordinary signature scheme with certain functional and security properties, to construct a fuzzy signature scheme. Although the security of the underlying linear sketch scheme is very important for the security of the constructed fuzzy signature schemes, a linear sketch scheme is a relatively new primitive, and what security properties its definition and the existing constructions satisf y, has not been understood well. In order to deepen our understanding of this primitive, in this paper we clarify the security properties achieved by the existing linear sketch schemes. More specifically, we formalize security of a linear sketch scheme against “recovering” attacks, and then clarify that the existing linear sketch schemes achieve sufficiently strong security against them. (More)

PDF ImageFull Text

Download
CC BY-NC-ND 4.0

Sign In Guest: Register as new SciTePress user now for free.

Sign In SciTePress user: please login.

PDF ImageMy Papers

You are not signed in, therefore limits apply to your IP address 3.231.226.211

In the current month:
Recent papers: 100 available of 100 total
2+ years older papers: 200 available of 200 total

Paper citation in several formats:
Matsuda, T.; Takahashi, K. and Hanaoka, G. (2018). On the Security of Linear Sketch Schemes against Recovering Attacks.In Proceedings of the 15th International Joint Conference on e-Business and Telecommunications - Volume 2 SECRYPT: SECRYPT, ISBN 978-989-758-319-3, pages 76-87. DOI: 10.5220/0006847102420253

@conference{secrypt18,
author={Takahiro Matsuda. and Kenta Takahashi. and Goichiro Hanaoka.},
title={On the Security of Linear Sketch Schemes against Recovering Attacks},
booktitle={Proceedings of the 15th International Joint Conference on e-Business and Telecommunications - Volume 2 SECRYPT: SECRYPT,},
year={2018},
pages={76-87},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0006847102420253},
isbn={978-989-758-319-3},
}

TY - CONF

JO - Proceedings of the 15th International Joint Conference on e-Business and Telecommunications - Volume 2 SECRYPT: SECRYPT,
TI - On the Security of Linear Sketch Schemes against Recovering Attacks
SN - 978-989-758-319-3
AU - Matsuda, T.
AU - Takahashi, K.
AU - Hanaoka, G.
PY - 2018
SP - 76
EP - 87
DO - 10.5220/0006847102420253

Login or register to post comments.

Comments on this Paper: Be the first to review this paper.