MatRiCT<sup>+</sup>: More Efficient Post-Quantum Private Blockchain Payments

Esgin, Muhammed F.; Steinfeld, Ron; Zhao, Raymond K.

doi:10.1109/sp46214.2022.9833655

Cited by 32 publications

(15 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Comparison to prior work. To the best of our knowledge, Esgin et al [47,48] are the only other work that (implicitly) provide an efficient post-quantum accountable ring signature. 2 Since the efficiency of an accountable ring signature is equivalent to those of the group signature obtained through limiting the functionality of the accountable ring signature, we chose to compare the efficiency of our scheme with other state-of-the-art post-quantum group signatures.…”

Section: Our Contributionmentioning

confidence: 99%

“…Our scheme is the only one to achieve full CCA anonymity. Esgin et al [47] achieves full CPA anonymity, where anonymity is broken once an adversary is given access to an opening oracle; in practice, this means that if a specific signature is once opened to some user, then any signature ever signed by that particular user will lose anonymity. Here, "full" means that the signing key of all the users may be exposed to the adversary.…”

Section: Our Contributionmentioning

confidence: 99%

“…However, these results remained purely asymptotic. It was not until recently that efficient lattice-based group signatures appeared [22,38,47,48]. In [47], Esgin et al report a signature size of 12KB and 19KB for a group size of N = 2 6 and 2 10 , respectivelyseveral orders of magnitude better than prior constructions.…”

Section: Introductionmentioning

confidence: 99%

“…It was not until recently that efficient lattice-based group signatures appeared [22,38,47,48]. In [47], Esgin et al report a signature size of 12KB and 19KB for a group size of N = 2 6 and 2 10 , respectivelyseveral orders of magnitude better than prior constructions. 1 These rapid improvements in efficiency for lattices originate in the recent progress of lattice-based NIZK proof systems for useful languages [5,21,45,46,75,76,85], most of which rely heavily on the properties of special structured lattices.…”

Section: Introductionmentioning

confidence: 99%

“…In addition, as we discuss in more detail later, we notice that all works regarding efficient post-quantum group signatures [22,38,47,48,60] do not satisfy the ideal security properties (which are by now considered standard) formalized by Bootle et al [20]. Thus, we are also interested in the following question:…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Group signatures and more from isogenies and lattices: generic, simple, and efficient

Beullens

Dobson

Katsumata

et al. 2023

Des. Codes Cryptogr.

View full text Add to dashboard Cite

We construct an efficient dynamic group signature (or more generally an accountable ring signature) from isogeny and lattice assumptions. Our group signature is based on a simple generic construction that can be instantiated by cryptographically hard group actions such as the CSIDH group action or an MLWE-based group action. The signature is of size $$O(\log N)$$ O ( log N ) , where N is the number of users in the group. Our idea builds on the recent efficient OR-proof by Beullens, Katsumata, and Pintore (Asiacrypt’20), where we efficiently add a proof of valid ciphertext to their OR-proof and further show that the resulting non-interactive zero-knowledge proof system is online extractable. Our group signatures satisfy more ideal security properties compared to previously known constructions, while simultaneously having an attractive signature size. The signature size of our isogeny-based construction is an order of magnitude smaller than all previously known post-quantum group signatures (e.g., 6.6 KB for 64 members). In comparison, our lattice-based construction has a larger signature size (e.g., either 126 KB or 89 KB for 64 members depending on the satisfied security property). However, since the $$O(\cdot )$$ O ( · ) -notation hides a very small constant factor, it remains small even for very large group sizes, say $$2^{20}$$ 2 20 .

show abstract

Section: Our Contributionmentioning

confidence: 99%

Section: Our Contributionmentioning

confidence: 99%