The following pages link to (Q4249347):
Displaying 23 items.
- Certificateless message recovery signatures providing Girault's level-3 security (Q407496) (← links)
- Which languages have 4-round zero-knowledge proofs? (Q421047) (← links)
- The wonderful world of global random oracles (Q1648798) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Linearly-homomorphic signatures and scalable mix-nets (Q2055710) (← links)
- SimS: a simplification of SiGamal (Q2118549) (← links)
- On instantiating the algebraic group model from falsifiable assumptions (Q2119007) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Composition with knowledge assumptions (Q2139641) (← links)
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures (Q2152049) (← links)
- Random walks and concurrent zero-knowledge (Q2229263) (← links)
- Efficient fully structure-preserving signatures and shrinking commitments (Q2318093) (← links)
- Existence of 3-round zero-knowledge proof systems for NP (Q2425854) (← links)
- Lower bounds for non-black-box zero knowledge (Q2490264) (← links)
- On the Existence of Extractable One-Way Functions (Q2829449) (← links)
- On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption (Q2945373) (← links)
- On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits (Q2947522) (← links)
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion (Q2953796) (← links)
- 3-Message Zero Knowledge Against Human Ignorance (Q3179352) (← links)
- On the (In)Security of SNARKs in the Presence of Oracles (Q3179354) (← links)
- Interactive Oracle Proofs (Q3181021) (← links)
- Constant-Round Leakage-Resilient Zero-Knowledge Argument for NP from the Knowledge-of-Exponent Assumption (Q3194601) (← links)
- On the Classification of Knowledge-of-exponent Assumptions in Cyclic Groups (Q5135711) (← links)
