The following pages link to Zero-knowledge proofs of identity (Q1112785):
Displaying 36 items.
- Strong Proofs of Knowledge (Q3088175) (← links)
- Precise Time and Space Simulatable Zero-Knowledge (Q3092346) (← links)
- A cryptographic primitive based on hidden-order groups (Q3182465) (← links)
- When Is a Semi-honest Secure Multiparty Computation Valuable? (Q3297650) (← links)
- Optimal Use of Montgomery Multiplication on Smart Cards (Q3452242) (← links)
- Security of 2t-Root Identification and Signatures (Q3452348) (← links)
- Proving Without Knowing: On Oblivious, Agnostic and Blindfolded Provers (Q3452351) (← links)
- Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge (Q3454578) (← links)
- Leakage-Resilient Identification Schemes from Zero-Knowledge Proofs of Storage (Q3460114) (← links)
- Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use (Q3503874) (← links)
- Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks (Q3519535) (← links)
- Unifying Zero-Knowledge Proofs of Knowledge (Q3637145) (← links)
- A NEW BATCH IDENTIFICATION SCHEME (Q3646207) (← links)
- On characterizations of escrow encryption schemes (Q4571999) (← links)
- Cryptanalysis of Harari's identification scheme (Q4608519) (← links)
- Secure and efficient off-line digital money (extended abstract) (Q4630266) (← links)
- Tighter Reductions for Forward-Secure Signature Schemes (Q4916016) (← links)
- Improved Zero-Knowledge Identification with Lattices (Q4933208) (← links)
- Public key authentication scheme over quaternions (Q5035018) (← links)
- Boneh-Franklin IBE (Q5050183) (← links)
- A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties (Q5056025) (← links)
- A zero-knowledge identification protocol in the ring of Gaussian integers (Q5069762) (← links)
- Off-line electronic cash based on secret-key certificates (Q5096329) (← links)
- Communication efficient Zero-knowledge Proofs of knowledge (Q5096802) (← links)
- Automated Proofs for Asymmetric Encryption (Q5187835) (← links)
- Authentication from Matrix Conjugation (Q5189801) (← links)
- One-message statistical Zero-Knowledge Proofs and space-bounded verifier (Q5204303) (← links)
- An efficient and secure two-flow zero-knowledge identification protocol (Q5443534) (← links)
- Lattice-Based Identification Schemes Secure Under Active Attacks (Q5445452) (← links)
- The GPS Identification Scheme Using Frobenius Expansions (Q5504546) (← links)
- A novel 3-pass identification scheme and signature scheme based on multivariate quadratic polynomials (Q5742929) (← links)
- Efficient non-malleable commitment schemes (Q5902225) (← links)
- Identification protocols and signature schemes based on supersingular isogeny problems (Q5919490) (← links)
- Efficient non-malleable commitment schemes (Q5920255) (← links)
- On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes (Q6064047) (← links)
- Complete decomposition of dihedral groups with application to key exchange protocol (Q6650335) (← links)
