Transparent SNARKs from DARK compilers
B Bünz, B Fisch, A Szepieniec - … on the Theory and Applications of …, 2020 - Springer
We construct a new polynomial commitment scheme for univariate and multivariate
polynomials over finite fields, with logarithmic size evaluation proofs and verification time …
polynomials over finite fields, with logarithmic size evaluation proofs and verification time …
Transparent snarks from dark compilers
B Bünz, B Fisch, A Szepieniec - 39th Annual International …, 2020 - nyuscholars.nyu.edu
We construct a new polynomial commitment scheme for univariate and multivariate
polynomials over finite fields, with logarithmic size evaluation proofs and verification time …
polynomials over finite fields, with logarithmic size evaluation proofs and verification time …
[引用][C] Transparent SNARKs from DARK Compilers
B Bünz, B Fisch, A Szepieniec - Advances in Cryptology–EUROCRYPT …, 2020 - cir.nii.ac.jp
Transparent SNARKs from DARK Compilers | CiNii Research CiNii 国立情報学研究所 学術
情報ナビゲータ[サイニィ] 詳細へ移動 検索フォームへ移動 論文・データをさがす 大学図書館の本を …
情報ナビゲータ[サイニィ] 詳細へ移動 検索フォームへ移動 論文・データをさがす 大学図書館の本を …
Transparent SNARKs from DARK Compilers
B Bünz, B Fisch, A Szepieniec - Cryptology ePrint Archive, 2019 - eprint.iacr.org
We construct a new polynomial commitment scheme for univariate and multivariate
polynomials over finite fields, with logarithmic size evaluation proofs and verification time …
polynomials over finite fields, with logarithmic size evaluation proofs and verification time …
Transparent SNARKs from DARK Compilers
B Bünz, B Fisch, A Szepieniec - … on the Theory and Applications of …, 2020 - dl.acm.org
We construct a new polynomial commitment scheme for univariate and multivariate
polynomials over finite fields, with logarithmic size evaluation proofs and verification time …
polynomials over finite fields, with logarithmic size evaluation proofs and verification time …
[PDF][PDF] Transparent SNARKs from DARK Compilers
B Bünz, B Fisch, A Szepieniec - iacr.org
We construct a new polynomial commitment scheme for univariate and multivariate
polynomials over finite fields, with logarithmic size evaluation proofs and verification time …
polynomials over finite fields, with logarithmic size evaluation proofs and verification time …
[PDF][PDF] Transparent SNARKs from DARK Compilers
B Bünz, B Fisch, A Szepieniec - academia.edu
We construct a new polynomial commitment scheme for univariate and multivariate
polynomials over finite fields, with logarithmic size evaluation proofs and verification time …
polynomials over finite fields, with logarithmic size evaluation proofs and verification time …
[PDF][PDF] Transparent SNARKs from DARK Compilers
B Bünz, B Fisch, A Szepieniec - eprint.iacr.org
We construct a new polynomial commitment scheme for univariate and multivariate
polynomials over finite fields, with logarithmic size evaluation proofs and verification time …
polynomials over finite fields, with logarithmic size evaluation proofs and verification time …