A discrete logarithm implementation of perfect zero-knowledge blobs

DOI10.1007/BF00204448MaRDI QIDQ913490zbMATH OpenOpenAlexFDO

Authors Stuart A. Kurtz, Mark W. Krentel, Joan Boyar

Publication date 1990

Published in Journal of Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf00204448

zbMATH Keywords

primescryptographycryptographic protocolsdiscrete logarithmsblobszero-knowledge proof systemsfactoring numbers

Mathematics Subject Classification ID

Theory of software (68N99) Abstract data types; algebraic specification (68Q65) Theory of operating systems (68N25)

Recommendations

• Elliptic curve implementation of zero-knowledge blobs
• scientific article; zbMATH DE number 4053065
• A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm
• Publication:5750402
• scientific article; zbMATH DE number 1440055

Cites work

• scientific article; zbMATH DE number 4037760 (Why is no real title available?)
• scientific article; zbMATH DE number 4057443 (Why is no real title available?)
• scientific article; zbMATH DE number 4101088 (Why is no real title available?)
• scientific article; zbMATH DE number 3657869 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Cryptanalysis: a survey of recent results
• Does co-NP have short interactive proofs ?
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• How to Generate Factored Random Numbers
• Inferring sequences produced by pseudo-random number generators
• Minimum disclosure proofs of knowledge
• The Knowledge Complexity of Interactive Proof Systems
• The knowledge complexity of interactive proof-systems

Cited in

(13)

• Information Security and Cryptology - ICISC 2005
• Elliptic curve implementation of zero-knowledge blobs
• Tight bounds for the multiplicative complexity of symmetric functions
• Minimum disclosure proofs of knowledge
• Realizing Hash-and-Sign Signatures under Standard Assumptions
• scientific article; zbMATH DE number 4185032 (Why is no real title available?)
• A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm
• On the communication complexity of zero-knowledge proofs
• Reducing complexity assumptions for statistically-hiding commitment
• Finding collisions in interactive protocols -- tight lower bounds on the round and communication complexities of statistically hiding commitments
• Constant-round perfect zero-knowledge computationally convincing protocols
• Which languages have 4-round zero-knowledge proofs?
• Commitments with efficient zero-knowledge arguments from subset sum problems

This page was built for publication: A discrete logarithm implementation of perfect zero-knowledge blobs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q913490)