Short Pairing-Based Non-Interactive Zero-Knowledge Arguments

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-642-17373-8_19
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Lattice-Based Zero-Knowledge Arguments for Integer Relations

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Publicly Verifiable Non-Interactive Zero-Knowledge Proofs

English

Correction To: Non-Interactive Zero-Knowledge With Preprocessing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

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

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2019English

Shorter Pairing-Based Arguments Under Standard Assumptions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2018English

Interactive Physical Zero-Knowledge Proof for Norinori

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

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