Zero-knowledge proofs of identity
From MaRDI portal
Publication:1112785
DOI10.1007/BF02351717zbMath0659.94006WikidataQ27910307 ScholiaQ27910307MaRDI QIDQ1112785
Uriel Feige, Adi Shamir, Amos Fiat
Publication date: 1988
Published in: Journal of Cryptology (Search for Journal in Brave)
Related Items
Public key authentication scheme over quaternions, Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting, Nonlinearities in elliptic curve authentication, Boneh-Franklin IBE, Optimal Use of Montgomery Multiplication on Smart Cards, Security of 2t-Root Identification and Signatures, Proving Without Knowing: On Oblivious, Agnostic and Blindfolded Provers, A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties, Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge, A cryptographic primitive based on hidden-order groups, Leakage-Resilient Identification Schemes from Zero-Knowledge Proofs of Storage, On the design of cryptographic primitives, The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures, Practical and provably secure release of a secret and exchange of signatures, Authenticated commutator key agreement protocol, A zero-knowledge identification protocol in the ring of Gaussian integers, On characterizations of escrow encryption schemes, A group identification protocol with leakage resilience of secret sharing scheme, Secure electronic bills of lading: Blind counts and digital signatures, Off-line electronic cash based on secret-key certificates, Identity based identification from algebraic coding theory, Communication efficient Zero-knowledge Proofs of knowledge, On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits, Zero-knowledge proofs of knowledge for group homomorphisms, Practical proofs of knowledge without relying on theoretical proofs of membership on languages, Extending concurrent signature to multiple parties, On separating proofs of knowledge from proofs of membership of languages and its application to secure identification schemes, From Identification to Signatures, Tightly: A Framework and Generic Transforms, A generic transform from multi-round interactive proof to NIZK, Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use, FORSAKES: a forward-secure authenticated key exchange protocol based on symmetric key-evolving schemes, Sherlock Holmes zero-knowledge protocols, Efficient RSA key generation and threshold Paillier in the two-party setting, NIWI and new notions of extraction for algebraic languages, A new certificateless multiple key agreement scheme, Programmable hash functions and their applications, Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks, Generalized proofs of knowledge with fully dynamic setup, Authentication schemes from actions on graphs, groups, or rings, Cryptanalysis of Harari's identification scheme, Leakproof secret sharing protocols with applications to group identification scheme, Zero-knowledge identification scheme based on Weil pairing, Protocols for quantum binary voting, Security models and proof strategies for plaintext-aware encryption, On the tightness of forward-secure signature reductions, Speeding-up verification of digital signatures, Fault-based attack on Montgomery's ladder algorithm, Secure and efficient off-line digital money (extended abstract), Protocol completion incentive problems in cryptographic Vickrey auctions, When Is a Semi-honest Secure Multiparty Computation Valuable?, Efficient signature generation by smart cards, Practic zero-knowledge proofs: Giving hints and using deficiencies, An interactive identification scheme based on discrete logarithms and factoring, The complexity of debate checking, On Schnorr's preprocessing for digital signature schemes, Backtracking-assisted multiplication, An almost-constant round interactive zero-knowledge proof, Efficient non-malleable commitment schemes, Tighter Reductions for Forward-Secure Signature Schemes, Automated proofs for asymmetric encryption, A novel 3-pass identification scheme and signature scheme based on multivariate quadratic polynomials, Entity authentication schemes using braid word reduction, Efficient non-malleable commitment schemes, Improved Zero-Knowledge Identification with Lattices, Automated Proofs for Asymmetric Encryption, Authentication from Matrix Conjugation, Cryptanalysis and improvement of an ID-based ad-hoc anonymous identification scheme at CT-RSA 05, An efficient and secure two-flow zero-knowledge identification protocol, Lattice-Based Identification Schemes Secure Under Active Attacks, One-message statistical Zero-Knowledge Proofs and space-bounded verifier, An efficient statistical zero-knowledge authentication protocol for smart cards, A non-interactive deniable authentication scheme based on designated verifier proofs, On the communication complexity of zero-knowledge proofs, Identification protocols and signature schemes based on supersingular isogeny problems, Proving Computational Ability, Strong Proofs of Knowledge, Classical proofs of quantum knowledge, Unifying Zero-Knowledge Proofs of Knowledge, Precise Time and Space Simulatable Zero-Knowledge, Security proofs for identity-based identification and signature schemes, Concurrent Non-Malleable Commitments (and More) in 3 Rounds, A NEW BATCH IDENTIFICATION SCHEME, Identity-based authenticated encryption with identity confidentiality, Cryptanalysis and improvements on some graph-based authentication schemes, The GPS Identification Scheme Using Frobenius Expansions, Improving the exact security of digital signature schemes, Applying a formal analysis technique to the CCITT X.509 strong two-way authentication protocol, Constant-round perfect zero-knowledge computationally convincing protocols
Cites Work
- Unnamed Item
- Formal theories of knowledge in AI and robotics
- A “Paradoxical” Solution to The Signature Problem
- An efficient solution of the congruence<tex>x^2 + ky^2 = mpmod{n}</tex>
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- A method for obtaining digital signatures and public-key cryptosystems
- The knowledge complexity of interactive proof-systems
