Amanote Research
Register
Sign In
On the Concrete Complexity of Zero-Knowledge Proofs
doi 10.1007/0-387-34805-0_45
Full Text
Open PDF
Abstract
Available in
full text
Date
Unknown
Authors
Joan Boyar
René Peralta
Publisher
Springer New York
Related search
Super-Perfect Zero-Knowledge Proofs
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
General Properties of Quantum Zero-Knowledge Proofs
Efficient Certification and Zero-Knowledge Proofs of Knowledge on Infrastructure Topology Graphs
On the Amortized Complexity of Zero-Knowledge Protocols
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Divertible Zero Knowledge Interactive Proofs and Commutative Random Self-Reducibility
A Note on the Complexity of Classical and Intuitionistic Proofs
The Complexity of Generating and Checking Proofs of Membership
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
