scientific article; zbMATH DE number 4039794
From MaRDI portal
Publication:3778673
Cited in
(5)- Minimum disclosure proofs of knowledge
- Practic zero-knowledge proofs: Giving hints and using deficiencies
- A perfect zero-knowledge proof system for a problem equivalent to the discrete logarithm
- On the communication complexity of zero-knowledge proofs
- Constant-round perfect zero-knowledge computationally convincing protocols
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 Q3778673)