Provably secure attribute based signcryption with delegated computation and efficient key updating
Equipped with the advantages of flexible access control and fine-grained authentication, attribute based signcryption is diffusely designed for security preservation in many scenarios. However, realizing efficient key evolution and reducing the calculation costs are two challenges which should be gi...
Saved in:
Main Authors: | , , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2017
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/3810 https://ink.library.smu.edu.sg/context/sis_research/article/4812/viewcontent/TIIS_Vol_11__No_5_19.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
id |
sg-smu-ink.sis_research-4812 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-48122019-01-31T05:46:12Z Provably secure attribute based signcryption with delegated computation and efficient key updating HONG, Hanshu XIA, Yunhao SUN, Zhixin LIU, Ximeng Equipped with the advantages of flexible access control and fine-grained authentication, attribute based signcryption is diffusely designed for security preservation in many scenarios. However, realizing efficient key evolution and reducing the calculation costs are two challenges which should be given full consideration in attribute based cryptosystem. In this paper, we present a key-policy attribute based signcryption scheme (KP-ABSC) with delegated computation and efficient key updating. In our scheme, an access structure is embedded into user’s private key, while ciphertexts corresponds a target attribute set. Only the two are matched can a user decrypt and verify the ciphertexts. When the access privileges have to be altered or key exposure happens, the system will evolve into the next time slice to preserve the forward security. What’s more, data receivers can delegate most of the de-signcryption task to data server, which can reduce the calculation on client’s side. By performance analysis, our scheme is shown to be secure and more efficient, which makes it a promising method for data protection in data outsourcing systems. 2017-05-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/3810 info:doi/10.3837/tiis.2017.05.019 https://ink.library.smu.edu.sg/context/sis_research/article/4812/viewcontent/TIIS_Vol_11__No_5_19.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University Attribute based encryption Efficient Key evolution Signcryption Databases and Information Systems Information Security |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Attribute based encryption Efficient Key evolution Signcryption Databases and Information Systems Information Security |
spellingShingle |
Attribute based encryption Efficient Key evolution Signcryption Databases and Information Systems Information Security HONG, Hanshu XIA, Yunhao SUN, Zhixin LIU, Ximeng Provably secure attribute based signcryption with delegated computation and efficient key updating |
description |
Equipped with the advantages of flexible access control and fine-grained authentication, attribute based signcryption is diffusely designed for security preservation in many scenarios. However, realizing efficient key evolution and reducing the calculation costs are two challenges which should be given full consideration in attribute based cryptosystem. In this paper, we present a key-policy attribute based signcryption scheme (KP-ABSC) with delegated computation and efficient key updating. In our scheme, an access structure is embedded into user’s private key, while ciphertexts corresponds a target attribute set. Only the two are matched can a user decrypt and verify the ciphertexts. When the access privileges have to be altered or key exposure happens, the system will evolve into the next time slice to preserve the forward security. What’s more, data receivers can delegate most of the de-signcryption task to data server, which can reduce the calculation on client’s side. By performance analysis, our scheme is shown to be secure and more efficient, which makes it a promising method for data protection in data outsourcing systems. |
format |
text |
author |
HONG, Hanshu XIA, Yunhao SUN, Zhixin LIU, Ximeng |
author_facet |
HONG, Hanshu XIA, Yunhao SUN, Zhixin LIU, Ximeng |
author_sort |
HONG, Hanshu |
title |
Provably secure attribute based signcryption with delegated computation and efficient key updating |
title_short |
Provably secure attribute based signcryption with delegated computation and efficient key updating |
title_full |
Provably secure attribute based signcryption with delegated computation and efficient key updating |
title_fullStr |
Provably secure attribute based signcryption with delegated computation and efficient key updating |
title_full_unstemmed |
Provably secure attribute based signcryption with delegated computation and efficient key updating |
title_sort |
provably secure attribute based signcryption with delegated computation and efficient key updating |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2017 |
url |
https://ink.library.smu.edu.sg/sis_research/3810 https://ink.library.smu.edu.sg/context/sis_research/article/4812/viewcontent/TIIS_Vol_11__No_5_19.pdf |
_version_ |
1770573766547472384 |