On the Amortized Complexity of Zero-Knowledge Protocols

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

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

On the Concrete Complexity of Zero-Knowledge Proofs

English

On the Composition of Public-Coin Zero-Knowledge Protocols

2011English

Amortized Communication Complexity

English

Round Complexity of Common Randomness Generation: The Amortized Setting

2020English

An Amortized-Complexity Method to Compute the Riemann Zeta Function

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2011English

Pseudo Trust: Zero-Knowledge Based Authentication in Anonymous Peer-To-Peer Protocols

2007English

Computational Complexity and Knowledge Complexity

SIAM Journal on Computing
MathematicsComputer Science
1998English

Complexity of Infinite Sequences With Zero Entropy

Acta Arithmetica
Number TheoryAlgebra
2010English

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

2014English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy