A framework for practical anonymous credentials from lattices (Q6145919): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical product proofs for lattice commitments / rank
 
Normal rank
Property / cites work
 
Property / cites work: New bounds in some transference theorems in the geometry of numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: LWE without modular reduction and improved side-channel attacks against BLISS / rank
 
Normal rank
Property / cites work
 
Property / cites work: MuSig-L: lattice-based multi-signature with single-round online phase / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards classical hardness of module-LWE: the linear rank case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Access with pseudonyms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Identity-Based Encryption over NTRU Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical exact proofs from lattices: new techniques to exploit fully-splitting rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round-Optimal Composable Blind Signatures in the Common Reference String Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoors for hard lattices and new cryptographic constructions / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP Solutions of Vectorial Integer Subset Sums – Cryptanalysis of Galbraith’s Binary Matrix LWE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case to average-case reductions for module lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949336 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice Signatures without Trapdoors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotically efficient lattice-based digital signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: BLOOM: bimodal lattice one-out-of-many proofs and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general / rank
 
Normal rank
Property / cites work
 
Property / cites work: SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst‐Case to Average‐Case Reductions Based on Gaussian Measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new framework for more efficient round-optimal lattice-based (partially) blind signature via trapdoor sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lattices, learning with errors, random linear codes, and cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications / rank
 
Normal rank

Latest revision as of 11:34, 26 August 2024

scientific article; zbMATH DE number 7799228
Language Label Description Also known as
English
A framework for practical anonymous credentials from lattices
scientific article; zbMATH DE number 7799228

    Statements

    A framework for practical anonymous credentials from lattices (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 February 2024
    0 references
    anonymous credential schemes
    0 references
    zero-knowledge proofs of knowledge
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers