The following pages link to Zero-knowledge proofs of identity (Q1112785):
Displaying 50 items.
- Nonlinearities in elliptic curve authentication (Q296311) (← links)
- Authenticated commutator key agreement protocol (Q338834) (← links)
- Identity based identification from algebraic coding theory (Q391761) (← links)
- Extending concurrent signature to multiple parties (Q401477) (← links)
- Programmable hash functions and their applications (Q434345) (← links)
- Leakproof secret sharing protocols with applications to group identification scheme (Q439799) (← links)
- The complexity of debate checking (Q493647) (← links)
- Automated proofs for asymmetric encryption (Q540682) (← links)
- Secure electronic bills of lading: Blind counts and digital signatures (Q609000) (← links)
- Authentication schemes from actions on graphs, groups, or rings (Q638486) (← links)
- Zero-knowledge identification scheme based on Weil pairing (Q639425) (← links)
- Fault-based attack on Montgomery's ladder algorithm (Q656523) (← links)
- On Schnorr's preprocessing for digital signature schemes (Q676822) (← links)
- Backtracking-assisted multiplication (Q680916) (← 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)
- Zero-knowledge proofs of knowledge for group homomorphisms (Q887447) (← links)
- FORSAKES: a forward-secure authenticated key exchange protocol based on symmetric key-evolving schemes (Q895004) (← links)
- Protocol completion incentive problems in cryptographic Vickrey auctions (Q934962) (← links)
- Cryptanalysis and improvement of an ID-based ad-hoc anonymous identification scheme at CT-RSA 05 (Q989506) (← links)
- A non-interactive deniable authentication scheme based on designated verifier proofs (Q1007888) (← links)
- Security proofs for identity-based identification and signature schemes (Q1027974) (← 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)
- On the tightness of forward-secure signature reductions (Q1715854) (← links)
- Practical and provably secure release of a secret and exchange of signatures (Q1903345) (← links)
- Classical proofs of quantum knowledge (Q2056758) (← links)
- Identity-based authenticated encryption with identity confidentiality (Q2067611) (← links)
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures (Q2152049) (← links)
- A group identification protocol with leakage resilience of secret sharing scheme (Q2173730) (← links)
- Speeding-up verification of digital signatures (Q2220442) (← links)
- Efficient RSA key generation and threshold Paillier in the two-party setting (Q2423838) (← links)
- Security models and proof strategies for plaintext-aware encryption (Q2442648) (← links)
- Entity authentication schemes using braid word reduction (Q2489938) (← links)
- Generalized proofs of knowledge with fully dynamic setup (Q2695646) (← links)
- An efficient statistical zero-knowledge authentication protocol for smart cards (Q2804907) (← links)
- Concurrent Non-Malleable Commitments (and More) in 3 Rounds (Q2829950) (← links)
- Cryptanalysis and improvements on some graph-based authentication schemes (Q2831095) (← links)
- Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting (Q2890015) (← links)
- On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits (Q2947522) (← links)
- From Identification to Signatures, Tightly: A Framework and Generic Transforms (Q2953785) (← links)
- A new certificateless multiple key agreement scheme (Q2966501) (← links)
- Protocols for quantum binary voting (Q2973383) (← links)
- Proving Computational Ability (Q3088170) (← links)
