Elliptic curve implementation of zero-knowledge blobs
N Koblitz - Journal of Cryptology, 1991 - Springer
In [2] the authors show how to construct the building blocks for perfect zero-knowledge
proofs called “blobs” using the discrete log problem. Contrary to what they remark on p. 73 of …
proofs called “blobs” using the discrete log problem. Contrary to what they remark on p. 73 of …
Elliptic curve implementation of zero-knowledge blobs
N Koblitz - Journal of Cryptology, 1991 - dl.acm.org
In [2] the authors show how to construct the building blocks for perfect zero-knowledge
proofs called" blobs" using the discrete log problem. Contrary to what they remark on p. 73 of …
proofs called" blobs" using the discrete log problem. Contrary to what they remark on p. 73 of …
[引用][C] Elliptic Curve Implementation of Zero-Knowledge Blobs
N KOBLITZ - J. of Cryptology, 1991 - cir.nii.ac.jp
[引用][C] Elliptic curve implementation of zero-knowledge blobs
N KOBLITZ - Journal of cryptology, 1991 - pascal-francis.inist.fr
Elliptic curve implementation of zero-knowledge blobs CNRS Inist Pascal-Francis CNRS
Pascal and Francis Bibliographic Databases Simple search Advanced search Search by …
Pascal and Francis Bibliographic Databases Simple search Advanced search Search by …
[引用][C] Elliptic curve implementation of zero-knowledge blobs
N KOBLITZ - J. Cryptology, 1991 - cir.nii.ac.jp
Elliptic curve implementation of zero-knowledge blobs | CiNii Research CiNii 国立情報学
研究所 学術情報ナビゲータ[サイニィ] 詳細へ移動 検索フォームへ移動 論文・データをさがす 大学 …
研究所 学術情報ナビゲータ[サイニィ] 詳細へ移動 検索フォームへ移動 論文・データをさがす 大学 …