scientific article; zbMATH DE number 1440055

MaRDI QIDQ4950041zbMATHFDO

Authors Guillaume Poupard, Jacques Stern

Publication date 3 December 2001

zbMATH Keywords

factorization of integerszero knowledge proofsstatistical interactive proofs

Mathematics Subject Classification ID

Randomized algorithms (68W20) Cryptography (94A60)

Recommendations

• Demonstrating possession without revealing factors and its application
• Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes
• scientific article; zbMATH DE number 4057443
• Zero-knowledge proofs of identity

Cited in

(16)

• PURED: a unified framework for resource-hard functions
• A zero-knowledge identification protocol in the ring of Gaussian integers
• Unifying Zero-Knowledge Proofs of Knowledge
• Blind polynomial evaluation and data trading
• Topics in Cryptology – CT-RSA 2004
• Threshold ECDSA with an offline recovery party
• Bandwidth-efficient threshold EC-DSA
• Demonstrating possession without revealing factors and its application
• scientific article; zbMATH DE number 2079923 (Why is no real title available?)
• scientific article; zbMATH DE number 4041785 (Why is no real title available?)
• Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model
• One round threshold ECDSA without roll call
• Simple zero-knowledge proof of knowing \(\sqrt{X_1}\) or \(\sqrt{X_2}\) mod \(N\)
• A discrete logarithm implementation of perfect zero-knowledge blobs
• Argument of knowledge protocol for a Goppa codeword and for an error of a bounded weigth
• Hashing solutions instead of generating problems: on the interactive certification of RSA moduli

This page was built for publication:

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