The following pages link to Zero-knowledge proofs of identity (Q1112785):
Displayed 20 items.
- On Schnorr's preprocessing for digital signature schemes (Q676822) (← links)
- Applying a formal analysis technique to the CCITT X.509 strong two-way authentication protocol (Q802867) (← links)
- Constant-round perfect zero-knowledge computationally convincing protocols (Q808240) (← links)
- On the design of cryptographic primitives (Q850775) (← links)
- Protocol completion incentive problems in cryptographic Vickrey auctions (Q934962) (← links)
- A non-interactive deniable authentication scheme based on designated verifier proofs (Q1007888) (← links)
- Efficient signature generation by smart cards (Q1180508) (← links)
- Practic zero-knowledge proofs: Giving hints and using deficiencies (Q1180509) (← links)
- An interactive identification scheme based on discrete logarithms and factoring (Q1184505) (← links)
- An almost-constant round interactive zero-knowledge proof (Q1198029) (← links)
- On the communication complexity of zero-knowledge proofs (Q1261016) (← links)
- Practical proofs of knowledge without relying on theoretical proofs of membership on languages (Q1391315) (← links)
- Improving the exact security of digital signature schemes (Q1596365) (← links)
- Practical and provably secure release of a secret and exchange of signatures (Q1903345) (← links)
- Entity authentication schemes using braid word reduction (Q2489938) (← 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)
- 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)