ORCID Profile
0000-0001-8555-638X
Current Organisations
University of Wollongong
,
Nanyang Technological University
Does something not look right? The information on this page has been harvested from data sources that may not be up to date. We continue to work with information providers to improve coverage and quality. To report an issue, use the Feedback Form.
Publisher: Springer Berlin Heidelberg
Date: 2015
Publisher: Springer International Publishing
Date: 2020
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2022
Publisher: Springer Berlin Heidelberg
Date: 2016
Publisher: Springer International Publishing
Date: 2021
Publisher: Oxford University Press (OUP)
Date: 18-11-2019
Abstract: Efficient user revocation is a necessary but challenging problem in many multi-user cryptosystems. Among known approaches, server-aided revocation yields a promising solution, because it allows to outsource the major workloads of system users to a computationally powerful third party, called the server, whose only requirement is to carry out the computations correctly. Such a revocation mechanism was considered in the settings of identity-based encryption and attribute-based encryption by Qin et al. (2015, ESORICS) and Cui et al. (2016, ESORICS ), respectively. In this work, we consider the server-aided revocation mechanism in the more elaborate setting of predicate encryption (PE). The latter, introduced by Katz et al. (2008, EUROCRYPT), provides fine-grained and role-based access to encrypted data and can be viewed as a generalization of identity-based and attribute-based encryption. Our contribution is 2-fold. First, we formalize the model of server-aided revocable PE (SR-PE), with rigorous definitions and security notions. Our model can be seen as a non-trivial adaptation of Cui et al.’s work into the PE context. Second, we put forward a lattice-based instantiation of SR-PE. The scheme employs the PE scheme of Agrawal et al. (2011, ASIACRYPT) and the complete subtree method of Naor et al. (2001, CRYPTO) as the two main ingredients, which work smoothly together thanks to a few additional techniques. Our scheme is proven secure in the standard model (in a selective manner), based on the hardness of the learning with errors problem.
Publisher: Springer International Publishing
Date: 2018
Publisher: Institute of Electrical and Electronics Engineers (IEEE)
Date: 09-2020
Publisher: Springer International Publishing
Date: 2019
Publisher: Springer International Publishing
Date: 2017
Publisher: Springer International Publishing
Date: 2018
Publisher: Springer Nature Switzerland
Date: 2022
Publisher: Springer Science and Business Media LLC
Date: 18-08-2015
Publisher: Elsevier BV
Date: 02-2019
Publisher: Springer International Publishing
Date: 2016
Publisher: Springer Berlin Heidelberg
Date: 2013
Publisher: Springer International Publishing
Date: 2021
Publisher: Elsevier BV
Date: 08-2022
Publisher: Springer Berlin Heidelberg
Date: 2015
Publisher: Springer Berlin Heidelberg
Date: 2016
Publisher: Springer International Publishing
Date: 2020
Publisher: Springer International Publishing
Date: 2022
Publisher: Springer International Publishing
Date: 2017
Publisher: Springer Berlin Heidelberg
Date: 2012
Publisher: Springer International Publishing
Date: 2021
Publisher: Springer International Publishing
Date: 2022
Publisher: Springer Berlin Heidelberg
Date: 2014
Publisher: Elsevier BV
Date: 09-2019
Publisher: Springer Berlin Heidelberg
Date: 2016
Publisher: Springer Science and Business Media LLC
Date: 25-05-2023
DOI: 10.1007/S00145-023-09470-6
Abstract: An accumulator is a function that hashes a set of inputs into a short, constant-size string while preserving the ability to efficiently prove the inclusion of a specific input element in the hashed set. It has proved useful in the design of numerous privacy-enhancing protocols, in order to handle revocation or simply prove set membership. In the lattice setting, currently known instantiations of the primitive are based on Merkle trees, which do not interact well with zero-knowledge proofs. In order to efficiently prove the membership of some element in a zero-knowledge manner, the prover has to demonstrate knowledge of a hash chain without revealing it, which is not known to be efficiently possible under well-studied hardness assumptions. In this paper, we provide an efficient method of proving such statements using involved extensions of Stern’s protocol. Under the Small Integer Solution assumption, we provide zero-knowledge arguments showing possession of a hash chain. As an application, we describe new lattice-based group and ring signatures in the random oracle model. In particular, we obtain: (i) the first lattice-based ring signatures with logarithmic size in the cardinality of the ring and (ii) the first lattice-based group signature that does not require any GPV trapdoor and thus allows for a much more efficient choice of parameters.
Publisher: Elsevier BV
Date: 11-2021
Publisher: Springer International Publishing
Date: 2019
Publisher: Springer International Publishing
Date: 2017
Publisher: Informa UK Limited
Date: 10-03-2022
Publisher: Elsevier BV
Date: 06-2018
Publisher: Springer International Publishing
Date: 2016
Publisher: Springer International Publishing
Date: 2020
Publisher: Springer International Publishing
Date: 2019
Publisher: Springer International Publishing
Date: 2017
Publisher: IEEE
Date: 06-2019
Publisher: Springer International Publishing
Date: 2022
Publisher: Springer International Publishing
Date: 2021
Publisher: Springer International Publishing
Date: 2019
Publisher: Springer International Publishing
Date: 2020
Publisher: Springer International Publishing
Date: 2019
Publisher: Springer International Publishing
Date: 2020
Publisher: Springer International Publishing
Date: 2017
No related grants have been discovered for Khoa Nguyen.