Floppy-size group signatures from lattices
Consider the polynomial ring \mathcal {R}_{q}=\mathbb {Z}_q/\langle \mathbf {x}^n+1\rangle for a prime q\equiv 5\text { mod }8. Elements in the ring are polynomials of degree at most n-1 with coefficients in \left[ -(q-1)/2,(q-1)/2\right] and operations between ring elements are done modulo q. Let \deg … See more ([29, Lemma 2.2]). Let \mathcal {R}_{q}=\mathbb {Z}_q[\mathbf {x}]/\langle \mathbf {x}^n+1\rangle where n>1 is a power of 2 and q is a prime congruent to 5\text { mod }8. This ring has exactly 2q^{n/2}-1 elements … See more (cf. [2, Lemma 1.5], [27, Lemma 4.4]). Let \mathbf {A}\in \mathbb {Z}^{n\times m} with 2^{11}< m and \mathbf {u}\in \mathbb {Z}^n_q. For \sigma … See more For \mathbf {a},\mathbf {b}\in \mathcal {R}_{q} it holds: \Vert \mathbf {a}\mathbf {b} \Vert _\infty \le \min \left\{ \Vert \mathbf {a} \Vert _\infty \Vert \mathbf {b} \Vert _1,(q-1)/2\right\} . … See more An integer lattice is an additive subgroup of \mathbb {Z}^n. Every lattice \varLambda is generated by a basis \mathbf {B}=\{\mathbf {b}_1,\ldots ,\mathbf {b}_k\}\in \mathbb {Z}^{n\times m}, where m is called … See more
Floppy-size group signatures from lattices
Did you know?
WebAbstract. We present the rst lattice-based group signature scheme whose cryptographic artifacts are of size small enough to be usable in practice: for a group of 225 users, … WebConstant-size group signatures from lattices. In PKC 2024, volume 10770 of LNCS, pages 58-88. Springer, 2024. 3.San Ling, Khoa Nguyen, Huaxiong Wang, and Yanhong Xu. Forward-secure group signatures from lattices. CoRR, abs/1801.08323, 2024. Submitted to PQCrypto 2024. 4.San Ling, Khoa Nguyen, Huaxiong Wang, and Yanhong Xu. Lattice …
WebMore precisely, signature size, signing and verification costs do not depend on number of time periods Tand other metrics are at most log-squared complexity in T. However, all these schemes are constructions based on number-theoretic ... We introduce the first forward-secure group signature scheme from lattices. The scheme works in Nakanishi ... Web[9] constructed the first constant-size group signature from lattices, and the scheme is based on the DMS. Katsumata et al. [30] made group signatures without NIZK from …
WebIn this work, we introduce the first constant-size group signature from lattices, which means that the size of signatures produced by the scheme is independent of Nand only depends on the security parameter λ. More precisely, in our scheme, the sizes of signatures, public key and users’ se-cret keys are all of order Oe(λ). The scheme ... WebSep 30, 2024 · Published: November 2024. Abstract. We propose the first lattice-based dynamic group signature scheme achieving forward security. Our scheme is proven to be secure against framing attack, misidentification attack and preserves anonymity under the learning with errors ( L W E) and short integer solution ( S I S) assumptions in the …
WebThe rst group signature from lattices was introduced by Gordon et al. [GKV10]. While their scheme is of great theoretical interest, its public key and signature have sizes NOe(n2), for ... [GKV10], but the signature size is still linear in N. The linear-size barrier was nally overcome by Laguillaumie et al. [LLLS13], who designed
WebJan 18, 2024 · Group signature is a fundamental cryptographic primitive, aiming to protect anonymity and ensure accountability of users. It allows group members to anonymously … ethical community.orgWebAbstract. A group signature allows a group member to anonymously sign mes-sages on behalf of the group. In the past few years, new group signatures based on lattice problems have appeared: the most efficient lattice-based constructions are due to Laguillaumie et al. (Asiacrypt ’13) and Langlois et al. (PKC ’14). Both ethical communication skillsWebMay 15, 2024 · Floppy-Sized Group Signatures from Lattices. We present the first lattice-based group signature scheme whose cryptographic artifacts are of size small enough … ethical communitiesWebThe 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). ethical communication essayWebIn this paper, we provide an improved dynamic GS-VLR over lattices, which is efficient by eliminating a Olog N factor for both sizes. To realize the goal, we adopt a more efficient and compact identity-encoding technique. ethical communityWebWe present the first lattice-based group signature scheme whose cryptographic artifacts are of size small enough to be usable in practice: for a group of $$2^{25}$$ 2 25 users, signatures take 910 kB and public keys are 501 kB. Our scheme builds … fire in flintshire todayWebrecently active topic of lattice-based group signatures. Lattice-based group signatures. The first lattice-based group signature scheme was introduced by Gordon, Katz and Vaikuntanathan in 2010 [20]. Sub-sequently, numerous schemes offering improvements in terms of security and efficiency have been proposed [12,26,34,48,30,28,9,51]. ethical community definition