The following pages link to (Q4409116):
Displaying 34 items.
- Twin-Beth: security under active and concurrent attacks for the Beth identity-based identification scheme (Q301642) (← links)
- Unprovable security of perfect NIZK and non-interactive non-malleable commitments (Q332270) (← links)
- A new framework for the design and analysis of identity-based identification schemes (Q955014) (← links)
- Security proofs for identity-based identification and signature schemes (Q1027974) (← links)
- Lattice-based blind signatures, revisited (Q2096538) (← links)
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model (Q2119006) (← links)
- Two-round trip Schnorr multi-signatures via delinearized witnesses (Q2120071) (← links)
- MuSig2: simple two-round Schnorr multi-signatures (Q2120074) (← links)
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures (Q2152049) (← links)
- Tell me the truth: practically public authentication for outsourced databases with multi-user modification (Q2293037) (← links)
- Simple Schnorr multi-signatures with applications to bitcoin (Q2324793) (← links)
- OrBit: OR-proof identity-based identification with tight security for (as low as) 1-bit loss (Q2697915) (← links)
- Identification scheme and forward-secure signature in identity-based setting from isogenies (Q2697929) (← links)
- Optimal Security Proofs for Signatures from Identification Schemes (Q2829210) (← links)
- Hierarchical Deterministic Bitcoin Wallets that Tolerate Key Leakage (Q2948192) (← links)
- From Identification to Signatures, Tightly: A Framework and Generic Transforms (Q2953785) (← links)
- Identification Schemes from Key Encapsulation Mechanisms (Q3011903) (← links)
- Concurrent Signatures with Fully Negotiable Binding Control (Q3092356) (← links)
- An Efficient and Provable Secure Identity-Based Identification Scheme in the Standard Model (Q3506348) (← links)
- A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort (Q3540059) (← links)
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems (Q3600386) (← links)
- One-Round ID-Based Blind Signature Scheme without ROS Assumption (Q3600513) (← links)
- Improved Zero-Knowledge Identification with Lattices (Q4933208) (← links)
- Identification Schemes of Proofs of Ability Secure against Concurrent Man-in-the-Middle Attacks (Q4933209) (← links)
- Separation Results on the “One-More” Computational Problems (Q5458933) (← links)
- On the Security of Beth’s Identification Schemes against Active and Concurrent Adversaries (Q5504560) (← links)
- The One-More Discrete Logarithm Assumption in the Generic Group Model (Q6041299) (← links)
- Chain Reductions for Multi-signatures and the HBMS Scheme (Q6045076) (← links)
- Entanglement Between Hash Encodings and Signatures from ID Schemes with Non-binary Challenges: A Case Study on Lightweight Code-Based Signatures (Q6108617) (← links)
- A Trustless GQ Multi-signature Scheme with Identifiable Abort (Q6488403) (← links)
- Publicly auditable functional encryption (Q6535127) (← links)
- A generic construction of tightly secure password-based authenticated key exchange (Q6562583) (← links)
- G+G: a Fiat-Shamir lattice signature based on convolved Gaussians (Q6595915) (← links)
- Pairing-free blind signatures from CDH assumptions (Q6648192) (← links)
