Pages that link to "Item:Q3777940"
From MaRDI portal
The following pages link to How To Prove Yourself: Practical Solutions to Identification and Signature Problems (Q3777940):
Displaying 50 items.
- More efficient structure-preserving signatures -- or: bypassing the type-III lower bounds (Q2167723) (← links)
- Efficient proof composition for verifiable computation (Q2167734) (← links)
- Logarithmic-size ring signatures with tight security from the DDH assumption (Q2167754) (← links)
- A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme (Q2168799) (← links)
- Round-optimal black-box protocol compilers (Q2170000) (← links)
- Group signatures and more from isogenies and lattices: generic, simple, and efficient (Q2170040) (← links)
- Non-interactive zero-knowledge proofs with fine-grained security (Q2170050) (← links)
- On succinct non-interactive arguments in relativized worlds (Q2170051) (← links)
- Fiat-Shamir bulletproofs are non-malleable (in the algebraic group model) (Q2170055) (← links)
- Gemini: elastic SNARKs for diverse environments (Q2170056) (← links)
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions (Q2170057) (← links)
- One-shot Fiat-Shamir-based NIZK arguments of composite residuosity and logarithmic-size ring signatures in the standard model (Q2170058) (← links)
- On the multi-user security of short Schnorr signatures with preprocessing (Q2170064) (← links)
- Practical post-quantum signature schemes from isomorphism problems of trilinear forms (Q2170103) (← links)
- General linear group action on tensors: a candidate for post-quantum cryptography (Q2175914) (← links)
- Succinct arguments in the quantum random oracle model (Q2175929) (← links)
- On the (In)security of Kilian-based SNARGs (Q2175953) (← links)
- PKP-based signature scheme (Q2179377) (← links)
- Forward-secure ID based digital signature scheme with forward-secure private key generator (Q2195298) (← links)
- Tight security for the generic construction of identity-based signature (in the multi-instance setting) (Q2210521) (← links)
- New technique for chosen-ciphertext security based on non-interactive zero-knowledge (Q2214958) (← links)
- Speeding-up verification of digital signatures (Q2220442) (← links)
- Cryptographic reverse firewalls for interactive proof systems (Q2220883) (← links)
- Tightly secure ring signatures in the standard model (Q2235773) (← links)
- Escrow free attribute-based signature with self-revealability (Q2282038) (← links)
- Elimination-based certificates for triangular equivalence and rank profiles (Q2284959) (← links)
- Cryptanalysis of a rank-based signature with short public keys (Q2306903) (← links)
- A generic framework for accountable optimistic fair exchange protocol (Q2311072) (← links)
- Lattice-based group signatures: achieving full dynamicity (and deniability) with ease (Q2317863) (← links)
- Strongly unforgeable ring signature scheme from lattices in the standard model (Q2336385) (← links)
- An \(r\)-hiding revocable group signature scheme: group signatures with the property of hiding the number of revoked users (Q2336893) (← links)
- Prêt à voter with Paillier encryption (Q2389798) (← links)
- Fully leakage-resilient signatures (Q2392093) (← links)
- Naor-Yung paradigm with shared randomness and applications (Q2401764) (← links)
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge (Q2416940) (← links)
- New forward-secure signature schemes with untrusted update (Q2418647) (← links)
- Efficient RSA key generation and threshold Paillier in the two-party setting (Q2423838) (← links)
- On tight security proofs for Schnorr signatures (Q2423848) (← links)
- A provably secure short signature scheme based on discrete logarithms (Q2456500) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- Forward-secure multisignature and blind signature schemes (Q2572732) (← links)
- Attribute-based versions of Schnorr and ElGamal (Q2634583) (← links)
- Toward non-interactive zero-knowledge proofs for NP from LWE (Q2661693) (← links)
- Absentia: secure multiparty computation on ethereum (Q2670861) (← links)
- On tightly-secure (linkable) ring signatures (Q2673067) (← links)
- Cryptanalysis of multivariate threshold ring signature schemes (Q2681401) (← links)
- Secure MPC: laziness leads to GOD (Q2691583) (← links)
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? (Q2691585) (← links)
- Efficient fully secure computation via distributed zero-knowledge proofs (Q2691587) (← links)
- ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing (Q2691589) (← links)
