Traceable policy-based signatures and instantiation from lattices
Policy-based signatures (PBS) were proposed by Bellare and Fuchsbauer (PKC 2014) to allow an authorized member of an organization to sign a message on behalf of the organization. The user's authorization is determined by a policy managed by the organization's trusted authority, while the s...
Saved in:
Main Authors: | , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2022
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/163892 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-163892 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1638922022-12-21T05:38:07Z Traceable policy-based signatures and instantiation from lattices Xu, Yanhong Safavi-Naini, Reihaneh Nguyen, Khoa Wang, Huaxiong School of Physical and Mathematical Sciences Science::Mathematics Policy-Based Signatures Privacy Policy-based signatures (PBS) were proposed by Bellare and Fuchsbauer (PKC 2014) to allow an authorized member of an organization to sign a message on behalf of the organization. The user's authorization is determined by a policy managed by the organization's trusted authority, while the signature preserves the privacy of the organization's policy. Signing keys in PBS do not include user identity information and thus can be passed to others, violating the intention of employing PBS to restrict users’ signing capability. In this work, we introduce the notion of traceability for PBS by including user identity in the signing key such that the trusted authority will be able to open a suspicious signature and recover the signer's identity should the needs arise. We provide rigorous definitions and stringent security notions of traceable PBS (TPBS), capturing the properties of PBS suggested by Bellare-Fuchsbauer and resembling the “full traceability” requirement for group signatures put forward by Bellare-Micciancio-Warinschi (Eurocrypt 2003). As a proof of concept, we provide a modular construction of TPBS, based on a signature scheme, an encryption scheme and a zero-knowledge proof system. Furthermore, to demonstrate the feasibility of achieving TPBS from concrete, quantum-resistant assumptions, we give an instantiation based on lattices. Ministry of Education (MOE) Nanyang Technological University National Research Foundation (NRF) The works of Yanhong Xu and Reihaneh Safavi-Naini were supported in part by Alberta Innovates Strategic Chair in Information Security Grant and Natural Sciences and Engineering Research Council of Canada Discovery Grant. Khoa Nguyen was supported by the NTU – Presidential Postdoctoral Fellowship 2018. Huaxiong Wang was supported by the National Research Foundation, Prime Minister’s Office, Singapore under its Strategic Capability Research Centres Funding Initiative and Singapore Ministry of Education under Research Grant MOE2019-T2-2–083 and RG12/19. 2022-12-21T05:38:07Z 2022-12-21T05:38:07Z 2022 Journal Article Xu, Y., Safavi-Naini, R., Nguyen, K. & Wang, H. (2022). Traceable policy-based signatures and instantiation from lattices. Information Sciences, 607, 1286-1310. https://dx.doi.org/10.1016/j.ins.2022.06.031 0020-0255 https://hdl.handle.net/10356/163892 10.1016/j.ins.2022.06.031 2-s2.0-85133775184 607 1286 1310 en MOE2019-T2-2–083 RG12/19 Information Sciences © 2022 Elsevier Inc. All rights reserved. |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
Science::Mathematics Policy-Based Signatures Privacy |
spellingShingle |
Science::Mathematics Policy-Based Signatures Privacy Xu, Yanhong Safavi-Naini, Reihaneh Nguyen, Khoa Wang, Huaxiong Traceable policy-based signatures and instantiation from lattices |
description |
Policy-based signatures (PBS) were proposed by Bellare and Fuchsbauer (PKC 2014) to allow an authorized member of an organization to sign a message on behalf of the organization. The user's authorization is determined by a policy managed by the organization's trusted authority, while the signature preserves the privacy of the organization's policy. Signing keys in PBS do not include user identity information and thus can be passed to others, violating the intention of employing PBS to restrict users’ signing capability. In this work, we introduce the notion of traceability for PBS by including user identity in the signing key such that the trusted authority will be able to open a suspicious signature and recover the signer's identity should the needs arise. We provide rigorous definitions and stringent security notions of traceable PBS (TPBS), capturing the properties of PBS suggested by Bellare-Fuchsbauer and resembling the “full traceability” requirement for group signatures put forward by Bellare-Micciancio-Warinschi (Eurocrypt 2003). As a proof of concept, we provide a modular construction of TPBS, based on a signature scheme, an encryption scheme and a zero-knowledge proof system. Furthermore, to demonstrate the feasibility of achieving TPBS from concrete, quantum-resistant assumptions, we give an instantiation based on lattices. |
author2 |
School of Physical and Mathematical Sciences |
author_facet |
School of Physical and Mathematical Sciences Xu, Yanhong Safavi-Naini, Reihaneh Nguyen, Khoa Wang, Huaxiong |
format |
Article |
author |
Xu, Yanhong Safavi-Naini, Reihaneh Nguyen, Khoa Wang, Huaxiong |
author_sort |
Xu, Yanhong |
title |
Traceable policy-based signatures and instantiation from lattices |
title_short |
Traceable policy-based signatures and instantiation from lattices |
title_full |
Traceable policy-based signatures and instantiation from lattices |
title_fullStr |
Traceable policy-based signatures and instantiation from lattices |
title_full_unstemmed |
Traceable policy-based signatures and instantiation from lattices |
title_sort |
traceable policy-based signatures and instantiation from lattices |
publishDate |
2022 |
url |
https://hdl.handle.net/10356/163892 |
_version_ |
1753801146525286400 |