Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors

DOI10.1007/978-3-662-49896-5_1zbMath1369.94552OpenAlexW2470757336MaRDI QIDQ5739196

San Ling, Benoît Libert, Huaxiong Wang, Khoa Nguyen

Publication date: 15 July 2016

Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01314642/file/LLNW-16.pdf

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (51)

DualRing: generic construction of ring signatures with efficient instantiations ⋮ Compact ring signatures from learning with errors ⋮ Multi-party revocation in sovrin: performance through distributed trust ⋮ Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices ⋮ Lattice-based zero-knowledge arguments for additive and multiplicative relations ⋮ Zero-knowledge proofs for set membership: efficient, succinct, modular ⋮ One-time traceable ring signatures ⋮ Memory lower bounds of reductions revisited ⋮ Logarithmic-size ring signatures with tight security from the DDH assumption ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model ⋮ Lattice-based secret handshakes with reusable credentials ⋮ On tightly-secure (linkable) ring signatures ⋮ Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy ⋮ Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations ⋮ Lattice-based accumulator with constant time list update and constant time verification ⋮ Succinct vector, polynomial, and functional commitments from lattices ⋮ Efficient laconic cryptography from learning with errors ⋮ Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption ⋮ Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions ⋮ Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general ⋮ Multimodal private signatures ⋮ Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs ⋮ Efficient unique ring signatures from lattices ⋮ Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors ⋮ A note on the post-quantum security of (ring) signatures ⋮ A new lattice-based online/offline signatures framework for low-power devices ⋮ Post-quantum asynchronous deniable key exchange and the signal handshake ⋮ Zero-knowledge range arguments for signed fractional numbers from lattices ⋮ Efficient code-based fully dynamic group signature scheme ⋮ Non-interactive composition of sigma-protocols via Share-then-Hash ⋮ Calamari and Falafl: logarithmic (linkable) ring signatures from isogenies and lattices ⋮ Acyclicity programming for sigma-protocols ⋮ Secret handshakes: full dynamicity, deniability and lattice-based design ⋮ Foundations of fully dynamic group signatures ⋮ Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption ⋮ Lattice-Based Group Signatures with Verifier-Local Revocation: Achieving Shorter Key-Sizes and Explicit Traceability with Ease ⋮ A lattice-based group signature scheme with verifier-local revocation ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Zero-knowledge proofs for set membership: efficient, succinct, modular ⋮ Traceable ring signatures: general framework and post-quantum security ⋮ Adaptive oblivious transfer with access control from lattice assumptions ⋮ Sigma protocols for MQ, PKP and SIS, and fishy signature schemes ⋮ A lattice-based fully dynamic group signature scheme without NIZK ⋮ A Lattice-Based Group Signature Scheme with Message-Dependent Opening ⋮ Group encryption: full dynamicity, message filtering and code-based instantiation ⋮ Lattice-based group signatures: achieving full dynamicity (and deniability) with ease ⋮ Survey of Lattice-Based Group Signature ⋮ Covert authentication from lattices ⋮ New code-based cryptographic accumulator and fully dynamic group signature ⋮ A Practical Group Signature Scheme Based on Rank Metric

This page was built for publication: Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors