Lattice-based proof-friendly signatures from vanishing short integer solutions
From MaRDI portal
Cites work
- \textsf{BLAZE}: practical lattice-based blind signatures for privacy-preserving applications
- A framework for practical anonymous credentials from lattices
- A generic construction of an anonymous reputation system and instantiations from lattices
- A Group Signature Scheme from Lattice Assumptions
- A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- BlindOR: an efficient lattice-based blind signature scheme from OR-proofs
- Breaking parallel ROS: implication for isogeny and lattice-based blind signatures
- Constant-Size Dynamic k-TAA
- Efficient identity-based encryption over NTRU lattices
- Efficient lattice-based blind signatures via Gaussian one-time signatures
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Efficient public key encryption based on ideal lattices (extended abstract)
- Floppy-sized group signatures from lattices
- Group signatures and more from isogenies and lattices: generic, simple, and efficient
- scientific article; zbMATH DE number 1952906 (Why is no real title available?)
- Improved short lattice signatures in the standard model
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Lattice signature with efficient protocols, application to anonymous credentials
- Lattice signatures without trapdoors
- Lattice-based blind signatures
- Lattice-based blind signatures, revisited
- Lattice-based group signatures with logarithmic signature size
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Lattice-based succinct arguments from vanishing polynomials (extended abstract)
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- LP solutions of vectorial integer subset sums -- cryptanalysis of Galbraith's binary matrix LWE
- LWE without modular reduction and improved side-channel attacks against BLISS
- Modular hyperbolas
- New bounds in some transference theorems in the geometry of numbers
- On lattice-based interactive protocols: an approach with less or no aborts
- On the (in)security of ROS
- On the (in)security of ROS
- On the concrete hardness of learning with errors
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Revisiting BBS signatures
- Round-Optimal Composable Blind Signatures in the Common Reference String Model
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Succinct vector, polynomial, and functional commitments from lattices
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
Cited in
(1)
This page was built for publication: Lattice-based proof-friendly signatures from vanishing short integer solutions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6951591)
