Super-Perfect Zero-Knowledge Proofs

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-030-43662-9_8
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer International Publishing

Related search

Publicly Verifiable Non-Interactive Zero-Knowledge Proofs

English

General Properties of Quantum Zero-Knowledge Proofs

English

On the Concrete Complexity of Zero-Knowledge Proofs

English

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

2014English

Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Divertible Zero Knowledge Interactive Proofs and Commutative Random Self-Reducibility

English

Perfect Zero–one Matrices

Mathematical Programming, Series B
MathematicsSoftware
1974English

Two Short Proofs of the Perfect Forest Theorem

Theory and Applications of Graphs
CombinatoricsNumerical AnalysisTheoretical Computer ScienceDiscrete Mathematics
2017English

Minimum-Knowledge Interactive Proofs for Decision Problems

SIAM Journal on Computing
MathematicsComputer Science
1989English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy