A discrete logarithm implementation of perfect zero-knowledge blobs

DOI10.1007/BF00204448zbMath0699.68035MaRDI QIDQ913490

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

Publication date: 1990

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

zbMATH Keywords

primes; cryptography; cryptographic protocols; discrete logarithms; blobs; zero-knowledge proof systems; factoring numbers

Mathematics Subject Classification ID

68Q65: Abstract data types; algebraic specification

68N25: Theory of operating systems

68N99: Theory of software

Related Items

Constant-round perfect zero-knowledge computationally convincing protocols, Tight bounds for the multiplicative complexity of symmetric functions, Minimum disclosure proofs of knowledge, Elliptic curve implementation of zero-knowledge blobs, On the communication complexity of zero-knowledge proofs

Cites Work

• Does co-NP have short interactive proofs ?
• Minimum disclosure proofs of knowledge
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• How to Generate Factored Random Numbers
• Inferring sequences produced by pseudo-random number generators
• The Knowledge Complexity of Interactive Proof Systems
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• The knowledge complexity of interactive proof-systems
• Cryptanalysis: a survey of recent results
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item