Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs (Q6108830): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Structure-Preserving Signatures and Commitments to Group Elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Framework for Universally Composable Non-committing Blind Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Lattice (H)IBE in the Standard Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4536806 / 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: P-signatures and Noninteractive Anonymous Credentials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confined guessing: new signatures from standard assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology – CRYPTO 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical hardness of learning with errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious Transfer with Hidden Access Control Policies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure Preserving CCA Secure Encryption and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Portability of Generalized Schnorr Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Treatment of Privacy-Enhancing Credential Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778843 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414288 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully Anonymous Attribute Tokens from Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulatable Adaptive Oblivious Transfer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in Cryptology - CRYPTO 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Non-malleability of the Fiat-Shamir Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: How To Prove Yourself: Practical Solutions to Identification and Signature Problems / 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: Predicting Lattice Reduction / 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: Efficient Non-interactive Proof Systems for Bilinear Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3374936 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group Signatures with Efficient Concurrent Join / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice-Based Group Signatures with Logarithmic Signature Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice-Based Group Signature Scheme with Verifier-Local Revocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based / 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: One-Shot Verifiable Encryption from Lattices / 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: Simpler Efficient Group Signatures from Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new identification scheme based on syndrome decoding / rank
 
Normal rank

Revision as of 13:11, 1 August 2024

scientific article; zbMATH DE number 7705002
Language Label Description Also known as
English
Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs
scientific article; zbMATH DE number 7705002

    Statements

    Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs (English)
    0 references
    0 references
    0 references
    0 references
    30 June 2023
    0 references
    zero-knowledge proof
    0 references
    commitment scheme
    0 references
    generalized Schnorr proofs
    0 references
    Camenisch-Lysyanskaya signature
    0 references
    rejection sampling
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers