Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-76581-5_19
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Lattice-Based Zero-Knowledge Arguments for Integer Relations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Short Pairing-Based Non-Interactive Zero-Knowledge Arguments

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2019English

Hard Functions for Low-Degree Polynomials Over Prime Fields

ACM Transactions on Computation Theory
Computational TheoryTheoretical Computer ScienceMathematics
2013English

Hard Functions for Low-Degree Polynomials Over Prime Fields

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Deficiency and Ambiguity of Low Degree Permutation Polynomials

English

The Arguments for a Permanent Zero Interest Rate.

Advances in Social Sciences Research Journal
2018English

Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments From Any One-Way Function

SIAM Journal on Computing
MathematicsComputer Science
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy