An improved protocol for demonstrating possession of discrete logarithms and some generalizations
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 4041785
- A short proof for explicit formulas for discrete logarithms in finite fields
- A shorter proof for an explicit formula for discrete logarithms in finite fields
- Proofs of knowledge for non-monotone discrete-log formulae and applications
- scientific article; zbMATH DE number 4185032
- A rigorous proof of the Waterloo algorithm for the discrete logarithm problem
- Discrete logarithms: Recent progress
- Public Key Cryptography - PKC 2006
- Bounds in various generalized settings of the discrete logarithm problem
- A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm
Cited in
(42)- Minimum disclosure proofs of knowledge
- Efficient signature generation by smart cards
- Practic zero-knowledge proofs: Giving hints and using deficiencies
- Distributed user identification by zero-knowledge access rights proving
- An interactive identification scheme based on discrete logarithms and factoring
- A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm
- A rigorous proof of the Waterloo algorithm for the discrete logarithm problem
- Zero-knowledge argument for simultaneous discrete logarithms
- Practical and provably secure release of a secret and exchange of signatures
- What security can we achieve within 4 rounds?
- More efficient digital signatures with tight multi-user security
- New technique for chosen-ciphertext security based on non-interactive zero-knowledge
- Proving possession of arbitrary secrets while not giving them away: New protocols and a proof in GNY logic
- Short paper: The proof is in the pudding. Proofs of work for solving discrete logarithms
- On the impossibility of purely algebraic signatures
- Efficient schemes for anonymous yet authorized and bounded use of cloud resources
- Direct demonstration of the power to break public-key cryptosystems
- Demonstrating possession without revealing factors and its application
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Robust Threshold Schemes Based on the Chinese Remainder Theorem
- Zero-knowledge argument for simultaneous discrete logarithms
- Programmable Hash Functions and Their Applications
- Breaking and Repairing Damgård et al. Public Key Encryption Scheme with Non-interactive Opening
- The Power of Anonymous Veto in Public Discussion
- Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
- scientific article; zbMATH DE number 4041785 (Why is no real title available?)
- Programmable hash functions and their applications
- Proofs of knowledge for non-monotone discrete-log formulae and applications
- The composite discrete logarithm and secure authentication
- Short proofs of knowledge for factoring
- Blinding for unanticipated signatures
- Argument of knowledge protocol for a Goppa codeword and for an error of a bounded weigth
- Argument of knowledge of a Goppa codeword and of a bounded error
- scientific article; zbMATH DE number 4185032 (Why is no real title available?)
- Public Key Cryptography - PKC 2006
- Cryptography based on number fields with large regulator
- Secure electronic bills of lading: Blind counts and digital signatures
- On Schnorr's preprocessing for digital signature schemes
- On concrete security treatment of signatures based on multiple discrete logarithms
- Sherlock Holmes zero-knowledge protocols secure against active attackers
- Constant-round perfect zero-knowledge computationally convincing protocols
- A discrete logarithm implementation of perfect zero-knowledge blobs
This page was built for publication: An improved protocol for demonstrating possession of discrete logarithms and some generalizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3792628)