Publicly Verifiable Non-Interactive Zero-Knowledge Proofs

doi 10.1007/3-540-38424-3_26
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

Divertible Zero Knowledge Interactive Proofs and Commutative Random Self-Reducibility

English

Super-Perfect Zero-Knowledge Proofs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2020English

Short Pairing-Based Non-Interactive Zero-Knowledge Arguments

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Correction To: Non-Interactive Zero-Knowledge With Preprocessing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2000English

Multi-Client Non-Interactive Verifiable Computation

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

General Properties of Quantum Zero-Knowledge Proofs

English

Minimum-Knowledge Interactive Proofs for Decision Problems

SIAM Journal on Computing
MathematicsComputer Science
1989English

On the Concrete Complexity of Zero-Knowledge Proofs

English

Efficient Certification and Zero-Knowledge Proofs of Knowledge on Infrastructure Topology Graphs

2014English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy