Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
Authenticated hash tables based on cryptographic accumulators
Policy-based signature scheme from lattices
Ring signatures: Stronger definitions, and constructions without random oracles
Post-quantum zero-knowledge proofs for accumulators with applications to ring signatures from symmetric-key primitives
Zero-knowledge arguments for lattice-based PRFs and applications to E-cash
Lattice-based zero-knowledge arguments for integer relations
New code-based privacy-preserving cryptographic constructions
Post-quantum EPID signatures from symmetric primitives
Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
A Provably Secure Group Signature Scheme from Code-Based Assumptions
Hardness of SIS and LWE with Small Parameters
Lattice-Based Group Signatures with Logarithmic Signature Size
Lattice Signatures without Trapdoors
Fully Anonymous Attribute Tokens from Lattices
Bivariate Polynomials Modulo Composites and Their Applications
Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
Simpler Efficient Group Signatures from Lattices
Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
Adaptive Proofs of Knowledge in the Random Oracle Model
One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin
Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
Short Pairing-Based Non-interactive Zero-Knowledge Arguments
A Group Signature Scheme from Lattice Assumptions
Revocation for Delegatable Anonymous Credentials
Collision-Free Hashing from Lattice Problems
A new paradigm for public key identification
Trapdoors for hard lattices and new cryptographic constructions
Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
Bonsai Trees, or How to Delegate a Lattice Basis
A Framework for Efficient and Composable Oblivious Transfer
Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
Universal Accumulators with Efficient Nonmembership Proofs
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
Statistically Hiding Sets
Group Signatures
Applied Cryptography and Network Security
Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
Vector Commitments and Their Applications
Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
Streaming Authenticated Data Structures
Adapting Lyubashevsky’s Signature Schemes to the Ring Signature Setting
Short Accountable Ring Signatures Based on DDH
Public-key cryptosystems from the worst-case shortest vector problem
Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
Advances in Cryptology - EUROCRYPT 2004
Advances in Cryptology - EUROCRYPT 2004
Compact E-Cash from Bounded Accumulator
Lattice-Based Group Signature Scheme with Verifier-Local Revocation
Advances in Cryptology - CRYPTO 2003
Ring Signatures of Sub-linear Size Without Random Oracles
Lattice-Based Identification Schemes Secure Under Active Attacks
Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Topics in Cryptology – CT-RSA 2005
Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
Multi-bit Cryptosystems Based on Lattice Problems
On lattices, learning with errors, random linear codes, and cryptography
Advances in Cryptology - ASIACRYPT 2003
Adaptive oblivious transfer with access control from lattice assumptions

This page was built for publication: Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors