Floppy-size group signatures from lattices
WebSimpler Efficient Group Signatures from Lattices Phong Nguyen1,Jiang Zhang 2, Zhenfeng Zhang 1INRIA, France and Tsinghua University, China 2Institute of Software, Chinese Academy of Sciences PKC 2015 (March 30 — April 1, 2015) NIST — Gaithersburg, Maryland USA Jiang Zhang (TCA) Simpler Efficient Group Signatures from Lattices … WebJan 1, 2015 · In this paper, we present a simpler lattice-based group signature, which is more efficient by a O (\log N) factor in both the group public key and the signature size. We achieve this by using a new non-interactive zero-knowledge (NIZK) proof corresponding to a simple identity-encoding function.
Floppy-size group signatures from lattices
Did you know?
Webrecently 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]. Webtool led to the design of elegant compact group signatures [10,25] whose security relies on pairing-related assumptions. The resulting signatures typically consist in a constant number of elements of a group admitting a secure and e cient bilinear map. Lattices and Group Signatures. Lattices are emerging as a promising al-
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, … 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 …
WebNov 20, 2024 · In general, the group signature size increases the number of group members. However, the schemes are also proposed with the constant signature size. ... Floppy-Sized Group Signatures from Lattices ... WebJan 25, 2024 · This paper describes the first lattice-based group signature schemes where the signature and public key sizes are essentially logarithmic in N (for any fixed security level) and proves the security of the schemes in the random oracle model under the SIS and LWE assumptions. 135 PDF
WebIn 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.
WebThe 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). char c# w3schoolschar c wWebIn 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 … charcut sharepointWebJan 25, 2024 · To reduce potential damages caused by key exposure attacks, Song (CCS 2001) put forward the concept of forward-secure group signatures (FSGS). For the time being, all known secure FSGS schemes are based on number-theoretic assumptions, and are vulnerable against quantum computers. In this work, we construct the first lattice … char cvWeb1.3 Applications to Group Signatures and Credentials Group signatures [12] are schemes that allow members of a group to sign messages on behalf of the group without revealing their identity. In case of a dispute, the group manager can lift a signer’s anonymity and reveal his identity. Currently known group signatures based on lattice ... harrington park restaurantsWebCecilia Boschini, Jan Camenisch, and Gregory Neven. 2024. Floppy-Sized Group Signatures from Lattices. In ACNS. 163--182. ... San Ling, Khoa Nguyen, and … harrington park school calendarWebMar 1, 2024 · Lattice-based group signature is an active research topic in recent years. Since the pioneering work by Gordon, Katz and Vaikuntanathan (Asiacrypt 2010), ten other schemes have been proposed, providing various improvements in terms of security, efficiency and functionality. char c waitkey 1