The following pages link to (Q4737261):
Displaying 37 items.
- Tightly secure signatures from lossy identification schemes (Q315555) (← links)
- Security proofs for identity-based identification and signature schemes (Q1027974) (← links)
- Fiat-Shamir for highly sound protocols is instantiable (Q1637340) (← links)
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
- Random oracles and non-uniformity (Q1648794) (← links)
- On the tightness of forward-secure signature reductions (Q1715854) (← links)
- Security of hedged Fiat-Shamir signatures under fault attacks (Q2055633) (← links)
- Signatures from sequential-OR proofs (Q2055653) (← links)
- Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512 (Q2055690) (← links)
- Lattice-based blind signatures, revisited (Q2096538) (← links)
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols (Q2120075) (← links)
- Fine-grained forward secrecy: allow-list/deny-list encryption and applications (Q2147256) (← links)
- An isogeny-based ID protocol using structured public keys (Q2149792) (← links)
- Identification scheme and forward-secure signature in identity-based setting from isogenies (Q2697929) (← links)
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature (Q2698345) (← links)
- Fiat–Shamir for Highly Sound Protocols Is Instantiable (Q2827720) (← links)
- Optimal Security Proofs for Signatures from Identification Schemes (Q2829210) (← links)
- From Identification to Signatures, Tightly: A Framework and Generic Transforms (Q2953785) (← links)
- Tighter Reductions for Forward-Secure Signature Schemes (Q4916016) (← links)
- LESS is More: Code-Based Signatures Without Syndromes (Q5048961) (← links)
- Lossy Identification Schemes from Decisional RSA (Q5135709) (← links)
- Construction of Universal Designated-Verifier Signatures and Identity-Based Signatures from Standard Signatures (Q5445450) (← links)
- Deterring Certificate Subversion: Efficient Double-Authentication-Preventing Signatures (Q5738754) (← links)
- A novel 3-pass identification scheme and signature scheme based on multivariate quadratic polynomials (Q5742929) (← links)
- Identification protocols and signature schemes based on supersingular isogeny problems (Q5919490) (← links)
- Extended security arguments for signature schemes (Q5963366) (← links)
- Provably unforgeable threshold EdDSA with an offline participant and trustless setup (Q6095326) (← links)
- Masking the GLP lattice-based signature scheme at any order (Q6182002) (← links)
- Exploring SIDH-based signature parameters (Q6547992) (← links)
- Fiat-Shamir security of FRI and related SNARKs (Q6562558) (← links)
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \(\Sigma\)-protocols (Q6570528) (← links)
- Rogue-instance security for batch knowledge proofs (Q6581786) (← links)
- How to compile polynomial IOP into simulation-extractable SNARKs: a modular approach (Q6582228) (← links)
- Cutting the GRASS: threshold group action signature schemes (Q6636123) (← links)
- Fiat-Shamir bulletproofs are non-malleable (in the Random Oracle Model) (Q6655876) (← links)
- Sign-then-encrypt with security enhancement and compressed ciphertext (Q6658310) (← links)
- On the concrete security of non-interactive FRI (Q6660394) (← links)
