The following pages link to (Q3210171):
Displaying 50 items.
- On removing rejection conditions in practical lattice-based signatures (Q2118558) (← links)
- Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model (Q2119006) (← links)
- Practical algorithm substitution attack on extractable signatures (Q2119943) (← links)
- Tighter security for Schnorr identification and signatures: a high-moment forking lemma for \({\varSigma }\)-protocols (Q2120075) (← links)
- A compressed \(\varSigma \)-protocol theory for lattices (Q2128575) (← links)
- Does Fiat-Shamir require a cryptographic hash function? (Q2139639) (← links)
- Generic plaintext equality and inequality proofs (Q2145406) (← links)
- An isogeny-based ID protocol using structured public keys (Q2149792) (← links)
- Cross-domain attribute-based access control encryption (Q2149810) (← links)
- Selectively linkable group signatures -- stronger security and preserved verifiability (Q2149824) (← links)
- Concurrent signatures from a variety of keys (Q2151283) (← links)
- Adaptively secure threshold symmetric-key encryption (Q2152046) (← links)
- Reusing nonces in Schnorr signatures (and keeping it secure...) (Q2167718) (← links)
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions (Q2170057) (← links)
- On the multi-user security of short Schnorr signatures with preprocessing (Q2170064) (← links)
- Short pairing-free blind signatures with exponential security (Q2170071) (← links)
- On the Menezes-Teske-Weng conjecture (Q2179501) (← links)
- Forward-secure ID based digital signature scheme with forward-secure private key generator (Q2195298) (← links)
- Robust digital signature revisited (Q2205942) (← links)
- An efficient eCK secure identity based two party authenticated key agreement scheme with security against active adversaries (Q2216128) (← links)
- Cryptographic reverse firewalls for interactive proof systems (Q2220883) (← links)
- Strongly secure identity-based authenticated key agreement protocols without bilinear pairings (Q2282019) (← links)
- Cryptanalysis of a rank-based signature with short public keys (Q2306903) (← links)
- A probabilistic analysis on a lattice attack against DSA (Q2329391) (← links)
- IND-CCA secure encryption based on a Zheng-Seberry scheme (Q2349630) (← links)
- Delegation with supervision (Q2384523) (← links)
- On tight security proofs for Schnorr signatures (Q2423848) (← links)
- Security reconsideration of the Huang-Wang nominative signature (Q2476775) (← links)
- A novel efficient \((t,n)\) threshold proxy signature scheme (Q2489232) (← links)
- Speeding up exponentiation using an untrusted computational resource (Q2491304) (← links)
- Algorithm of asynchronous binary signed-digit recoding on fast multiexponentiation (Q2570694) (← links)
- Secure parameterized pattern matching (Q2663480) (← links)
- Towards self-stabilizing blockchain, reconstructing totally erased blockchain (Q2672262) (← links)
- On tightly-secure (linkable) ring signatures (Q2673067) (← links)
- On the impossibility of purely algebraic signatures (Q2697897) (← links)
- Shared permutation for syndrome decoding: new zero-knowledge protocol and code-based signature (Q2698345) (← links)
- Universally Verifiable Multiparty Computation from Threshold Homomorphic Cryptosystems (Q2794490) (← links)
- Scalable Divisible E-cash (Q2794505) (← links)
- A Transform for NIZK Almost as Efficient and General as the Fiat-Shamir Transform Without Programmable Random Oracles (Q2799091) (← links)
- Improved OR-Composition of Sigma-Protocols (Q2799092) (← links)
- Accountable Large-Universe Attribute-Based Encryption Supporting Any Monotone Access Structures (Q2817489) (← links)
- Fuzzy Signatures: Relaxing Requirements and a New Construction (Q2822668) (← links)
- Efficient Zero-Knowledge Proof of Algebraic and Non-Algebraic Statements with Applications to Privacy Preserving Credentials (Q2829958) (← links)
- Encryption Switching Protocols (Q2835592) (← links)
- Cryptography from Learning Parity with Noise (Q2891361) (← links)
- Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption (Q2953774) (← links)
- Indistinguishable Proofs of Work or Knowledge (Q2953800) (← links)
- Signcryption Schemes Based on the Diffie–Hellman Problem (Q3000030) (← links)
- Identification Schemes from Key Encapsulation Mechanisms (Q3011903) (← links)
- Identity-Based Deterministic Signature Scheme without Forking-Lemma (Q3098000) (← links)
