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.
- Fiat-Shamir for highly sound protocols is instantiable (Q1637340) (← links)
- Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm (Q1643980) (← links)
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption (Q1648782) (← links)
- Random oracles and non-uniformity (Q1648794) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Shorter quasi-adaptive NIZK proofs for linear subspaces (Q1698397) (← links)
- CSIDH: an efficient post-quantum commutative group action (Q1710683) (← links)
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption (Q1711842) (← links)
- On the tightness of forward-secure signature reductions (Q1715854) (← links)
- On the impossibility of structure-preserving deterministic primitives (Q1715860) (← links)
- A lattice-based group signature scheme with verifier-local revocation (Q1749538) (← links)
- Secret, verifiable auctions from elections (Q1749541) (← links)
- Zero-knowledge argument for simultaneous discrete logarithms (Q1759659) (← links)
- A new NP-complete problem and public-key identification (Q1866023) (← links)
- Fast generation of prime numbers and secure public-key cryptographic parameters. (Q1895963) (← links)
- Verification protocols with sub-linear communication for polynomial matrix operations (Q1994891) (← links)
- New number-theoretic cryptographic primitives (Q2023304) (← links)
- Formalising \(\varSigma\)-protocols and commitment schemes using crypthol (Q2031427) (← links)
- Traceable ring signatures: general framework and post-quantum security (Q2034982) (← links)
- Compact designated verifier NIZKs from the CDH assumption without pairings (Q2051369) (← links)
- Candidate iO from homomorphic encryption schemes (Q2055602) (← links)
- Security of hedged Fiat-Shamir signatures under fault attacks (Q2055633) (← links)
- Transparent SNARKs from DARK compilers (Q2055634) (← links)
- SPARKs: succinct parallelizable arguments of knowledge (Q2055636) (← links)
- Marlin: preprocessing zkSNARKs with universal and updatable SRS (Q2055641) (← links)
- Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices (Q2055645) (← links)
- Continuous verifiable delay functions (Q2055650) (← links)
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes (Q2055652) (← links)
- Signatures from sequential-OR proofs (Q2055653) (← links)
- New constructions of statistical NIZKs: dual-mode DV-NIZKs and more (Q2055662) (← links)
- Non-interactive zero-knowledge in pairing-free groups from weaker assumptions (Q2055663) (← links)
- Statistical Zaps and new oblivious transfer protocols (Q2055674) (← links)
- Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes (Q2055683) (← links)
- Lossy CSI-fish: efficient signature scheme with tight reduction to decisional CSIDH-512 (Q2055690) (← links)
- Threshold schemes from isogeny assumptions (Q2055691) (← links)
- Threshold ring signatures: new definitions and post-quantum security (Q2055701) (← links)
- Linearly-homomorphic signatures and scalable mix-nets (Q2055710) (← links)
- Efficient redactable signature and application to anonymous credentials (Q2055711) (← links)
- Non-interactive zero knowledge from sub-exponential DDH (Q2056667) (← links)
- Classical vs quantum random oracles (Q2056754) (← links)
- On the compressed-oracle technique, and post-quantum security of proofs of sequential work (Q2056756) (← links)
- Order-C secure multiparty computation for highly repetitive circuits (Q2056761) (← links)
- Public-coin statistical zero-knowledge batch verification against malicious verifiers (Q2056790) (← links)
- Fully secure ABE with outsourced decryption against chosen ciphertext attack (Q2057133) (← links)
- An improvement of multi-exponentiation with encrypted bases argument: smaller and faster (Q2057167) (← links)
- Banquet: short and fast signatures from AES (Q2061922) (← links)
- Group signatures with user-controlled and sequential linkability (Q2061926) (← links)
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings (Q2061939) (← links)
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices (Q2061957) (← links)
